scientific article; zbMATH DE number 17932
[For the entire collection see Zbl 0727.00014.] Fritz John sufficient optimality criteria have been established for differentiable functions under generalized \(F\)-convexity assumptions. The objective function is assumed to be \(F\)-quasiconvex and the constraint functions are assumed to be \(F\)-quasiconcave/strictly \(F\)-pseudoconcave in various forms. Under these generalized assumptions various duality theorems are proved relating the nonlinear programming problem and its dual. Similar results can also be established under the assumption of \(F\)-quasi-invexity on the objective function and \(F\)-quasi- invexity/strictly \(F\)-pseudo-invexity on the constraints.
- Sufficient optimality conditions and duality for a quasiconvex programming problem
- On sufficiency and duality for generalized quasiconvex programs
- Fritz-John optimality and duality for non-convex programs
- Duality with generalized convexity
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975285)