ϵ-Efficient solutions in semi-infinite multiobjective optimization
From MaRDI portal
Publication:4634336
DOI10.1051/ro/2018028zbMath1411.90327OpenAlexW2802288332MaRDI QIDQ4634336
Tatiana Shitkovskaya, Do Sang Kim
Publication date: 7 May 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018028
semi-infinite optimization\(\epsilon\)-optimality conditions\(\epsilon\)-efficiency\(\epsilon\)-duality
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items
Some characterizations of approximate solutions for robust semi-infinite optimization problems, Approximate solution in robust multi-objective optimization and its application in portfolio optimization, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data, Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints, On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness in nonsmooth nonlinear multi-objective programming
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On convex optimization without convex representation
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Constraint qualifications in nonsmooth multiobjective optimization
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Optimality conditions in convex optimization revisited
- Nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Robust aspects of solutions in deterministic multiple objective linear programming
- Optimality conditions in convex multiobjective SIP
- Optimality conditions in optimization problems with convex feasible set using convexificators
- On robust multiobjective optimization
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Proper efficiency and the theory of vector maximization
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimization and nonsmooth analysis
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Regularity Conditions and Optimality in Vector Optimization
- An introduction to the theory of nonsmooth optimization
- On constraint qualifications in directionally differentiable multiobjective optimization problems
- Multicriteria Optimization
- Convex Analysis
- Dini derivatives in optimization — Part I
- Sufficient conditions for extremum, penalty functions and regularity
- Set-valued analysis
