In problems with an angular structure, the initial basis is represented in reduced form via partitioning. If partitioning is also used in the updating of the basis, subsequent iterations do not differ from ordinary simplex iterations.
Voir la suite
INFORMATION
-
1976/07/31
-
Document de travail (série numérotée)
-
DRC3
-
1
-
1
-
2020/06/13
-
Disclosed
-
Partitioning, generalized upper bounding, and angular structures in linear programming
-
reduced work