𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An interior-point approach for solving MC2 linear programming problems

✍ Scribed by Yihua Zhong; Yong Shi


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
576 KB
Volume
34
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis


This paper presents an interior-point method to solve the multiple criteria and multiple constraint level linear programming (MC2LP) problems. This approach utilizes the known interiorpoint method to multiple criteria linear programming (MCLP) and a convex combination method to generate potential solutions for the MC2Lp problems. This method can be used as an alternative to the well-known MC2-simplex method. The numerical comparison study of two methods is provided in the paper. (~) 2001 Elsevier Science Ltd. All rights reserved.


πŸ“œ SIMILAR VOLUMES


Parallel computational issues of an inte
✍ M. D’Apuzzo; M. Marino πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 181 KB

This paper deals with a parallel implementation of an interior point algorithm for solving sparse convex quadratic programs with bound constraints. The parallelism is introduced at the linear algebra level. Concerning the solution of the linear system arising at each step of the considered algorithm

Two-phase approach for solving the fuzzy
✍ Sy-Ming Guua; Yan-Kuen Wu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 334 KB

We propose a two-phase approach to solve the fuzzy linear programming problem. Although several methods in the literature have been proposed to treat this problem, the two-phase approach has the merit stated as: if the decision maker is seeking an efficient solution which can improve the max-min ope