An infeasible (exterior point) simplex algorithm for assignment problems |
| |
| Authors: | Konstantinos Paparrizos |
| |
| Affiliation: | (1) Department of Mathematics, School of Engineering, Democritus University of Thrace, GR-67100 Xanthi, Greece |
| |
| Abstract: | The so called Modified Hung—Rom Algorithm, based upon theoretical considerations of Hirsch-paths, seems to be one of the most efficient algorithms for assignment problems. Since any two basic feasible solutions to a linear problem can always be connected with a short simplex path passing through the infeasible region, development of algorithms based upon theoretical considerations on infeasible paths seems to be of great practical interest. This paper presents an algorithm of this kind for assignment problems. |
| |
| Keywords: | Infeasible simplex method dual and primal simplex method assignment problem signatures pivoting |
| 本文献已被 SpringerLink 等数据库收录！ |
|
