A simple method of geometric programming with degree of multiple difficulties
  
View Full Text  View/Add Comment  Download reader
DOI:10.7511/jslx19992033
KeyWord:geometric programming,degree of difficulty,one dimensional search,direction factor,iterative formula.
Cui Endi  Li Laiyi
Hits: 1243
Download times: 8
Abstract:
      A formula for calculating direction factor as well as an iterative formula for one dimensional search is derived. A simple computing method for solving the problem of geometric programming with degree of multiple difficulties is given in this paper.