An infeasible (exterior point) simplex algorithm for assignment problems (Q811357)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An infeasible (exterior point) simplex algorithm for assignment problems |
scientific article; zbMATH DE number 4215677
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible (exterior point) simplex algorithm for assignment problems |
scientific article; zbMATH DE number 4215677 |
Statements
An infeasible (exterior point) simplex algorithm for assignment problems (English)
0 references
1991
0 references
The author presents an exterior point simplex method for assignment problems. This method is based on infeasible paths: any two basic feasible solutions can be connected with short simplex paths passing through an infeasible region.
0 references
exterior point simplex method
0 references
assignment
0 references
infeasible paths
0 references
0 references
