Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
From MaRDI portal
Publication:2267661
DOI10.1016/j.ejor.2009.11.011zbMath1181.90238OpenAlexW2120733835MaRDI QIDQ2267661
Publication date: 1 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.11.011
multiobjective programminginteractive proceduresTchebycheff methodreference point methodsreservation levelsaspiration criterion vectors
Related Items (8)
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ A multiobjective interactive approach to determine the optimal electricity mix in Andalucía (Spain) ⋮ Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming ⋮ Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization ⋮ The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
Cites Work
- Unnamed Item
- Global formulation for interactive multiobjective optimization
- An exact method for computing the nadir values in multiple objective linear programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Nonlinear multiobjective optimization
- Unified interactive multiple objective programming
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
- The ``Light Beam Search approach. -- An overview of methodology and applications
- A pareto race
- A Bi-Reference Procedure for Interactive Multiple Criteria Programming
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Linear programming with multiple objective functions: Step method (stem)
This page was built for publication: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
