ON THE GRAPH TEST TO CHECK THE ADJACENCY OF POLYHEDRAL CONE EXTREME RAYS IN THE DOUBLE DESCRIPTION METHOD |
| 6 | |
| 2013 |
| scientific article | 519.6 | ||
| 223-226 | polyhedral cone, double description method, Motzkin, –Burger algorithm, graph test |
| The article clarifies the complexity upper bound of the earlier proposed graph test to check the adjacency of polyhedral cone extreme rays in the double description method. |
 |