175 Years of linear programming: 2. Pivots in column space

Chandru, Vijay ; Rao, M. R. (1999) 175 Years of linear programming: 2. Pivots in column space Resonance - Journal of Science Education, 4 (1). pp. 8-22. ISSN 0971-8044

PDF - Publisher Version

Official URL: http://www.ias.ac.in/resonance/Jan1999/pdf/Jan1999...

Related URL: http://dx.doi.org/10.1007/BF02837148


The simplex method has been the veritable workhorse of linear programming for five decades now. An elegant geometric interpretation of the simplex method can be visualised by viewing the animation of the algorithm in acolumn space representation. In fact, it is this interpretation that explains why it is called the simplex method. The extreme points of the feasible region (polyhedron) of the linear programme can be shown to correspond to an arrangement of simplices in this geometry and the pivoting operation to a physical pivot from one simplex to an adjacent one in the arrangement. This paper introduces this vivid description of the simplex method as a tutored dance of simplices performing 'pivots in column space'.

Item Type:Article
Source:Copyright of this article belongs to Indian Academy of Sciences.
ID Code:5516
Deposited On:19 Oct 2010 12:03
Last Modified:16 May 2016 16:00

Repository Staff Only: item control page