Pages that link to "Item:Q1824566"
From MaRDI portal
The following pages link to Posynomial geometric programming as a special case of semi-infinite linear programming (Q1824566):
Displaying 15 items.
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- Tractable approximate robust geometric programming (Q833439) (← links)
- A tutorial on geometric programming (Q1027158) (← links)
- Composite geometric programming (Q1117141) (← links)
- An alternative approach to the refined duality theory of geometric programming (Q1197451) (← links)
- On subsidiary problems in geometric programming (Q1206603) (← links)
- The APL phenomenon: An operational research perspective (Q1264098) (← links)
- Posynomial parametric geometric programming with interval valued coefficient (Q1762404) (← links)
- The stability of the maximum entropy method for nonsmooth semi-infinite programmings (Q1974191) (← links)
- Perfect duality in solving geometric programming problems under uncertainty (Q2412848) (← links)
- Posynomial geometric programming with interval exponents and coefficients (Q2462103) (← links)
- Posynomial geometric programming with parametric uncertainty (Q2569031) (← links)
- Non-standard posynomial geometric programs (Q3773703) (← links)
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions (Q5890837) (← links)
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions (Q6151584) (← links)