scientific article; zbMATH DE number 7534783
From MaRDI portal
Publication:5080599
zbMath1489.90178MaRDI QIDQ5080599
Thanatchaporn Sirichunwijit, Rabian Wangkeeree
Publication date: 31 May 2022
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3449
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximate solutionapproximate optimality conditionsapproximate duality conditionlocal \(\varepsilon \)-(weakly) Pareto solutionlocal quasi-\( \varepsilon \)-(weakly) Pareto solution
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- A robustification approach in unconstrained quadratic optimization
- Subsmooth semi-infinite and infinite optimization problems
- Selected topics in robust convex optimization
- \(\epsilon\)-solutions in vector minimization problems
- Linear programming with uncertain data: some extensions to robust optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Tractable approximations to robust conic optimization problems
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- Ambiguous Risk Measures and Optimal Robust Portfolios
- Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
- Optimization and nonsmooth analysis
- Exact penalty functions in nonlinear programming
- Variational Analysis
- Stability of Locally Optimal Solutions
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Optimality and duality for robust multiobjective optimization problems
This page was built for publication:
