Farkas-type results for vector-valued functions with applications

DOI10.1007/S10957-016-1055-2zbMath1396.90077OpenAlexW2579396829MaRDI QIDQ2363561

Yanyan Li

Publication date: 20 July 2017

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

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/159226

zbMATH Keywords

vector optimizationweak solutionsvector variational inequalitiesvector equilibrium problemsFarkas-type theorems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (13)

Complete characterizations of robust strong duality for robust vector optimization problems ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ A new approach to strong duality for composite vector optimization problems ⋮ A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Farkas' lemma: three decades of generalizations for mathematical optimization
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
• Duality and optimality conditions for generalized equilibrium problems involving DC functions
• Functional inequalities and theorems of the alternative involving composite functions
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• Conjugate duality in convex optimization
• Conjugate duality in vector optimization
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Qualification conditions and Farkas-type results for systems involving composite functions
• Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• Duality in Vector Optimization
• From the Farkas Lemma to the Hahn--Banach Theorem
• On Extension of Fenchel Duality and its Application
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Set-valued Optimization
• Duality for generalized equilibrium problem

This page was built for publication: Farkas-type results for vector-valued functions with applications