Scribd
Upload
16 views4 pages

Cell Name Original Value Final Value

The document contains the results of a linear programming problem solved using Microsoft Excel. The solver found a feasible solution that satisfied all constraints and maximized the objective cell, obtaining an optimal value of 18030438000. The final values of the variables x1 through x5 were 18868, 20816, 37072, 28200, and 12650 respectively. All constraints were either binding or satisfied with a non-negative slack value.

Uploaded by

Imam Aprimade
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
16 views4 pages

Cell Name Original Value Final Value

The document contains the results of a linear programming problem solved using Microsoft Excel. The solver found a feasible solution that satisfied all constraints and maximized the objective cell, obtaining an optimal value of 18030438000. The final values of the variables x1 through x5 were 18868, 20816, 37072, 28200, and 12650 respectively. All constraints were either binding or satisfied with a non-negative slack value.

Uploaded by

Imam Aprimade
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/ 4

Microsoft Excel 14.

0 Answer Report
Worksheet: [Arief.xlsx]Maximum
Report Created: 12/03/2013 23:19:39
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: GRG Nonlinear
Solution Time: 0,016 Seconds.
Iterations: 0 Subproblems: 0
Solver Options
Max Time 100 sec, Iterations 100, Precision 0,000001
Convergence 0,0001, Population Size 100, Random Seed 0, Derivatives Forward, Require Bounds
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints
Objective Cell (Max)
Cell
Name
$C$24 18000*x1+18000*x2+8000*x3+28000*x4+1283000*x5

Original Value
18030438000

Final Value
18030438000

Variable Cells
Cell
$F$16 x1
$F$17 x2
$F$18 x3
$F$19 x4
$F$20 x5

Name

Original Value
18868
20816
37072
28200
12650

Final Value
18868
20816
37072
28200
12650

Name

Cell Value
117606
18868
20816
37072
28200
12650
12650
28200
37072
20816
18868

Constraints
Cell
$D$26 =
$D$27 =
$D$28 =
$D$29 =
$D$30 =
$D$31 =
$F$20 x5
$F$19 x4
$F$18 x3
$F$17 x2
$F$16 x1

Formula
$D$26>=$F$26
$D$27<=$F$27
$D$28<=$F$28
$D$29<=$F$29
$D$30<=$F$30
$D$31<=$F$31
$F$20>=0
$F$19>=0
$F$18>=0
$F$17>=0
$F$16>=0

thout Integer Constraints

Integer
Contin
Contin
Contin
Contin
Contin

Status
Not Binding
Binding
Binding
Binding
Binding
Binding
Not Binding
Not Binding
Not Binding
Not Binding
Not Binding

Slack
70000
0
0
0
0
0
12650
28200
37072
20816
18868

Microsoft Excel 14.0 Sensitivity Report


Worksheet: [Arief.xlsx]Maximum
Report Created: 12/03/2013 23:19:39

Variable Cells
Cell
$F$16
$F$17
$F$18
$F$19
$F$20

Final
Reduced
Name Value Gradient
x1
18868
0
x2
20816
0
x3
37072
0
x4
28200
0
x5
12650
0

Constraints
Final Lagrange
Cell Name Value Multiplier
$D$26 =
117606
0
$D$27 =
18868
18000
$D$28 =
20816
18000
$D$29 =
37072
8000
$D$30 =
28200
28000
$D$31 =
12650
1283000

Aplikas Linear Program Terhadap Kontrol Polusi


River B

River A
City

Airport
River C
Sumber
River A
River B
River C
Airport
City

Polusi (Kg/thn)
18868
20816
37072
28200
12650

Biaya Menghilangkan Polusi (Rp/Kg)


15000
15000
5000
25000
1253000

Direncanakan bahwa total polusi dari kelima sumber di atas akan dikurangi hingga menjadi 70000
Kg/thn saja. Hitung biaya minimum dan juga biaya maksimum untuk menghilangkan polusi sehingga
mencapai target 70000 Kg/thn.
Jawab
variable

variable
x1
x2
x3
x4
x5

river a
river b
river c
airport
city

x1
x2
x3
x4
x5

0
10534
37072
0
0

objective
minimization
subject

15000*x1+15000*x2+5000*x3+25000*x4+1253000*x5
343370000
Rp/yr

x1+x2+x3+x4+x5
x1
x2
x3
x4
x5

47606
0
10534
37072
0
0

>=
<=
<=
<=
<=
<=

47606
18868
20816
37072
28200
12650

You might also like