线性规划问题的算法综述

被引：72

作者：

曾梅清

田大钢

机构：

[1] 上海理工大学管理学院

来源：

科学技术与工程 | 2010年 / 10卷 / 01期

关键词：

线性规划问题; 项式时间; 自协调; 算法;

D O I：

暂无

中图分类号：

O221.1 [线性规划];

学科分类号：

070105 [运筹学与控制论];

摘要：

综述了线性规划问题近年来的算法研究最新进展,给出了一些典型算法的求解思想及其时间复杂度,综合分析了各算法的优缺点。并为后续研究提供了一个借鉴方向。

引用

页码：152 / 159

页数：8

共 53 条

[11]

Design centering and polyhedral region approximation via parallel-cuts ellipsoidal technique [J].

Hassan, ASO ;

Abdel-Malek, HL ;

Rabie, AA .

ENGINEERING OPTIMIZATION, 2004, 36 (01) :37-49

[12]

Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation [J].

Mizuno, S ;

Jarre, F .

MATHEMATICAL PROGRAMMING, 1999, 84 (01) :105-122

[13]

The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study [J].

Pan, PQ .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) :164-176

[14]

A simplified homogeneous and self-dual linear programming algorithm and its implementation.[J].Xiaojie Xu;Pi-Fang Hung;Yinyu Ye.Annals of Operations Research.1996, 1

[15]

Potential-reduction methods in mathematical programming [J].

Todd, MJ .

MATHEMATICAL PROGRAMMING, 1997, 76 (01) :3-45

[16]

Primal—dual methods for linear programming.[J].Philip E. Gill;Walter Murray;Dulce B. Ponceleón;Michael A. Saunders.Mathematical Programming.1995, 1

[17]

The ellipsoid algorithm using parallel cuts.[J].Aiping Liao;Michael J. Todd.Computational Optimization and Applications.1994, 4

[18]

A DEEP CUT ELLIPSOID ALGORITHM FOR CONVEX-PROGRAMMING - THEORY AND APPLICATIONS [J].

FRENK, JBG ;

GROMICHO, J ;

ZHANG, S .

MATHEMATICAL PROGRAMMING, 1994, 63 (01) :83-108

[19]

A primal—dual infeasible-interior-point algorithm for linear programming.[J].Masakazu Kojima;Nimrod Megiddo;Shinji Mizuno.Mathematical Programming.1993, 1

[20]

PRACTICAL FINITE PIVOTING RULES FOR THE SIMPLEX-METHOD [J].

PAN, PQ .

OR SPEKTRUM, 1990, 12 (04) :219-225

← 1 2 3 4 5 6 →