Scribd Logo
Upload

Welcome to Scribd!

  • Program. Lineal Con Solver Excel Oil Blending Oct 2015

    Uploaded by

    julio49
    57 views8 pages
    The document defines variables and constraints for an oil blending optimization problem. The goal is to maximize total profit by determining the optimal amounts of crude oils to use to produce different types of gas while meeting demand constraints and accounting for factors like advertising costs, refinery capacity, octane and sulfur levels. The problem is formulated as a linear program with the objective of maximizing profit and over a dozen constraints related to demand, supply, capacity and product quality.

    Original Description:

    Solver de Excel

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines variables and constraints for an oil blending optimization problem. The goal is to maximize total profit by determining the optimal amounts of crude oils to use to produce different types of gas while meeting demand constraints and accounting for factors like advertising costs, refinery capacity, octane and sulfur levels. The problem is formulated as a linear program with the objective of maximizing profit and over a dozen constraints related to demand, supply, capacity and product quality.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    57 views8 pages

    Program. Lineal Con Solver Excel Oil Blending Oct 2015

    Uploaded by

    julio49
    The document defines variables and constraints for an oil blending optimization problem. The goal is to maximize total profit by determining the optimal amounts of crude oils to use to produce different types of gas while meeting demand constraints and accounting for factors like advertising costs, refinery capacity, octane and sulfur levels. The problem is formulated as a linear program with the objective of maximizing profit and over a dozen constraints related to demand, supply, capacity and product quality.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 8

    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
    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
    Renery x 11 + x 21 + x 31 + x 12 + x 22 + x 32 + x 13 + x 23
    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

    X11

    X12

    X13

    X21

    Maximize

    21

    11

    31

    Constraint 1

    Constraint 2

    Constraint 3

    Constraint 4

    Constraint 5

    Constraint 6

    Constraint 7

    Constraint 8

    -2

    Constraint 9

    Constraint 10

    -4

    NOT TO BE INCLUDED

    Constraint 11

    -0.005

    0.01

    Constraint 12

    -0.015

    Constraint 13

    -0.005

    Valor ptimo

    2222.22

    2111.11

    666.67

    444.44

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


    Revisado oct 2015

    + 21x 33 - a 1 - a 2 - a 3

    Constraint 1
    Constraint 2
    Constraint 3
    Constraint 4
    Constraint 5
    Constraint 6
    32 + x 13 + x 23 + x 33 14,000Constraint 7
    Constraint 8
    Constraint 9
    Constraint 10

    included

    Constraint 11
    Constraint 12
    Constraint 13

    X22

    X23

    X31

    X32

    X33

    a1

    21

    11

    41

    31

    21

    -1

    -10

    0.02

    0.01

    0.01

    0.02

    4222.22

    333.33

    333.33

    3166.67

    0.00

    0.00

    a2

    a3

    Signo

    Lado derecho

    -1

    -1

    $ 287,750.0

    3,000

    -10

    2,000

    -10

    1,000

    5,000

    5,000

    5,000

    14,000

    750.00

    0.00

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

    0
    0
    0
    5.65638629687E-016

    You might also like