II.

SENSITIVITY REPORT

Variable cells

Cell Name Final Reduce Objective Allowable Allowable

Value cost Coefficient Increase Decrease

$J$3 Number of nuts to 3 0 17.5 3.5 15.166666

make 6666667

$K$3 Number of bolts to 3 0 7 45.5 1.1666666

make 6666667

This table represents the optimal solution to our problem in order for us to know how
many packages of nuts and bolts to produce to maximize the profit or reach the optimal
objective function. So in this case, the manufacturer should produce 3 packages of nuts
with profit of Rs 17.5 per pack and 3 packages of bolts with a profit of Rs.7 per pack.

If the manufacturer wishes to increase/decrease the objective coefficient of nuts, then it is

only allowable up to 3.5 increase and 15.1667 decrease.And allowable increase of objective
coefficient for bolts up to 45.5 and a decrease down to 1.1667 .Note that if the changes in
the objective coefficient exceeds the allowable ranges, then it is required to rerun the
program.

Constraints

Cell Name Final Shado Constraints Allowabl Allowable

Value w Price R.H Side e Decrease
Increase

$L$6 Machine A Used 12 0.4375 12 24 8

$L$7 Machine B Used 12 5.6875 12 24 8

This table represents binding/not binding constraints and the shadow price or
estimated price increase/decrease when there is a change in R.H side of constraints. It is
shown above that both the left and right hand side of constraints for machine A and
machine B are of the same value or equal, this only means that the constraints are in
binding status or the 12hrs operation time limit for each machine are all used up to produce
desired number of packages or reach the optimal solution.

If the R.H side of the constraints or the limiting constraints changes, whether to increase or
decrease as long as it is in allowable ranges, the number of packages and profit also
changes. In this case, if the operation time for both machines increases up to 14hrs per day,
then the profit will also increase up to 0.875 (0.4375 x 2) for machine A and 11.8375
( 5.6875 x 2) for machine B.

lll. LIMIT REPORT

Cell Objective Name Value

$L$10 Unit Profit Maximum Number 73.5

Cell Variable Name Value Lowe Objective Upper Objecti

r Result Limit ve
Limit Result

$J$3 Number of nuts to 3 0 21 3 73.5

make

$K$3 Number of bolts to 3 0 52.5 3 73.5

make

The table shows that in order to reach the optimal objective function or maximum
profit which is Rs 73.5, the machineries must produce 3 packages of bolts and 3 packages
of nuts in order to satisfy the constraints.