Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
From MaRDI portal
Publication:2257085
DOI10.1007/s11590-014-0743-9zbMath1315.90045OpenAlexW2016315672MaRDI QIDQ2257085
Publication date: 23 February 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0743-9
multiobjective programmingnon-convex programminginteractive proceduresreference point methodsreservation levelsaspiration criterion vectorsChebychev method
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A visual interactive method for solving the multiple criteria problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- 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
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A two-slope achievement scalarizing function for interactive multiobjective optimization
- The ``Light Beam Search approach. -- An overview of methodology and applications
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- Synchronous approach in interactive multiobjective optimization
- Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
- A Bi-Reference Procedure for Interactive Multiple Criteria Programming
- A naïve approach for solving MCDM problems: the GUESS method
- An interactive weighted Tchebycheff procedure for multiple objective programming
This page was built for publication: Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
