• DOI:10.1007/BF02614325
Corpus ID: 2794181

Criss-cross methods: A fresh view on pivot algorithms

@article{Fukuda1997CrisscrossMA,
  title={Criss-cross methods: A fresh view on pivot algorithms},
  author={K. Fukuda and T. Terlaky},
  journal={Mathematical Programming},
  year={1997},
  volume={79},
  pages={369-395}
}

• K. Fukuda, T. Terlaky
• Published 1997
• Mathematics, Computer Science
• Mathematical Programming

Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. Unlike the simplex method that follows a monotonic edge path on the feasible region, the trace of a criss-cross method is neither monotonic (with respect to the objective function) nor feasibility preserving. The main purpose of this paper is to present mathematical ideas and… Expand

View on Springer

infoscience.epfl.ch

Save to Library

Create Alert

Cite

Launch Research Feed