Geometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems

DOI10.1090/S0002-9904-1968-11938-XzbMath0155.28502OpenAlexW2000314332MaRDI QIDQ5538313

J. G. Ecker, Elmor L. Peterson

Publication date: 1968

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1968-11938-x

zbMATH Keywords

operations research

Related Items (3)

Controlled dual perturbations for l p -programming ⋮ Efficiency in multiple objective optimization problems ⋮ Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Duality Theorem for Convex Programs
• Duality in quadratic programming
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• A duality theorem for non-linear programming
• Symmetric dual quadratic programs
• Duality Theory for Geometric Programming
• Duality in nonlinear programming

This page was built for publication: Geometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems