Dual to primal conversion in geometric programming

DOI10.1007/BF00933405zbMath0369.90122OpenAlexW2050643447MaRDI QIDQ1243250

Ron S. Dembo

Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00933405

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (14)

A globally convergent primal-dual interior point algorithm for convex programming ⋮ Sensitivity analysis in posynomial geometric programming ⋮ An infeasible interior-point algorithm for solving primal and dual geometric programs ⋮ Controlled dual perturbations for posynomial programs ⋮ Second order algorithms for the posynomial geometric programming dual, part I: Analysis ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Sensitivity analysis in geometric programming ⋮ On subsidiary problems in geometric programming ⋮ Current state of the art of algorithms and computer software for geometric programming ⋮ Dual to primal conversion in geometric programming ⋮ Sensitivity analysis in geometric programming: Theory and computations ⋮ Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model ⋮ On solving a primal geometric program by partial dual optimization ⋮ On the computational utility of posynomial geometric programming solution methods

Cites Work

• Dual to primal conversion in geometric programming
• Unnamed Item

This page was built for publication: Dual to primal conversion in geometric programming