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

DOI10.1090/S0002-9904-1968-11938-XMaRDI QIDQ5538313zbMATH OpenOpenAlexFDO

Authors Elmor L. Peterson, J. G. Ecker

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

Cites work

• scientific article; zbMATH DE number 3358254 (Why is no real title available?)
• scientific article; zbMATH DE number 3375256 (Why is no real title available?)
• scientific article; zbMATH DE number 3069630 (Why is no real title available?)
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• A Duality Theorem for Convex Programs
• A duality theorem for non-linear programming
• Duality Theory for Geometric Programming
• Duality in nonlinear programming
• Duality in quadratic programming
• Symmetric dual quadratic programs

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538313)