On sufficient optimality conditions for a quasiconvex programming problem

DOI10.1007/BF02191671zbMath0813.90104MaRDI QIDQ1331097

V. Pereyra

Publication date: 9 August 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

duality theoremssufficient optimality conditionsquasiconvex objective function

Mathematics Subject Classification ID

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

Related Items (5)

On a theorem due to Crouzeix and Ferland ⋮ On the functions with pseudoconvex sublevel sets and optimality conditions ⋮ Second-order optimality conditions for problems with \(C^{1}\) data ⋮ Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization ⋮ Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients

Cites Work

• A modified Fritz John optimality criterion
• Sufficient optimality conditions and duality for a quasiconvex programming problem
• A note on quasiconvex functions that are pseudoconvex
• Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons

This page was built for publication: On sufficient optimality conditions for a quasiconvex programming problem