One-dimensional searching method for positive coefficient geometric programming
  
View Full Text  View/Add Comment  Download reader
DOI:10.7511/jslx19954073
KeyWord:geometricinl programming,linear programming/one-dimemsional searching,
Li Laiyi  Guo Dong
Hits: 464
Download times: 0
Abstract:
      This paper gives an efficient method for solving positive coefficient geometric programming with manydegrees of difficulty.First of all the geometric programrning with D degree of difficulty is transformed into lin-ear programming with a D-dimensional and then into one-dimensional searching problem.The result showsthat this method is efficient.