Generalization of some duality theorems in nonlinear programming
From MaRDI portal
Publication:4132272
DOI10.1007/BF01593799zbMATH Open0358.90059MaRDI QIDQ4132272FDOQ4132272
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods in optimal control (49M99)
Cites Work
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Duality for nonlinear fractional programs
- Title not available (Why is that?)
- Duality in nonlinear fractional programming
- Seven Kinds of Convexity
- The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
- Title not available (Why is that?)
- A sufficient condition for global constrained extrema†
Cited In (23)
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- Higher-order duality in vector optimization over cones
- Title not available (Why is that?)
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- On various duality theorems in nonlinear programming
- Roughly \(B\)-invex programming problems
- Optimality criteria in nonlinear programming involving nonconvex functions
- On second-order generalized convexity
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- A Note on Strict Converse Duality in Nonlinear Programming
- Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity
- Duality for Fractional Programming with Generalized Convexity Conditions
- Bibliography in fractional programming
- Duality for nonlinear programming problems involving \((b,F)\)-convexity.
- Optimality conditions and duality in multiobjective nonlinear programming involving \(\rho\)-semilocally preinvex and related functions
- Sufficient optimality criteria in continuous time programming
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- Sufficient optimality conditions in continuous-time nonlinear programming
- Optimality for E-[0,1] convex multi-objective programming
- Generalised convexity and duality in multiple objective programming
- A Dual For A Multiple Objective Fractional Programming Problem
- On suffucient optimality conditions for mathematical programs with equality constraints
- Optimality and duality in nonlinear programming involving semilocally preinvex and related functions
This page was built for publication: Generalization of some duality theorems in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132272)