Sufficiency in nonlinear programming: A unified theorem

zbMATH Open0692.90088MaRDI QIDQ584075FDOQ584075

Authors: T. R. Gulati, Nadia Talaat 

Publication date: 1989

Published in: Opsearch (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1261905
• scientific article; zbMATH DE number 611090
• Sufficient optimality conditions and duality for a quasiconvex programming problem
• Optimality, minimax and duality in nonlinear programming
• On sufficient optimality conditions for a quasiconvex programming problem

zbMATH Keywords

Sufficient optimality conditionspseudoconvex objectivequasiconvex constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions (49K99)

Cited In (6)

• Optimality, minimax and duality in nonlinear programming
• Title not available (Why is that?)
• Sufficient optimality conditions in continuous-time nonlinear programming
• Title not available (Why is that?)
• Quasi-convex programming revisited
• Title not available (Why is that?)

This page was built for publication: Sufficiency in nonlinear programming: A unified theorem

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