Converse Duality in Nonlinear Programming

DOI10.1080/02522667.1988.10698926zbMath0653.90061OpenAlexW1983156907MaRDI QIDQ3799823

Morgan A. Hanson, Richard R Egudo

Publication date: 1988

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

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

zbMATH Keywords

converse dualityKuhn-Tucker pointinvexity conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Related Items (3)

Multiobjective duality with invexity ⋮ Duality in Nonlinear Programming involving Semilocally B-vex and related functions ⋮ Duality in nonlinear programming involving semilocally convex and related functions

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• A Strict Converse Duality Theorem in Nonlinear Programming
• On Strict Converse Duality In Nonlinear Programming
• Generalized convexity and duality in mathematical programming
• Dual Programs [Letter to the Editor]

This page was built for publication: Converse Duality in Nonlinear Programming