An interior-point approach for solving MC2 linear programming problems

被引：2

作者：

Zhong, YH

Shi, Y

机构：

[1] Coll Informat Sci & Technol, Omaha, NE 68182 USA

[2] SW Petr Inst, Dept Comp Sci, Nanchong 637001, Sichuan, Peoples R China

来源：

MATHEMATICAL AND COMPUTER MODELLING | 2001年 / 34卷 / 3-4期

关键词：

interior-point method; MC2 linear programming; efficient solution; potential solution;

D O I：

10.1016/S0895-7177(01)00072-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents an interior-point method to solve the multiple criteria and multiple constraint level linear programming ((MCLP)-L-2) 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 (MCLP)-L-2 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. (C) 2001 Elsevier Science Ltd. All rights reserved.

引用

页码：411 / 422

页数：12

共 50 条

[31] Solving quadratic multicommodity problems through an interior-point algorithm
Castro, J
SYSTEM MODELING AND OPTIMIZATION XX, 2003, 130 : 199 - 212
[32] A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming
Engau, Alexander
Anjos, Miguel F.
Vannelli, Anthony
OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 195 - +
[33] An interior-point piecewise linear penalty method for nonlinear programming
Chen, Lifeng
Goldfarb, Donald
MATHEMATICAL PROGRAMMING, 2011, 128 (1-2) : 73 - 122
[34] Interior-point algorithms for a generalization of linear programming and weighted centring
Anstreicher, Kurt M.
OPTIMIZATION METHODS & SOFTWARE, 2012, 27 (4-5): : 605 - 612
[35] An interior-point piecewise linear penalty method for nonlinear programming
Lifeng Chen
Donald Goldfarb
Mathematical Programming, 2011, 128 : 73 - 122
[36] Optimized choice of parameters in interior-point methods for linear programming
Luiz-Rafael Santos
Fernando Villas-Bôas
Aurelio R. L. Oliveira
Clovis Perin
Computational Optimization and Applications, 2019, 73 : 535 - 574
[37] Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm
Jordi Castro
Annals of Operations Research, 2003, 124 : 35 - 48
[38] Modified Cholesky factorizations in interior-point algorithms for linear programming
Wright, SJ
SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) : 1159 - 1191
[39] An interior-point method for semi-infinite programming problems
Schattler, U
ANNALS OF OPERATIONS RESEARCH, 1996, 62 : 277 - 301
[40] Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Yildirim, EA
Todd, MJ
MATHEMATICAL PROGRAMMING, 2001, 90 (02) : 229 - 261

← 1 2 3 4 5 →