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

DOI10.1007/BF01957169zbMath0304.90092OpenAlexW1983140649MaRDI QIDQ4060744

No author found.

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)

Related Items (4)

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

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

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