\ \ An example of an infeasible linear problem. \ minimize obj: + 1 x11 + 2 x12 + 5 x23 + 2 x24 + 1 x31 + 2 x33 + 1 x34 st s0: + x11 + x12 <= 200 s1: + x23 + x24 <= 1000 s2: + x31 + x33 + x34 <= 1000 d0: + x11 + x31 = 1100 d1: + x12 = 200 d2: + x23 + x33 = 500 d3: + x24 + x34 = 500 bounds end