An interior-point approach for solving MC2 linear programming problems

Authors:
Yihua Zhong;Yong Shi
Affiliations:
Department of Computer Science Southwest Petroleum Institute 637001 Nanchong, Sichuan, P.R. China;College of Information Science and Technology 6001 Dodge Street, Omaha, NE 68182-0116, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2001

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Linear optimal designs and optimal contingency plans

Management Science
An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points

Computers and Operations Research
Weak duality theorem and complementary slackness theorem for linear matrix programming problems

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper presents an interior-point method to solve the multiple criteria and multiple constraint level linear programming (MC^2LP) problems. This approach utilizes the known interior-point method to multiple criteria linear programming (MCLP) and a convex combination method to generate potential solutions for the MC^2LP problems. This method can be used as an alternative to the well-known MC^2-simplex method. The numerical comparison study of two methods is provided in the paper.