Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
type: Item
instance of: scholarly article
title: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
zbMATH Open document ID: 1181.90238
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2010-03-01T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5676290
zbMATH Keywords: multiobjective programming
zbMATH Keywords: interactive procedures
zbMATH Keywords: Tchebycheff method
zbMATH Keywords: reference point methods
zbMATH Keywords: aspiration criterion vectors
zbMATH Keywords: reservation levels
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.11.011
OpenAlex ID: W2120733835
cites work: An exact method for computing the nadir values in multiple objective linear programming
cites work: Linear programming with multiple objective functions: Step method (stem)
cites work: Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods.
cites work: Unified interactive multiple objective programming
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: The ``Light Beam Search'' approach. -- An overview of methodology and applications
cites work: A pareto race
cites work: Global formulation for interactive multiobjective optimization
cites work: A Bi-Reference Procedure for Interactive Multiple Criteria Programming
cites work: Nonlinear multiobjective optimization
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: Q3875728
cites work: An Interactive Programming Method for Solving the Multiple Criteria Problem
DOI: 10.1016/J.EJOR.2009.11.011
description: scientific article