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
6 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Minimisation of a Linear Function of Variables Subject to Linear Inequalities, in Activity Analysis of Production nnd Allocation, Koopmans

  • G. B. Dantzig
  • 1951
Highly Influential
4 Excerpts

An augmented Lagrangian method for linear programming

  • E.M.L. Beale, Hatter, B y., L. James
  • Represented at the 12th International Symposium…
  • 1985
Highly Influential
3 Excerpts

A Polynomial Algorithm in Linear Programming

  • Khachian, LG
  • Doklady Akademii Nauk, USSR, Nova Seria,
  • 1979
Highly Influential
3 Excerpts

Non-extreme point solution strategies for linear programs

  • L. Cooper, Kennington
  • Naval Research Logistics Quarterly 26
  • 1979
Highly Influential
3 Excerpts

Methods of Feasible Directions

  • G. Zoutendijk
  • 1960
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…