Experimental Investigation of an Interior Search Method Within a Simplex Framework

@article{Mitra1988ExperimentalIO,
title={Experimental Investigation of an Interior Search Method Within a Simplex Framework},
author={Gautam Mitra and Mehrdad Tamiz and Joseph Yadegar},
journal={Commun. ACM},
year={1988},
volume={31},
pages={1474-1482}
}

A feasible direction method for solving Linear Programming (LP) problems, followed by a procedure for purifying a non-basic solution to an improved extreme point solution have been embedded within an otherwise simplex based optimizer. The algorithm is designed to be hybrid in nature and exploits many aspects of sparse matrix and revised simplex technology. The interior search step terminates at a boundary point which is usually non-basic. This is followed by a series of minor pivotal steps… CONTINUE READING