0% found this document useful (0 votes)
0 views

Problem 2 LPP

The document contains reports generated by Microsoft Excel's Solver for two linear programming problems, detailing optimal solutions, variable values, and constraints. In the first problem, the objective was to maximize profit with final values of 9 for variable A and 10 for variable B, resulting in a profit of 1160. The second problem aimed to maximize man hours, achieving a final value of 600000 with variable B set at 1500.

Uploaded by

gauravbhukar001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views

Problem 2 LPP

The document contains reports generated by Microsoft Excel's Solver for two linear programming problems, detailing optimal solutions, variable values, and constraints. In the first problem, the objective was to maximize profit with final values of 9 for variable A and 10 for variable B, resulting in a profit of 1160. The second problem aimed to maximize man hours, achieving a final value of 600000 with variable B set at 1500.

Uploaded by

gauravbhukar001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Microsoft Excel 16.

95 Answer Report
Worksheet: [problem 2 LPP.xlsx]Sheet1
Report Created: 21/04/25 5:42:36 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Solver Options

Objective Cell (Max)


Cell Name Original Value Final Value
$K$2 40A + 80B 0 1160

Variable Cells
Cell Name Original Value Final Value Integer
$J$8 A 0 9 Contin
$K$8 B 0 10 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$L$11 2A+ 3B <= 48 48 $L$11<=$N$11 Binding 0
$L$12 1 A<=15 9 $L$12<=$N$12 Not Binding 6
$L$13 1 B <= 10 10 $L$13<=$N$13 Binding 0
Microsoft Excel 16.95 Sensitivity Report
Worksheet: [problem 2 LPP.xlsx]Sheet1
Report Created: 21/04/25 5:42:36 PM

Variable Cells
Final Reduced
Cell Name Value Gradient
$J$8 A 9 0
$K$8 B 10 0

Constraints
Final Lagrange
Cell Name Value Multiplier
$L$11 2A+ 3B <= 48 48 20
$L$12 1 A<=15 9 0
$L$13 1 B <= 10 10 20
Microsoft Excel 16.95 Limits Report
Worksheet: [problem 2 LPP.xlsx]Sheet1
Report Created: 21/04/25 5:42:36 PM

Objective
Cell Name Value
$K$2 40A + 80B 1160

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$J$8 A 9 0 85 250 18835
$K$8 B 10 0 110 398.5 20035
A B
AM FM total available
profit 40 80
Labour (hours) 2 3 48
Sales A max units 1 15
Sales B max units 1 10
1. Objective
maximise prof40A + 80B 1160

2. Decision VA B
9 10

3. Constraints
labour 2A+ 3B <= 48 48 <= 48
Sales A 1 A<=15 9 <= 15
Sales B 1 B <= 10 10 <= 10

4. Non Negativity Constraints


A,B >= 0
Microsoft Excel 16.95 Answer Report
Worksheet: [problem 2 LPP.xlsx]Sheet5
Report Created: 21/04/25 5:55:55 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Solver Options

Objective Cell (Max)


Cell Name Original Value Final Value
$I$3 man hours maximisation = 0 600000

Variable Cells
Cell Name Original Value Final Value Integer
$I$7 A 0 -2.842171E-14 Contin
$J$7 B 0 1500 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$J$11 5A+3B<= 4500 B 4500 $J$11<=$L$11 Binding 0
$J$12 A<=7000 B -2.842171E-14 $J$12<=$L$12 Not Binding 7000
$J$13 B<=10000 B 1500 $J$13<=$L$13 Not Binding 8500
Microsoft Excel 16.95 Sensitivity Report
Worksheet: [problem 2 LPP.xlsx]Sheet5
Report Created: 21/04/25 5:55:56 PM

Variable Cells
Final Reduced
Cell Name Value Gradient
$I$7 A -2.842171E-14 -66.666666667
$J$7 B 1500 0

Constraints
Final Lagrange
Cell Name Value Multiplier
$J$11 5A+3B<= 4500 B 4500 133.333333333
$J$12 A<=7000 B -2.842171E-14 0
$J$13 B<=10000 B 1500 0
Microsoft Excel 16.95 Limits Report
Worksheet: [problem 2 LPP.xlsx]Sheet5
Report Created: 21/04/25 5:55:56 PM

Objective
Cell Name Value
$I$3 man hours maximisation = 600000

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$I$7 A -2.842171E-14 0 85 250 18835
$J$7 B 1500 0 110 398.5 20035
A B max
Profit 600 400
man hours 5 3 45000
max no.of units 1 7000
max no.of units 1 10000
objective to maximise the profit
maximisation = 600A=400B
5800000

Decision variable
A B
3000 10000

constraints

man hours 5A+3B<= 4500 45000 <= 45000


max no.of units A<=7000 3000 <= 7000
max no.of units B<=10000 10000 <= 10000

You might also like