Solving two-stage quadratic multiobjective problems via optimality and relaxations
DOI10.1007/S10957-024-02528-WMaRDI QIDQ6636806
Thai Doan Chuong, Xinghuo Yu, Andrew Eberhard, Chaojie Li, Chen Liu
Publication date: 12 November 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
semidefinite programmingmultiobjective optimizationoptimality conditionrelaxation problemPareto/efficient solutiontwo-stage program
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99)
Cites Work
- Title not available (Why is that?)
- Minmax robustness for multi-objective optimization problems
- On general minimax theorems
- A class of stochastic programs with decision dependent random elements
- Adjustable robust solutions of uncertain linear programs
- A survey of adjustable robust optimization
- Robust optimization of uncertain multistage inventory systems with inexact data in decision rules
- Some geometric results in semidefinite programming
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Two-stage robust optimization problems with two-stage uncertainty
- Robust optimization for premarshalling with uncertain priority classes
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
- On the approximability of adjustable robust convex optimization under uncertainty
- On robust multiobjective optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Graph Implementations for Nonsmooth Convex Programs
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Theory and Applications of Robust Optimization
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
- Semidefinite Optimization and Convex Algebraic Geometry
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Convex Analysis
This page was built for publication: Solving two-stage quadratic multiobjective problems via optimality and relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636806)