PRIMAL PERTURBATION SIMPLEX ALGORITHMS FOR LINEAR PROGRAMMING

• 来源期刊: 计算数学（英文版）
• 关键词: Linear programming Perturbation Primal simplex algorithm Par tially revised tableau.
• 年，卷（期）: 2000,（6）
• 页码范围: 587-596
• 页数: 10页
• 语种: 英文

摘要

In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more etficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported.