Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
From MaRDI portal
(Redirected from Publication:406645)
Recommendations
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
- Relations among efficient solutions in uncertain multiobjective programming
- scientific article; zbMATH DE number 1530339
- Efficient solution concepts and their relations in stochastic multiobjective programming
- An approximation method for the efficiency set of multiobjective programming problems
- Efficiency for a class of multiobjective optimization problems
- Optimality and duality of properly robust efficient solutions in uncertain multi-objective optimization problems
- scientific article; zbMATH DE number 5018510
- Optimality conditions for set-valued optimization problems based on set approach and applications in uncertain optimization
- Approximate efficiency in set-valued optimization with variable order
Cites work
- scientific article; zbMATH DE number 3925652 (Why is no real title available?)
- scientific article; zbMATH DE number 1379525 (Why is no real title available?)
- A new concept of robustness
- A variational approach to define robustness for parametric multiobjective optimization problems
- An application of deterministic and robust optimization in the wood cutting industry
- An empirical analysis of robustness concepts for timetabling
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Computation of robust Pareto points
- Control of robust design in multiobjective optimization under uncertainties
- Introduction to Stochastic Programming
- Label correcting methods to solve multicriteria shortest path problems
- Light robustness
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- New order relations in set optimization
- On a multicriteria shortest path problem
- On robust multiobjective optimization
- Recoverable robust timetable information
- Robust convex optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust multiple objective game theory
- Robust optimization
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Some duality theorems of set-valued optimization with natural criteria
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The price of robustness in timetable information
- The relationship between multi-objective robustness concepts and set-valued optimization
- Vector optimization problems and their solution concepts
Cited in
(45)- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Robustness in deterministic vector optimization
- Pareto solutions in multicriteria optimization under uncertainty
- Characterization of norm-based robust solutions in vector optimization
- A bicriteria approach to robust optimization
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- Existence of \(\alpha\)-robust weak Nash equilibria for leader-follower population games with fuzzy parameters
- Entropy based robust portfolio
- Image space analysis for set optimization problems with applications
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Characterizations of multiobjective robustness on vectorization counterparts
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- A unified characterization of multiobjective robustness via separation
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
- On non-cooperative \(n\)-person games with set payoffs
- Optimality conditions for set-valued optimisation problems using a modified Demyanov difference
- Generalized multiobjective robustness and relations to set-valued optimization
- Relations among efficient solutions in uncertain multiobjective programming
- A scalarization scheme for binary relations with applications to set-valued and robust optimization
- Decision space robustness for multi-objective integer linear programming
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Scalarization of multiobjective robust optimization problems
- A unified approach to uncertain optimization
- Characterizations of robust optimality conditions via image space analysis
- Best-case scenario robust portfolio: evidence from China stock market
- Treatment of set-valued robustness via separation and scalarization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Hard uncertainties in multiobjective layout optimization of photovoltaic power plants
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Convergence of solutions of a set optimization problem in the image space
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
- The relationship between multi-objective robustness concepts and set-valued optimization
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- Robust multiobjective portfolio optimization: a set order relations approach
- Conjugate duality in set optimization via nonlinear scalarization
- Characterizations of multi-objective robustness solutions defined by Minkowski set difference
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- The weighted set relation: characterizations in the convex case
This page was built for publication: Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406645)
