Scribd
Upload
4 views11 pages

Linear Programming Problem

The document discusses linear programming problems (LPP) focused on optimizing the utilization of limited resources to maximize profit and minimize costs. It outlines decision variables for two types of products, constraints related to labor, budget, and materials, and the non-negativity constraints that ensure no negative production values. The results from Microsoft Excel's Solver indicate an optimal solution with a maximum profit of approximately 252.17, with specific values for the decision variables A and B.

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
4 views11 pages

Linear Programming Problem

The document discusses linear programming problems (LPP) focused on optimizing the utilization of limited resources to maximize profit and minimize costs. It outlines decision variables for two types of products, constraints related to labor, budget, and materials, and the non-negativity constraints that ensure no negative production values. The results from Microsoft Excel's Solver indicate an optimal solution with a maximum profit of approximately 252.17, with specific values for the decision variables A and B.

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/ 11

linear programing problems LPP

optimisation max utilisation of limited resources


1. objective (goal) max profit
minimise cost

2 decision Variables (DVs) type A how many is decided by decision makers


varieties that you manufacture type B

3. constraints labour
budjet
material

4. Non negative constraints either 0 or some number of units are being manufactured
A,B>=0
cided by decision makers

units are being manufactured


Microsoft Excel 16.95 Answer Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 21/04/25 12:16:49 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: GRG Nonlinear
Solution Time: 839.304 Seconds.
Iterations: 3 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 1E-06
Convergence 0.0001, Population Size 100, Random Seed 0, Derivatives Forward, Require Bounds
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Solve Without Integer Constrain

Objective Cell (Max)


Cell Name Original Value Final Value
$G$3 Profit 20A+40B 0 252.17391304

Variable Cells
Cell Name Original Value Final Value Integer
$G$11 A 0 3.0434782609 Contin
$H$11 B 0 4.7826086957 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$I$14 1A+0.5B <= 10 b*40 5.4347826087 $I$14<=$K$14 Not Binding 4.5652173913
$I$15 500A+100B <= 2000 b*40 2000 $I$15<=$K$15 Binding 0
$I$16 200A+500B <= 3000 b*40 3000 $I$16<=$K$16 Binding 0
ire Bounds
Without Integer Constraints, Assume NonNegative
Microsoft Excel 16.95 Sensitivity Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 21/04/25 12:16:50 PM

Variable Cells
Final Reduced
Cell Name Value Gradient
$G$11 A 3.0434782609 0
$H$11 B 4.7826086957 0

Constraints
Final Lagrange
Cell Name Value Multiplier
$I$14 1A+0.5B <= 10 b*40 5.4347826087 0
$I$15 500A+100B <= 2000 b*40 2000 0.0086956522
$I$16 200A+500B <= 3000 b*40 3000 0.0782608696
Microsoft Excel 16.95 Limits Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 21/04/25 12:16:50 PM

Objective
Cell Name Value
$G$3 Profit 20A+40B 252.17391304

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$G$11 A 3.0434782609 0 85 250 18835
$H$11 B 4.7826086957 0 110 398.5 20035
Microsoft Excel 16.96 Answer Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 22/04/25 3:25:03 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
$G$3 Profit 20A+40B 0 252.17391304

Variable Cells
Cell Name Original Value Final Value Integer
$G$11 A 0 3.0434782609 Contin
$H$11 B 0 4.7826086957 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$I$14 1A+0.5B <= 10 b*40 5.4347826087 $I$14<=$K$14 Not Binding 4.5652173913
$I$15 500A+100B <= 2000 b*40 2000 $I$15<=$K$15 Binding 0
$I$16 200A+500B <= 3000 b*40 3000 $I$16<=$K$16 Binding 0
Microsoft Excel 16.96 Sensitivity Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 22/04/25 3:25:03 PM

Variable Cells
Final Reduced
Cell Name Value Gradient
$G$11 A 3.0434782609 0
$H$11 B 4.7826086957 0

Constraints
Final Lagrange
Cell Name Value Multiplier
$I$14 1A+0.5B <= 10 b*40 5.4347826087 0
$I$15 500A+100B <= 2000 b*40 2000 0.0086956522
$I$16 200A+500B <= 3000 b*40 3000 0.0782608696
Microsoft Excel 16.96 Limits Report
Worksheet: [Linear Programming Problem.xlsx]Sheet2
Report Created: 22/04/25 3:25:03 PM

Objective
Cell Name Value
$G$3 Profit 20A+40B 252.17391304

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$G$11 A 3.0434782609 0 85 250 18835
$H$11 B 4.7826086957 0 110 398.5 20035
A B 1. Objective
Milk Dark maximise profit
Profit 20 40

Constraints total available resources Milk


Milk(ltrs) 1 0.5 10 1 Unit
Sugar(gms) 500 100 2000 A units
Cocoa(gms) 200 500 3000

2. Decision Variables

3. Constraints
Milk
Sugar
Cocoa

4. Non Negativity Constraints


A,B >= 0
20A+40B
252.173913

Dark
20 Rs 1 Unit 40 Rs
a*20 B units b*40

A B
3.04347826 4.7826087

1A+0.5B <= 10 5.43478261 <= 10 slack


500A+100B <= 2000 2000 <= 2000 binding factor
200A+500B <= 3000 3000 <= 3000 binding factor

You might also like