Sufficient optimality conditions and duality for a quasiconvex programming problem

DOI10.1007/BF00938309zbMath0628.90065OpenAlexW50449133MaRDI QIDQ1093539

M. K. Bector, C. R. Bector, Suresh Chandra

Publication date: 1988

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

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

zbMATH Keywords

Mond-Weir type dualityFritz John sufficient optimality conditionsquasi-convex objective function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Related Items (13)

An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions ⋮ On sufficient optimality conditions for a quasiconvex programming problem ⋮ A duality model for a generalized minmax program ⋮ On a theorem due to Crouzeix and Ferland ⋮ Optimality and duality in vector optimization involving generalized type I functions over cones ⋮ On a nonsmooth vector optimization problem with generalized cone invexity ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ On the functions with pseudoconvex sublevel sets and optimality conditions ⋮ Generalized nonsmooth invexity over cones in vector optimization ⋮ Second-order optimality conditions for problems with \(C^{1}\) data ⋮ Vector optimization problems with quasiconvex constraints ⋮ An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions ⋮ On sufficiency and duality for generalised quasicnvex nonsmooth programs

Cites Work

• Unnamed Item
• A modified Fritz John optimality criterion
• On various duality theorems in nonlinear programming
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Invex functions and constrained local minima
• Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints
• A lagrangian approach to duality for complex nonlinear fractional programming over cones
• Seven Kinds of Convexity

This page was built for publication: Sufficient optimality conditions and duality for a quasiconvex programming problem