Question: Consider a linear program with a single constraint minimize z = c1x1 + c2x2 ++ cnxn subject to a1x1 + a2x2 + ... + anxn
Consider a linear program with a single constraint
minimize z = c1x1 + c2x2 ++ cnxn
subject to a1x1 + a2x2 + ... + anxn <= b
ai>0
x1, x2, ..., xn >= 0
Using duality develop a simple rule to determine an optimal solution, if the latter exists.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
