Studies of lexicography in the generalized network simplex method José C. ArantesJ. R. BirgeK. G. Murty Part II: Specific Papers Pages: 235 - 248
Bounds on the number of vertices of perturbed polyhedra Paul Armand Part II: Specific Papers Pages: 249 - 269
An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models A. CharnesJ. RousseauJ. Semple Part II: Specific Papers Pages: 271 - 278
On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program Jerald P. Dauer Part II: Specific Papers Pages: 279 - 292
Error bounds and strong upper semicontinuity for monotone affine variational inequalities M. C. FerrisO. L. Mangasarian Part II: Specific Papers Pages: 293 - 305
On degeneracy in linear programming and related problems Karen GeorgeM. R. Osborne Part II: Specific Papers Pages: 343 - 359
An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex Ferdinand Geue Part II: Specific Papers Pages: 361 - 391
On some properties of o-degeneracy graphs Hermann-Josef Kruse Part II: Specific Papers Pages: 393 - 408
A strictly improving linear programming Phase I algorithm S. A. LeichnerG. B. DantzigJ. W. Davis Part II: Specific Papers Pages: 409 - 430
A practical anti-degeneracy row selection technique in network linear programming István Maros Part II: Specific Papers Pages: 431 - 442
A simplified global convergence proof of the affine scaling algorithm R. D. C. MonteiroT. TsuchiyaY. Wang Part II: Specific Papers Pages: 443 - 482
An exterior point simplex algorithm for (general) linear programming problems Konstantinos Paparrizos Part II: Specific Papers Pages: 497 - 508
Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems Takashi Tsuchiya Part II: Specific Papers Pages: 509 - 539
