Special Simplex Algorithm for Linked Problems

1 January 1965

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 11 (3) , 420-428
https://doi.org/10.1287/mnsc.11.3.420

Abstract

This paper describes a variant of the Simplex algorithm, applicable to matrices containing blocks of elements along and just below the diagonal. It uses the emptiness of the other blocks to save space and computation.

Keywords

SIMPLEX ALGORITHM
DIAGONAL
EMPTINESS
LINKED PROBLEMS
ALGORITHM FOR LINKED
PROBLEMS THIS PAPER
SPECIAL SIMPLEX
BLOCKS

This publication has 0 references indexed in Scilit: