A modified weighted Tchebycheff metric for multiple objective programming
From MaRDI portal
We show how to determine nondominated criterion vectors (and then nondominated solutions, if necessary) by a modified weighted Tchebycheff metric in cases when sets of criterion vectors are finite or polyhedral.
Recommendations
Cites work
- A Class of Solutions for Group Decision Problems
- An interactive weighted Tchebycheff procedure for multiple objective programming
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 3993319 (Why is no real title available?)
- Proper efficiency and the theory of vector maximization
- Proper Efficiency in Nonconvex Multicriteria Programming
- Scalarization in vector optimization
Cited in
(21)- An interactive procedure for multiple objective integer linear programming problems
- Efficient solutions and bounds on tradeoffs
- Norm-based approximation in multicriteria programming.
- Introducing oblique norms into multiple criteria programming
- Combined forecasts in portfolio optimization: a generalized approach
- Tchebycheff norms in multi-objective linear programming
- Searching for psychologically stable solutions of multiple criteria decision problems
- Comparison of some scalarization methods in multiobjective optimization
- Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
- Algorithm robust for the bicriteria discrete optimization problem
- A conic scalarization method in multi-objective optimization
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
- Quadratic scalarization for decomposed multiobjective optimization
- Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- scientific article; zbMATH DE number 7644921 (Why is no real title available?)
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- Convex cones, assessment functions, balanced attributes
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Stability achievement scalarization function for multiobjective nonlinear programming problems
This page was built for publication: A modified weighted Tchebycheff metric for multiple objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096546)
