Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming

DOI10.1016/J.EJOR.2009.11.011MaRDI QIDQ2267661zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

multiobjective programminginteractive proceduresTchebycheff methodreference point methodsreservation levelsaspiration criterion vectors

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Recommendations

• Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
• scientific article; zbMATH DE number 37091
• scientific article; zbMATH DE number 3932804
• A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
• scientific article; zbMATH DE number 4112406

Cites work

• scientific article; zbMATH DE number 3679573 (Why is no real title available?)
• A Bi-Reference Procedure for Interactive Multiple Criteria Programming
• A pareto race
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• An exact method for computing the nadir values in multiple objective linear programming
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Global formulation for interactive multiobjective optimization
• Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
• Linear programming with multiple objective functions: Step method (stem)
• 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
• The ``Light Beam Search approach. -- An overview of methodology and applications
• Unified interactive multiple objective programming

Cited in

(12)

• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
• 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
• Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
• Biobjective robust optimization over the efficient set for Pareto set reduction
• Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization
• On the convergence of reference point methods in multiobjective programming
• scientific article; zbMATH DE number 3845361 (Why is no real title available?)
• A multiobjective interactive approach to determine the optimal electricity mix in Andalucía (Spain)
• A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems
• scientific article; zbMATH DE number 37091 (Why is no real title available?)

This page was built for publication: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267661)