A Note on Strict Converse Duality in Nonlinear Programming

DOI10.1080/02522667.1986.10698839MaRDI QIDQ3734175zbMATH OpenOpenAlexFDO

Authors 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

constraint qualificationconverse duality theoremsoptimal solutionquasiconvexstrictly pseudoconvex

Mathematics Subject Classification ID

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

Recommendations

• On Strict Converse Duality In Nonlinear Programming
• On various duality theorems in nonlinear programming
• On second-order converse duality in nonlinear programming problems
• scientific article; zbMATH DE number 59929
• A note on converse duality in nonlinear programming with cone constraints

Cites work

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

Cited in

(5)

• On various duality theorems in nonlinear programming
• Converse duality in nonlinear programming with cone constraints
• scientific article; zbMATH DE number 6117328 (Why is no real title available?)
• A note on converse duality in nonlinear programming with cone constraints
• On Strict Converse Duality In Nonlinear Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734175)