Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
7 views7 pages

Linear Programming Problem 2

The Microsoft Excel Solver found an optimal solution for a linear programming problem, satisfying all constraints with an objective function value of 45522.22. The solution involved four decision variables with specific final values and constraints, some of which were binding. The report also includes sensitivity analysis for the variable cells and constraints, detailing their final values and allowable increases and decreases.

Uploaded by

AKASH RAJ
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
7 views7 pages

Linear Programming Problem 2

The Microsoft Excel Solver found an optimal solution for a linear programming problem, satisfying all constraints with an objective function value of 45522.22. The solution involved four decision variables with specific final values and constraints, some of which were binding. The report also includes sensitivity analysis for the variable cells and constraints, detailing their final values and allowable increases and decreases.

Uploaded by

AKASH RAJ
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/ 7

Microsoft Excel 16.

0 Answer Report

Worksheet: [Linear programming problem 2.xlsx]Sheet1

Report Created: 21-01-2024 16:27:00

Result: Solver found a solution. All Constraints and optimality conditions are satisfied.

Solver Engine

Engine: Simplex LP

Solution Time: 0.031 Seconds.

Iterations: 3 Subproblems: 0

Solver Options

Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling

Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegati

Objective Cell (Max)

Cell Name Original Value Final Value

$O$5 obj func x1 45522.222222 45522.2222222

Variable Cells

Cell Name Original Value Final Value Integer

$O$4 dv x1 175.55555556 175.555555556 Contin

$P$4 dv x2 57.777777778 57.7777777778 Contin

$Q$4 dv x3 500 500 Contin

$R$4 dv x4 0 0 Contin

Constraints

Cell Name Cell Value Formula Status Slack


$S$10 c4 LHS 233.33333333 $S$10<=$U$10 Not Binding 266.66666667

$S$11 c5 LHS 500 $S$11<=$U$11 Binding 0

$S$7 c1 LHS 72 $S$7<=$U$7 Binding 0

$S$8 c2 LHS 1200 $S$8<=$U$8 Binding 0

$S$9 c3 LHS 21593.333333 $S$9<=$U$9 Not Binding 3406.6666667


nditions are satisfied.

matic Scaling

nce 1%, Assume NonNegative


Microsoft Excel 16.0 Sensitivity Report

Worksheet: [Linear programming problem 2.xlsx]Sheet1

Report Created: 21-01-2024 16:27:00

Variable Cells

Final Reduced Objective Allowable Allowable

Cell Name Value Cost Coefficient Increase Decrease

$O$4 dv x1 175.55555556 0 90 11.923076923 40

$P$4 dv x2 57.777777778 0 125 13.214285714 11.923076923

$Q$4 dv x3 500 0 45 1E+030 4.1111111111

$R$4 dv x4 0 -10.333333333 65 10.333333333 1E+030

Constraints

Final Shadow Constraint Allowable Allowable

Cell Name Value Price R.H. Side Increase Decrease

$S$10 c4 LHS 233.33333333 0 500 1E+030 266.66666667

$S$11 c5 LHS 500 4.1111111111 500 185.71428571 500

$S$7 c1 LHS 72 233.33333333 72 26.333333333 8.6666666667

$S$8 c2 LHS 1200 22.222222222 1200 260 316

$S$9 c3 LHS 21593.333333 0 25000 1E+030 3406.6666667


Maximize Linear Programming Model

X1 X2 X3 X4

OBJ CO-EFF 90 125 45 65

DV 175.5556 57.77778 500 0

OBJ FUNC 45522.22

CONSTRAINT LHS SIGN

C1 0.1 0.25 0.08 0.21 72 <=

C2 3 3 1 1 1200 <=

C3 36 48 25 35 21593.33 <=

C4 1 1 0 0 233.3333 <=

C5 0 0 1 1 500 <=
Maximize Linear Programming Model

x1 x2

Obj func 90 125

DV 175.5556 57.77778

Obj func 45522.22

RHS Constraint

72 C1 0.1 0.25

1200 C2 3 3

25000 C3 36 48

500 C4 1 1

500 C5 0 0
ar Programming Model

x3 x4

45 65

500 0

LHS SIGN RHS

0.08 0.21 72 <= 72

1 1 1200 <= 1200

25 35 21593.33 <= 25000

0 0 233.3333 <= 500

1 1 500 <= 500

You might also like