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

DOI10.1090/S0002-9904-1968-11938-XzbMATH Open0155.28502OpenAlexW2000314332MaRDI QIDQ5538313FDOQ5538313

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

• Duality in quadratic programming
• A duality theorem for non-linear programming
• Duality Theory for Geometric Programming
• Symmetric dual quadratic programs
• A Duality Theorem for Convex Programs
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• Title not available (Why is that?)
• Title not available (Why is that?)
• Duality in nonlinear programming
• Title not available (Why is that?)

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)