An alternative approach to the refined duality theory of geometric programming
From MaRDI portal
Publication:1197451
DOI10.1016/0022-247X(92)90251-8zbMATH Open0767.90073OpenAlexW1998521912MaRDI QIDQ1197451FDOQ1197451
Authors: Jayant Rajgopal 
Publication date: 16 January 1993
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(92)90251-8
Recommendations
- On the duality of generalized geometric programming
- scientific article; zbMATH DE number 4158394
- scientific article; zbMATH DE number 3971598
- scientific article; zbMATH DE number 3871038
- scientific article; zbMATH DE number 4031395
- Geometric Duality in Multiple Objective Linear Programming
- On a compound duality classification for geometric programming
- Generalized duality and the geometry of linear programming
- A perturbation approach to the main duality theorem of quadratic geometric programming
- A new algorithm for geometric programming based on the linear structure of its dual problem.
Nonlinear programming (90C30) Duality theory (optimization) (49N15) Mathematical programming (90C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Title not available (Why is that?)
- Linearizing Geometric Programs
- Title not available (Why is that?)
- Posynomial geometric programming as a special case of semi-infinite linear programming
- Corrigendum to ``Measuring the relative balance of DMUs [Eur. J. Oper. Res. 221 (2012) 417-423]
- On a classification scheme for geometric programming and complementarity theorems††
Cited In (11)
- Title not available (Why is that?)
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions
- Proving strong duality for geometric optimization using a conic formulation
- Title not available (Why is that?)
- A general alternative procedure for solving negative degree of difficulty problems in geometric programming
- A perturbation approach to the main duality theorem of quadratic geometric programming
- Posynomial parametric geometric programming with interval valued coefficient
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
- Posynomial geometric programming with parametric uncertainty
- Non-standard posynomial geometric programs
- On a compound duality classification for geometric programming
This page was built for publication: An alternative approach to the refined duality theory of geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197451)
