Controlled dual perturbations for posynomial programs
With geometric programs getting larger and larger, the dual based solution methods which optimize a less complicated problem than the original problem become more important. However there are two major difficulties related to the development of a dual method. One is the non- differentiability of the dual objective function over its feasible region and the other one is the conversion of a dual solution to a primal solution. In this paper the authors introduce a well-controlled method for posynomial programs. Given any arbitrarily small number \(\epsilon >0\), they select a proper perturbation vector \(\ell\) to construct a perturbed dual program with a differentiable objective function over linear constraints. Solving this perturbed dual program, they find an \(\epsilon\)-optimal dual solution. Then they use this dual solution to construct a linear program. An \(\epsilon\)-optimal solution to the original geometric program is provided by the dual solution of this linear program.
- Controlled dual perturbations for central path trajectories in geometric programming
- On geometric programming problems having negative degrees of difficulty
- Controlled dual perturbations for l p -programming
- A perturbation approach to the main duality theorem of quadratic geometric programming
- scientific article; zbMATH DE number 3871044
- Minimum cross-entropy analysis with entropy-type constraints
- On subsidiary problems in geometric programming
- Linearly constrained estimation by mathematical programming
- Robustness of posynomial geometric programming optima
- Controlled dual perturbations for central path trajectories in geometric programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- An interval programming approach for developing economic order quantity model with imprecise exponents and coefficients
- Posynomial parametric geometric programming with interval valued coefficient
- Sensitivity analysis in geometric programming: Theory and computations
- Perfect duality in solving geometric programming problems under uncertainty
- Lexicographic perturbation for multiparametric linear programming with applications to control
- Posynomial geometric programming with interval exponents and coefficients
- Posynomial geometric programming with parametric uncertainty
- Controlled dual perturbations for l p -programming
- A perturbation approach to the main duality theorem of quadratic geometric programming
- Non-standard posynomial geometric programs
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions
- Uncertain random geometric programming problems
This page was built for publication: Controlled dual perturbations for posynomial programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112725)
