A Monotonic Build-Up Simplex Algorithm for Linear Programming

doi:10.1287/opre.42.3.556

A Monotonic Build-Up Simplex Algorithm for Linear Programming

1994-06-01

0

PRE

AI

DOI：10.1287/opre.42.3.556

原文链接

原文求助

摘要

En 中文

We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost the pivot rule produces a sequence of pivots such that ultimately the originally chosen nonbasic variable enters the basis, and all reduced costs which were originally nonnegative remain nonnegative. The pivot rule thus monotonically builds up to a dual feasible, and hence optimal, basis. A surprising property is that the pivot sequence results in intermediate bases which are neither primal nor dual feasible. We prove the correctness of the procedure, and relate it to other pivoting rules for linear programming.

A Monotonic Build-Up Simplex Algorithm for Linear Programming

摘要

AI总结

期刊

机构

引用论文