Scribd
Upload
157 views

3 - Program. Lineal Con Solver Excel Oil Blending

The document presents an optimization problem for Sunco, an oil refinery company. The problem involves maximizing profits from blending crude oils and producing gasoline products, subject to various constraints. The decision variables are amounts of crude oils to use and advertising spending. The objective is to maximize total revenue minus costs. Constraints include meeting gasoline demand, limiting crude purchases and refinery capacity, maintaining octane and sulfur levels. The optimal solution is provided.

Uploaded by

julio49
Copyright
© Attribution Non-Commercial (BY-NC)
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
157 views

3 - Program. Lineal Con Solver Excel Oil Blending

The document presents an optimization problem for Sunco, an oil refinery company. The problem involves maximizing profits from blending crude oils and producing gasoline products, subject to various constraints. The decision variables are amounts of crude oils to use and advertising spending. The objective is to maximize total revenue minus costs. Constraints include meeting gasoline demand, limiting crude purchases and refinery capacity, maintaining octane and sulfur levels. The optimal solution is provided.

Uploaded by

julio49
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 6

EXAMPLE 12 OIL BLENDING

We dene the decision variables


a i = dollars spent daily on advertising gas i
(i = 1, 2, 3)
x ij = barrels of crude oil i used daily to produce gas j
(i = 1, 2, 3; j = 1, 2, 3)
For example, x 21 is the number of barrels of crude 2 used each day to produce gas 1.
Thus, Suncos goal is to maximize
z = 21x 11 + 11x 12 + x 13 + 31x 21 + 21x 22 + 11x 23 + 41x 31 + + 31x 32 + 21x 33 - a 1 - a 2 - a 3
Contraint
1- Demand
Gas 1 x 11 + x 21 + x 31 - 10a 1 = 3,000
Gas2 x 12 + x 22 + x 32 - 10a 2 = 2,000
Gas 3 x 13 + x 23 + x 33 - 10a 3 = 1,000
2- Purchased daily
Crude 1 x 11 + x 12 + x 13 5,000
Crude 2 x 21 + x 22 + x 23 5,000
Crude 3 x 31 + x 32 + x 33 5,000
3- Limited capacity
Refinery x 11 + x 21 + x 31 + x 12 + x 22 + x 32 + x 13 + x 23 + x 33 14,000
4- Octane level
Gas 1 2x 11 - 4x 21 - 2x 31 0
Gas 2 4x 12 - 2x 22 0
Gas 3 Redundant constraint and need not be included
5- Sulfur Content
Gas 1 -0.005x 11 + 0.01x 21 + 0.02x 31 0
Gas 2 -0.015x 12 + 0.01x 32 0
Gas 3 -0.005x 13 + 0.01x 23 + 0.02x 33 0
6- General
x ij 0 and a i 0

Variables
Maximize
Constraint 1
Constraint 2
Constraint 3
Constraint 4
Constraint 5
Constraint 6
Constraint 7
Constraint 8
Constraint 9
Constraint 10

X11
21
1
0
0
1
0
0
1
-2
0

X12
11
0
1
0
1
0
0
1
0
-4

X13
1
0
0
1
1
0
0
1
0
0

NOT TO BE INCLUDED

X21
31
1
0
0
0
1
0
1
4
0

X22
21
0
1
0
0
1
0
1
0
2

Constraint 11
Constraint 12
Constraint 13
Valor ptimo

-0.005
0
0

0
-0.015
0

0
0
-0.005

0.01
0
0

0
0
0

2222.22

2111.11

666.67

444.44

4222.22

Nota: Para ver el armado del problema ir a Datos/ Solver

Constraint 1
Constraint 2
Constraint 3
Constraint 4
Constraint 5
Constraint 6
+ x 23 + x 33 14,000

Constraint 7
Constraint 8
Constraint 9
Constraint 10
Constraint 11
Constraint 12
Constraint 13

X23
11
0
0
1
0
1
0
1
0
0

X31
41
1
0
0
0
0
1
1
2
0

X32
31
0
1
0
0
0
1
1
0
0

X33
21
0
0
1
0
0
1
1
0
0

a1
-1
-10
0
0
0
0
0
0
0
0

a2
-1
0
-10
0
0
0
0
0
0
0

a3
-1
0
0
-10
0
0
0
0
0
0

0
0
0.01

0.02
0
0

0
0.01
0

0
0
0.02

0
0
0

0
0
0

0
0
0

333.33

333.33

3166.67

0.00

0.00

750.00

0.00

Signo
=
=
=
=

Lado derecho
$ 287,750.0
3,000
2,000
1,000
5,000
5,000
5,000
14,000
0
0

Valor actual
Max.
3,000
2,000
1,000
5,000
5,000
3,500
13,500
-2,000
0

0
0
0

0
0
5.65639E-16

You might also like