메뉴 건너뛰기




Volumn 21, Issue 1, 2002, Pages 95-109

Solving posynomial geometric programming problems via generalized linear programming

Author keywords

Column generation; Computational algorithm; Geometric programming; Linearization; Nonlinear optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; LINEARIZATION; MATRIX ALGEBRA; PERSONAL COMPUTERS; POLYNOMIALS;

EID: 0036182628     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013500514075     Document Type: Article
Times cited : (32)

References (22)
  • 2
    • 4243984761 scopus 로고
    • Some computational experience with a modified convex simplex algorithm for geometric programming
    • Armament Development and Test Center, Elgin AFB, Florida, Technical Report ADTC-72-70
    • (1972)
    • Beck, P.A.1    Ecker, J.G.2
  • 13
    • 0042216571 scopus 로고    scopus 로고
    • Lotsizing and setup time reduction under stochastic demand: A geometric programming approach
    • Department of Management Science, University of Iowa, IA, Working Paper Series No. 88-12, 1988
    • Jha, S.1    Kortanek, K.O.2    No, H.3
  • 14
    • 0008427738 scopus 로고
    • A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
    • (1992) Optimization , vol.23 , pp. 303-322
    • Kortanek, K.O.1    No, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.