A modified weighted Tchebycheff metric for multiple objective programming
From MaRDI portal
Publication:1096546
DOI10.1016/0305-0548(87)90069-4zbMath0633.90079OpenAlexW2076767658MaRDI QIDQ1096546
Publication date: 1987
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(87)90069-4
Related Items (17)
Algorithm robust for the bicriteria discrete optimization problem ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ A conic scalarization method in multi-objective optimization ⋮ Efficient solutions and bounds on tradeoffs ⋮ Unnamed Item ⋮ Norm-based approximation in multicriteria programming. ⋮ Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization ⋮ Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems ⋮ Stability achievement scalarization function for multiobjective nonlinear programming problems ⋮ Combined forecasts in portfolio optimization: a generalized approach ⋮ Comparison of some scalarization methods in multiobjective optimization ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Searching for psychologically stable solutions of multiple criteria decision problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
Cites Work
This page was built for publication: A modified weighted Tchebycheff metric for multiple objective programming