Relationships between constrained and unconstrained multi-objective optimization and application in location theory
From MaRDI portal
Recommendations
- On generalized-convex constrained multi-objective optimization
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- scientific article; zbMATH DE number 2143163
- Constrained qualifications in multiobjective optimization problems: Differentiable case
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- A characterization of efficient points in constrained location problems with regional demand
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- A new penalization tool in scalar and vector optimizations
- A special class of extended multicriteria location problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Constrained optimization using multiple objective programming
- Determination of efficient points in multiple-objective location problems
- Dualität und algorithmische anwendung beim vektoriellen standortproblem
- Efficiency in Euclidean constrained location problems
- Efficiency in constrained continuous location
- Finding efficient solutions for rectilinear distance location problems efficiently
- Generalized convexity and optimization. Theory and applications
- Geometrical description of the weakly efficient solution set for multicriteria location problems
- Multicriteria Optimization
- Multicriteria planar ordered median problems
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Pareto reducible multicriteria optimization problems
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Sets of efficient points in a normed space
- Some Properties of Location Problems with Block and Round Norms
- The effects of adding objectives to an optimisation problem on the solution set
- Vector Optimization
Cited in
(5)- Nonconvex constrained optimization by a filtering branch and bound
- Stability of minimality and criticality in directional set-valued optimization problems
- On some methods to derive necessary and sufficient optimality conditions in vector optimization
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
This page was built for publication: Relationships between constrained and unconstrained multi-objective optimization and application in location theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343815)
