Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints

DOI10.1007/BF01957169zbMATH Open0304.90092OpenAlexW1983140649MaRDI QIDQ4060744FDOQ4060744

Authors:

Publication date: 1975

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01957169

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Pseudo-Convex Functions
• Approximate Method of Solution for Non‐linear Fractional Programming

Cited In (4)

• On a theorem due to Crouzeix and Ferland
• Sufficient optimality conditions in continuous-time nonlinear programming
• Sufficient optimality conditions and duality for a quasiconvex programming problem
• On suffucient optimality conditions for mathematical programs with equality constraints

This page was built for publication: Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints

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