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 条
  • [41] Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
    E. Alper Yıldırım
    Michael Todd
    Mathematical Programming, 2001, 90 : 229 - 261
  • [42] Interior-point methods: An old and new approach to nonlinear programming
    Yu. Nesterov
    Mathematical Programming, 1997, 79 : 285 - 297
  • [43] An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming
    Hande Y. Benson
    David F. Shanno
    Computational Optimization and Applications, 2007, 38 : 371 - 399
  • [44] An interior point technique for solving bilevel programming problems
    José Herskovits
    Mario Tanaka Filho
    Anatoli Leontiev
    Optimization and Engineering, 2013, 14 : 381 - 394
  • [45] An interior point technique for solving bilevel programming problems
    Herskovits, Jose
    Tanaka Filho, Mario
    Leontiev, Anatoli
    OPTIMIZATION AND ENGINEERING, 2013, 14 (03) : 381 - 394
  • [46] Interior-point methods: An old and new approach to nonlinear programming
    Nesterov, Y
    MATHEMATICAL PROGRAMMING, 1997, 79 (1-3) : 285 - 297
  • [47] A QMR-based interior-point algorithm for solving linear programs
    Freund, RW
    Jarre, F
    MATHEMATICAL PROGRAMMING, 1997, 76 (01) : 183 - 210
  • [48] An -neighborhood infeasible interior-point algorithm for linear complementarity problems
    Pirhaji, M.
    Zangiabadi, M.
    Mansouri, H.
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2017, 15 (02): : 111 - 131
  • [49] An Adaptive Infeasible Interior-Point Algorithm for Linear Complementarity Problems
    Mansouri H.
    Pirhaji M.
    Journal of the Operations Research Society of China, 2013, 1 (04) : 523 - 536
  • [50] Optimal system design with MC2 linear programming:: A dual contingency plan approach
    Shi, Y
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (03) : 692 - 709
12345