Theorems of the alternative and optimality conditions for convexlike and general convexlike programming

DOI10.1023/A:1021781308794zbMath0946.90086OpenAlexW152156553MaRDI QIDQ1291813

Gábor Kassay, Tibor Illés

Publication date: 10 June 1999

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

Full work available at URL: https://doi.org/10.1023/a:1021781308794

zbMATH Keywords

duality theoryconstrained optimization problemsconvexlike functionsalternative theorems of Farkas type

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Markov and semi-Markov decision processes (90C40)

Related Items (18)

Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones ⋮ On equivalent results in minimax theory ⋮ A sharp Lagrange multiplier theorem for nonlinear programs ⋮ Optimality conditions for vector optimisation with set-valued maps ⋮ Nonlinear programming via König's maximum theorem ⋮ Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems ⋮ Sufficient Conditions for Nonsmoothr-Invexity ⋮ On first order optimality conditions for vector optimization ⋮ Image space approach and subdifferentials of integral functionals ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ On the Fritz John saddle point problem for differentiable multiobjective optimization ⋮ Revisiting the Hahn-Banach theorem and nonlinear infinite programming ⋮ Generalized constraint qualifications and optimality conditions for set-valued optimization problems ⋮ On alternative theorems and necessary conditions for efficiency ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequality systems and optimization
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Abstract Kuhn-Tucker theorems
• On the image of a constrained extremum problem and some applications to the existence of a minimum
• Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
• Perfect duality for convexlike programs
• Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
• Theorems of the alternative and optimality conditions
• Über das von-Neumannsche Minimax-Theorem
• Solvability results for sublinear functions and operators
• Nonconvex theorems of the alternative and minimization
• Convex Analysis

This page was built for publication: Theorems of the alternative and optimality conditions for convexlike and general convexlike programming