Variable Cells

Final Reduced Objective Allowable Allowable

Cell Name Value Cost Coefficient Increase Decrease
$D$6 x1 0 2 3 1E+30 2
$D$7 x2 1 0 1 2 1

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$C$10 x2 3 0 2 1 1E+30
$C$9 x2 1 1 1 1E+30 0.333333333
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$D$5 x1 4 0 3 1E+30 2
$D$6 x2 3 0 2 4 1E+30

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$C$10 x2 10 3 10 0 4
$C$11 x2 3 -4 3 2 0
$C$8 x2 7 0 1 6 1E+30
$C$9 x2 7 0 7 1E+30 0
 Managerial implication
The dual solution provides important economical interpretation such as shadow
prices, i.e., the marginal values of the RHS elements. The shadow price was
defined, historically as the improvement in the objective function value per unit
increase in the right-hand side, because the problem was often put in the form of
profit maximization improvement (meaning increase). The shadow price may not
be the market price. The shadow price is e.g., the worth of the resource under the
"shadow" of your business activity. Sensitivity analysis, i.e., the analysis of the
effect of small variations in system parameters on the output measures can be
studied by computing the derivatives of the output measures with respect to the
parameter.

Understanding the dual problem leads to specialized algorithms for some

important classes of linear programming problems. Examples include the
transportation simplex method, the Hungarian algorithm for the assignment
problem, and the network simplex method.
The dual can be helpful for sensitivity analysis. Changing the right-hand side
constraint vector or adding a new constraint to it can make the original optimal
solution infeasible. However, this only changes the objective function or adds a
new variable to the problem, respectively, so the original dual optimal solution is
still feasible (and is usually not far from the new dual optimal solution).
The variables give the shadow prices for the constraints. Suppose you have a
profit maximization problem with a resource constraint Then the value of the
corresponding dual variable in the optimal solution tells you that you get an
increase in the maximum profit for each unit increase in the amount of resource.
Sometimes the dual is just easier to solve. A problem with many constraints and
few variables can be converted into one with few constraints and many variables.

It may be more efficient to solve the question.