Generalization of some duality theorems in nonlinear programming

DOI10.1007/BF01593799zbMath0358.90059MaRDI QIDQ4132272

D. G. Mahajan, M. N. Vartak

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods in optimal control (49M99)

Related Items (23)

On various duality theorems in nonlinear programming ⋮ On second-order generalized convexity ⋮ Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity ⋮ A Note on Strict Converse Duality in Nonlinear Programming ⋮ Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity ⋮ Optimality for \(E\text{-}[0,1\) convex multi-objective programming problems] ⋮ Unnamed Item ⋮ Optimality and duality in nonlinear programming involving semilocally preinvex and related functions ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Sufficient optimality criteria in continuous time programming ⋮ Generalised convexity and duality in multiple objective programming ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ Duality for nonlinear programming problems involving \((b,F)\)-convexity. ⋮ Higher-order duality in vector optimization over cones ⋮ Roughly \(B\)-invex programming problems ⋮ Optimality conditions and duality in multiobjective nonlinear programming involving \(\rho\)-semilocally preinvex and related functions ⋮ Optimality criteria in nonlinear programming involving nonconvex functions ⋮ A Dual For A Multiple Objective Fractional Programming Problem ⋮ Optimality for E-[0,1 convex multi-objective programming] ⋮ On suffucient optimality conditions for mathematical programs with equality constraints ⋮ Sufficient optimality conditions in continuous-time nonlinear programming ⋮ Duality for Fractional Programming with Generalized Convexity Conditions ⋮ Bibliography in fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Seven Kinds of Convexity
• Duality for nonlinear fractional programs
• A sufficient condition for global constrained extrema†
• Duality in nonlinear fractional programming

This page was built for publication: Generalization of some duality theorems in nonlinear programming