On sufficiency and duality for generalised quasicnvex nonsmooth programs

DOI10.1080/02331939608844250zbMath0868.90100OpenAlexW1994326662MaRDI QIDQ2785401

Shashi Kant Mishra

Publication date: 20 February 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844250

zbMATH Keywords

generalized convexityoptimality conditionsduality theoremsinequality and equality constraintsnon-smooth \((F,\rho)\)-quasiconvexitynonsmooth multiobjective nonlinear program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25)

Related Items (6)

Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces ⋮ Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity ⋮ Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization ⋮ Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions ⋮ Multiobjective Problems with Nonsmooth Equality Constraints ⋮ Second order symmetric duality in mathematical programming with \(F\)-convexity

Cites Work

• On various duality theorems in nonlinear programming
• Sufficient optimality conditions and duality for a quasiconvex programming problem
• Strong convexity of sets and functions
• On efficiency and duality for multiobjective programs
• On sufficiency and duality for generalized quasiconvex programs
• Strong and Weak Convexity of Sets and Functions
• Optimization and nonsmooth analysis
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• Seven Kinds of Convexity

This page was built for publication: On sufficiency and duality for generalised quasicnvex nonsmooth programs