Mathematics of Operations Research, Vol. 38, No. 3 (August 2013), pp. 569-590 (22 pages) Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility ...
A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results