Question
This algorithm visits all eight corners of the Klee-Minty cube if initialized to one of the corners. For 10 points each:
[10m] Name this algorithm developed by George Dantzig, which introduces slack variables to constraints before increasing variables at each iteration. A canonical tableau is often used to implement this two-phase algorithm.
ANSWER: simplex method [or simplex algorithm]
[10h] This Cornell operations research professor’s rule for the simplex algorithm avoids visiting every corner of the cube. This mathematician’s rule chooses the smallest-indexed variable with a positive coefficient in the objective.
ANSWER: Robert G. Bland [accept Bland’s rule]
[10e] Bland’s research at Cornell concerns the combinatorial structure of duality theory underlying this technique. The simplex method is a specific example of this larger technique that optimizes objective polynomials of degree 1.
ANSWER: linear programming [or LP; prompt on linear optimization]
<Science - Other Science - Math>
Summary
| 2024 ARGOS @ Chicago | 11/23/2024 | Y | 1 | 20.00 | 100% | 100% | 0% |
Data
| BHSU ReFantazio | BHSU Rebirth | 10 | 0 | 10 | 20 |