A perturbation approach to the main duality theorem of quadratic geometric programming
From MaRDI portal
Publication:3762087
DOI10.1007/BF01259339zbMATH Open0623.90071OpenAlexW1977466872MaRDI QIDQ3762087FDOQ3762087
Shu-Cherng Fang, J. R. Rajasekera
Publication date: 1987
Published in: Zeitschrift f�r Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01259339
Recommendations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30) Mathematical programming (90C99)
Cites Work
Cited In (7)
- Controlled dual perturbations for posynomial programs
- Title not available (Why is that?)
- The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
- Sensitivity analysis in geometric programming: Theory and computations
- Minimum discrimination information problems via generalized geometric programming.
- An alternative approach to the refined duality theory of geometric programming
- Controlled dual perturbations for l p -programming
Uses Software
This page was built for publication: A perturbation approach to the main duality theorem of quadratic geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762087)