On Efficient Solutions to Multiple Objective Mathematical Programs
From MaRDI portal
Recommendations
- On parametric representations of the efficient set of multiple objective mathematical programming problems
- Approximate quasi efficient solutions in multiobjective optimization
- scientific article; zbMATH DE number 1788231
- scientific article; zbMATH DE number 3991290
- scientific article; zbMATH DE number 411258
Cited in
(40)- Geometrical properties of the Fermat-Weber problem
- Analysis of multicriteria decision aid in Europe
- Sets of efficient points in a normed space
- Multicriteria analysis using a large-scale energy supply LP model
- New closedness results for efficient sets in multiple objective mathematical programming
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Free disposal hull condition to verify when efficiency coincides with weak efficiency
- A graphical characterization of the efficient set for convex multiobjective problems
- A decomposition approach to vector equilibrium problems
- On the hierarchical structure of Pareto critical sets
- Explicitly quasiconvex set-valued optimization
- A characterization of efficient points in constrained location problems with regional demand
- Geometrical characterization of weakly efficient points
- Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
- Scalarization and decomposition of vector variational inequalities governed by bifunctions
- On parametric representations of the efficient set of multiple objective mathematical programming problems
- scientific article; zbMATH DE number 6612741 (Why is no real title available?)
- Biobjective robust optimization over the efficient set for Pareto set reduction
- scientific article; zbMATH DE number 3891128 (Why is no real title available?)
- scientific article; zbMATH DE number 3948014 (Why is no real title available?)
- scientific article; zbMATH DE number 3982935 (Why is no real title available?)
- scientific article; zbMATH DE number 1328997 (Why is no real title available?)
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- scientific article; zbMATH DE number 1149787 (Why is no real title available?)
- scientific article; zbMATH DE number 2067011 (Why is no real title available?)
- Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems
- scientific article; zbMATH DE number 2123491 (Why is no real title available?)
- scientific article; zbMATH DE number 824551 (Why is no real title available?)
- On optimization over the efficient set of a multiple objective linear programming problem
- A special class of extended multicriteria location problems
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- Pareto reducible multicriteria optimization problems
- Determination of satisfying and efficient solutions in convex multi-objective programming
- Further results on quasi efficient solutions in multiobjective optimization
- Approximating the Pareto optimal set using a reduced set of objective functions
- Decomposition of generalized vector variational inequalities
- An interactive multiobjective nonlinear programming procedure
- Determination of efficient solutions for point-objective locational decision problems
- Involving the Helly number in Pareto reducibility
- Arcwise cone-quasiconvex multicriteria optimization
This page was built for publication: On Efficient Solutions to Multiple Objective Mathematical Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216460)
