An interior-point approach for solving MC2 linear programming problems

Authors
Zhong, YH Shi, Y
Citation
Yh. Zhong et Y. Shi, An interior-point approach for solving MC2 linear programming problems, MATH COMP M, 34(3-4), 2001, pp. 411-422
Citations number
18
Categorie Soggetti
Engineering Mathematics
Journal title
MATHEMATICAL AND COMPUTER MODELLING
ISSN journal
08957177 → ACNP
Volume
34
Issue
3-4
Year of publication
2001
Pages
411 - 422
Database
ISI
SICI code
0895-7177(200108)34:3-4<411:AIAFSM>2.0.ZU;2-X
Abstract
This paper presents an interior-point method to solve the multiple criteria and multiple constraint level linear programming ((MCLP)-L-2) problems. Th is approach utilizes the known interior-point method to multiple criteria l inear programming (MCLP) and a convex combination method to generate potent ial solutions for the (MCLP)-L-2 problems. This method can be used as an al ternative to the well-known MC2-simplex method. The numerical comparison st udy of two methods is provided in the paper. (C) 2001 Elsevier Science Ltd. All rights reserved.