Name: Shweta Sanap Roll No: A050 Subject: DAM

Problem:
For the linear programming problem, use slack variables to convert each constraint into a
linear equation.
Maximize z: 2x1 –x2+2x3
Subject to: 2x1+x2 <= 10
X1+2x2-2x3 <=20
X2 + 2x3 <=5
Such that x1, x2, x3 >=0

Solution:
Primal
Material A Material B Material C
Profits 2 -1 2
Changing
5 0 2.5 Maximum Profit 15
Cells

Constraints
Machine 1 2 1 0 10 <= 10
Machine 2 1 2 -2 0 <= 20
Machine 3 0 1 2 5 <= 5

Sensitivity Report

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$3 Changing Cells Material A 5 0 2 1E+30 2
$C$3 Changing Cells Material B 0 -3 -1 3 1E+30
$D$3 Changing Cells Material C 2.5 0 2 1E+30 2

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$E$6 Machine 1 10 1 10 40 10
$E$7 Machine 2 0 0 20 1E+30 20
$E$8 Machine 3 5 1 5 1E+30 5
DUAL:

Machine 1 Machine 2 Machine 3

Costs 10 20 5
Changing
1 0 1 Minimum Cost 15
Cells

Constraints
Material A 2 1 0 2 >= 2
Material B 1 2 1 2 >= -1
Material C 0 -2 2 2 >= 2

Sensitivity Report

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
Changing Cells Machine
$B$3 1 1 0 10 40 10
Changing Cells Machine
$C$3 2 0 20 20 1E+30 20
Changing Cells Machine
$D$3 3 1 0 5 1E+30 5

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$E$6 Material A 2 5 2 1E+30 2
$E$7 Material B 2 0 -1 3 1E+30
$E$8 Material C 2 2.5 2 1E+30 2