Consider the following linear programming problem:
(a) Transform this formulation into canonical form.
(b) Write out the dual to the problem as reformulated in part (a). Clearly indicate which dual variables are associated with each of the constraints in the primal.
(c) Solve the original problem by inspection. (Hint: Ignore the third constraint initially, find a solution that optimizes the objective function subject to the first two constraints and nonnegativity, and then check that the solution satisfies the third constraint as well.)
(d) What are the values of the dual variables for the original problem shown above? Justify your answer.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here