For 10 points, name this technique to solveoptimization problems of the namesake form.
Problems that can be solved by this field can be produced from more general problems by the Charnes-Cooper transformation. One popular algorithm in this field can cycle when not choosing the lowest-indexedpivot according to Bland's rule. The degenerate cube suggested by Klee and Minty showed the exponentialrunning time of some algorithms in this field like the criss-cross algorithm. One algorithm in this fieldcreates a (*) polytope representing a feasible region before traversing the edges of that polytope. Problems can beconverted using non-negative slack variables in order to use Dantzig's simplex method in this field. Methods inthis field maximize an objective function according to some constraints. For 10 points, name this technique to solveoptimization problems of the namesake form.
Problems that can be solved by this field can be produced from more general problems by the Charnes-Cooper transformation.
linear programming [prompt on partial answers]