An optimal alternative theorem and applications to mathematical programming
From MaRDI portal
Publication:995938
DOI10.1007/s10898-006-9046-8zbMath1138.90025OpenAlexW2089071901MaRDI QIDQ995938
Cristián Vera, Nicolas Hadjisavvas, Fabián Flores-Bazan
Publication date: 10 September 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9046-8
Related Items
A study of interval optimization problems, Unnamed Item, Optimality conditions for a unified vector optimization problem with not necessarily preordering relations, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, Fritz John necessary optimality conditions of the alternative-type, Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications, A complete characterization of strong duality in nonconvex optimization with a single constraint, Unnamed Item, Generalized higher-order cone-convex functions and higher-order duality in vector optimization, Image space approach and subdifferentials of integral functionals, Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization, A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints, Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces, Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization, Are dualities appropriate for duality theories in optimization?, Vector optimization with generalized cone locally connected functions, Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives, Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization, A unified vector optimization problem: complete scalarizations and applications, On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly subconvexlike set-valued maps and vector optimization problems
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- A gap between multiobjective optimization and scalar optimization
- Optimality conditions for vector mathematical programming via a theorem of the alternative
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Ideal, weakly efficient solutions for vector optimization problems
- Notions of relative interior in Banach spaces
- Near-subconvexlikeness in vector optimization with set-valued functions
- Theorems of the alternative and optimization with set-valued maps
- Gap-free computation of Pareto-points by quadratic scalarizations
- Variational Analysis
- Coercivity properties and well-posedness in vector optimization
- A General Gordan Alternative Theorem with Weakened Convexity and Its Application
- On a gap between multiobjective optimization and scalar optimization
- About a gap between multiobjective optimization and scalar optimization
