Optimality conditions for vector mathematical programming via a theorem of the alternative
From MaRDI portal
Publication:1289048
DOI10.1006/jmaa.1999.6288zbMath0946.90074OpenAlexW2041075185MaRDI QIDQ1289048
Publication date: 3 October 2000
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1999.6288
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Fractional programming (90C32)
Related Items (6)
Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ Higher-order optimality conditions for set-valued optimization ⋮ An optimal alternative theorem and applications to mathematical programming ⋮ A sixth bibliography of fractional programming ⋮ Optimality conditions for vector optimization problems of a difference of convex mappings
Cites Work
- Unnamed Item
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Theory of multiobjective optimization
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Maximal vectors and multi-objective optimization
- Pareto optimality in multiobjective problems
- Existence and continuity of solutions for vector optimization
- Contingent derivatives of set-valued maps and applications to vector optimization
- Invex optimisation problems
- Fractional programming without differentiability
- Scalarization and lagrange duality in multiobjective optimization
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
- Set-valued derivatives of multifunctions and optimality conditions
- Necessary and sufficient condiitions for multiobjective optimization problems
- Optimality conditions for maximizations of set-valued functions
This page was built for publication: Optimality conditions for vector mathematical programming via a theorem of the alternative
