A Note on Strict Converse Duality in Nonlinear Programming

DOI10.1080/02522667.1986.10698839zbMath0598.90076OpenAlexW2029896594MaRDI QIDQ3734175

T. Weir

Publication date: 1986

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

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

zbMATH Keywords

optimal solutionconstraint qualificationconverse duality theoremsstrictly pseudoconvexquasiconvex

Mathematics Subject Classification ID

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

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• On Strict Converse Duality In Nonlinear Programming
• Invex functions and constrained local minima
• Generalization of some duality theorems in nonlinear programming
• Generalized convexity and duality in mathematical programming

This page was built for publication: A Note on Strict Converse Duality in Nonlinear Programming