Posynomial geometric programming as a special case of semi-infinite linear programming
From MaRDI portal
Publication:1824566
DOI10.1007/BF00940932zbMath0682.90078OpenAlexW2015946634MaRDI QIDQ1824566
Jayant Rajgopal, Dennis L. Bricker
Publication date: 1990
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940932
Nonlinear programming (90C30) Linear programming (90C05) Semi-infinite programming (90C34) Duality theory (optimization) (49N15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (12)
Tractable approximate robust geometric programming ⋮ Perfect duality in solving geometric programming problems under uncertainty ⋮ Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions ⋮ Solving geometric programming problems with normal, linear and zigzag uncertainty distributions ⋮ The stability of the maximum entropy method for nonsmooth semi-infinite programmings ⋮ Posynomial geometric programming with interval exponents and coefficients ⋮ An alternative approach to the refined duality theory of geometric programming ⋮ On subsidiary problems in geometric programming ⋮ Posynomial parametric geometric programming with interval valued coefficient ⋮ The APL phenomenon: An operational research perspective ⋮ A tutorial on geometric programming ⋮ Posynomial geometric programming with parametric uncertainty
Cites Work
- Yet another geometric programming dual algorithm
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- The Cutting-Plane Method for Solving Convex Programs
- Solution of generalized geometric programs
- A linear programming approach to geometric programs
- An Infinite Linear Program with a Duality Gap
- Linearizing Geometric Programs
- Unnamed Item
- Unnamed Item
This page was built for publication: Posynomial geometric programming as a special case of semi-infinite linear programming