Question: 1 . Consider the following standard production problem Maximize c x s . t . Ax < = b xi > = 0 Where A
Consider the following standard production problem
Maximize cx
st Ax b
xi
Where A is an m by n matrix m constraints and n variables x is an n by vector, and b
is an m by vector. A is the transpose matrix of A
Its dual problem is
Minimize by
st Ay c
yi
For the given primal problem below, write out the dual problem in the table. points
The solution to the primal problem is generated by LINDO and reported in the table
below.
LP OPTIMUM FOUND AT STEP
OBJECTIVE FUNCTION VALUE
VARIABLE VALUE REDUCED COST
X
X
ROW SLACK OR SURPLUS DUAL PRICES
NO ITERATIONS
PRIMAL DUAL
Maximize xx
Subjected to xresource
xresource
xxresource
x x
Due: Sunday
Answer the following questions:
a Which constraints are binding? Which resources are fully utilized? points
b How much increase of the objective value do you expect if the manufacturer is
given an additional unit of resource How about an additional one unit of
resource Solve the problem with one changed constraint change the right side
limit of constraint from to in an LP solver, and compare the objective
value with what you expect. points
c Solve the dual problem in an LP solver, and compare the optimal objectives in the
primal and dual problems. Does your finding agree with the duality theorem
points
d Does duality theorem hold in this example? points
e Use this example to show: In production problem, a positive opportunity cost
shadow price of a resource is always to be associated with the full utilization of
the resource in the optimal solution. If the total opportunity cost of producing a
unit of product j is greater than the gross profit from that product, then product j
should not be produced according to the optimal production strategy. points
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
