On Strict Converse Duality In Nonlinear Programming

DOI10.1080/02522667.1985.10698809zbMath0572.90084OpenAlexW1994149084MaRDI QIDQ3690594

Richard R Egudo, Bertram Mond

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1985.10698809

zbMATH Keywords

strict converse dualityweaker convexity conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Related Items (3)

On various duality theorems in nonlinear programming ⋮ A Note on Strict Converse Duality in Nonlinear Programming ⋮ Converse Duality in Nonlinear Programming

Cites Work

• A Strict Converse Duality Theorem in Nonlinear Programming
• Generalized convexity and duality in mathematical programming

This page was built for publication: On Strict Converse Duality In Nonlinear Programming