Pareto reducible multicriteria optimization problems
From MaRDI portal
Recommendations
Cites work
- Contractibility of efficient frontier of simply shaded sets
- Contractibility of the efficient frontier of three-dimensional simply-shaded sets.
- scientific article; zbMATH DE number 824551 (Why is no real title available?)
- On Efficient Solutions to Multiple Objective Mathematical Programs
- The structure of the efficient frontier of finite-dimensional completely-shaded sets
- Topologies on lattice ordered groups, separation from closed downward sets and conjugations of type Lau
Cited in
(38)- Tradeoff-based decomposition and decision-making in multiobjective programming
- Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem
- A necessary and sufficient condition to a Pareto optimal without optimizing the weighting criterion
- On the number of criteria needed to decide Pareto optimality
- Pareto set reduction based on an axiomatic approach with application of some metrics
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Pareto optimization or cascaded weighted sum: a comparison of concepts
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
- Multicriteria minimax problems: localization of the Pareto set and suboptimal control design
- Free disposal hull condition to verify when efficiency coincides with weak efficiency
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- Robust aspects of solutions in deterministic multiple objective linear programming
- A decomposition approach to vector equilibrium problems
- On the hierarchical structure of Pareto critical sets
- Explicitly quasiconvex set-valued optimization
- Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
- Scalarization and decomposition of vector variational inequalities governed by bifunctions
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- Reduction of the choice in the Pareto convolution of criteria for the solution of lexicographical optimization problems determined by
- scientific article; zbMATH DE number 3952486 (Why is no real title available?)
- scientific article; zbMATH DE number 63267 (Why is no real title available?)
- scientific article; zbMATH DE number 1264447 (Why is no real title available?)
- Criteria and dimension reduction of linear multiple criteria optimization problems
- scientific article; zbMATH DE number 537039 (Why is no real title available?)
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- Pareto group structure in a multicriteria optimization problem
- Particular structures of the Pareto set and its reduction in bicriteria discrete problems
- The reduction of the Pareto set of a special structure in bicriteria discrete problems
- Traffic assignment: on the interplay between optimization and equilibrium problems
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
- A special class of extended multicriteria location problems
- Algebra of efficient sets for multiobjective complex systems
- Decomposition of generalized vector variational inequalities
- A Generalization of the Concept of Proper Efficiency in the Decomposed Multi-Objective Optimization Problems
- A new concept of semistrict quasiconvexity for vector functions
- Involving the Helly number in Pareto reducibility
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
- Arcwise cone-quasiconvex multicriteria optimization
This page was built for publication: Pareto reducible multicriteria optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466708)
