Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Serie Revision Solutions

    Uploaded by

    Imen Ksouri
    The document contains three questions about optimization problems. Question 1 involves maximizing production of exterior and interior paint under capacity constraints. Question 2 involves maximizing advertising spending under budget constraints. Question 3 presents a standard form linear program and determines its optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Serie Revision Solutions

    Uploaded by

    Imen Ksouri
    5 views5 pages
    The document contains three questions about optimization problems. Question 1 involves maximizing production of exterior and interior paint under capacity constraints. Question 2 involves maximizing advertising spending under budget constraints. Question 3 presents a standard form linear program and determines its optimal solution.

    Original Title

    serie-revision-solutions

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains three questions about optimization problems. Question 1 involves maximizing production of exterior and interior paint under capacity constraints. Question 2 involves maximizing advertising spending under budget constraints. Question 3 presents a standard form linear program and determines its optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    5 views5 pages

    Serie Revision Solutions

    Uploaded by

    Imen Ksouri
    The document contains three questions about optimization problems. Question 1 involves maximizing production of exterior and interior paint under capacity constraints. Question 2 involves maximizing advertising spending under budget constraints. Question 3 presents a standard form linear program and determines its optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    Business Optimization

    Spring 2023
    Revision tutorial
    Solutions

    Question 1

    Let X1 be the daily production in tons of the exterior paint.

    Let X2 be the daily production in tons of the interior paint.

    Max Z = 5 X1+4 X2

    s.t. 6 X1 + 4 X2 ≤ 24

    X1 + 2 X2 ≤ 6

    X2 ≤ 2

    X2 - X1 ≤ 1

    X1 ≥ 0, X2 ≥ 0

    Question 2

    Let : X1 be the number of local TV ads.


    X2 be the number of by satelite TV ads.
    X3 be the number of radio ads.
    X4 be the number of newspapers ads.

    1
    Max Z = 400X1+900X2+500X3+200X4
    s.t. 40X1+75X2+30X3+15X4 ≤ 800
    30X1+40X2+20X3+10X4 ≥ 200
    40X1+75X2≤ 500
    X1 ≥ 3
    X2 ≥ 2
    X3 ≥ 5
    X3 ≤ 10
    X4 ≥ 5
    X4 ≤ 10
    X1 ≥ 0, X2 ≥ 0, X3 ≥ 0, X4≥ 0,

    Question 3

    Standard form

    𝑀𝑎𝑥𝑍 = 300𝑥1 + 500 𝑥2

    𝑥1 + 𝟐𝑥2 + 𝑺𝟏 = 20
    2𝑥 + 𝑥2 + 𝑺𝟐 = 22
    s.t.{ 1
    𝑥1 + 𝑥2 + 𝑺𝟑 = 𝟏2
    𝑥1 , 𝑥2 , 𝑺𝟏 , 𝑺𝟐 , 𝑺𝟑 ≥ 0

    300 500 0 0 0 R.H.S R.T

    X1 X2 S1 S2 S3

    0 S1 1 2 1 0 0 20 10

    0 S2 2 1 0 1 0 22 22

    0 S3 1 1 0 0 1 12 12

    Zj 0 0 0 0 0 0

    Cj - Zj 300 500 0 0 0 -

    Corner point (0,0)

    300 500 0 0 0 R.H.S R.T

    2
    X1 X2 S1 S2 S3

    500 X2 1/2 1 1/2 0 0 10 20

    0 S2 3/2 0 -1/2 1 0 12 8

    0 S3 1/2 0 -1/2 0 1 2 4

    Zj 250 500 250 0 0 5 000

    Cj - Zj 50 0 -250 0 0 -

    Corner point (0,10)

    300 500 0 0 0 R.H.S

    X1 X2 S1 S2 S3

    500 X2 0 1 1 0 -1 8

    0 S2 0 0 1 1 -3 6

    300 X1 1 0 -1 0 2 4

    Zj 300 500 200 0 100 5200

    Cj - Zj 0 0 -200 0 -100 -

    Corner point (4,8)

    As we are maximizing, this tableau is optimal because all the Cj - Zj row values are zero or
    negative.

    The optimal solution is X1*=4, X2*= 8, S1*= S3*=0, S2*=6, Z*=5 200

    To determine the type of the constraint, it suffices to replace the optimal solution in the
    constraint. If the slack is equal to zero, then the constraint is binding. Else, the constraint is not
    binding.

    C1:4 + 𝟐 ∗ 8 + 𝟎 = 20: binding constraint.

    C2:2 ∗ 4 + 8 ≠ 22: non-binding constraint.

    C3:4 + 8 + 𝟎 = 𝟏2: binding constraint.

    3
    Question 4

    1. Optimal solution: X1*=5, X2*=6, Z*=40


    2. C1: 5 = 5 Binding constraint
    C2:2 ∗ 6 = 12 Binding constraint
    C3:3 ∗ 5 + 2 ∗ 6 ≠ 18 Non-binding constraint
    3. Dual LP

    𝑀𝑖𝑛 𝑊 = 5𝑌1 + 12𝑌2 +18𝑌3

    𝑌1 + 3𝑌3 ≥ 2
    s.t.{ 2𝑌2 + 2𝑌3 ≥ 5
    𝑌1 ≥ 0, 𝑌2 𝑢𝑟𝑠, 𝑌3 ≤ 𝟎

    We have X1*>0. Therefore, E1 = 0.

    We have X1*>0. Therefore, E2 = 0.

    The first two primal constraints are binding. Therefore, Y1 and Y2 are different from zero.

    The third primal constraint is not binding. Therefore, Y3 is equal to zero.

    4
    Dual optimal solution: E1* = 0, E2* = 0, Y1*=2, Y2*=5/2, Y3*=0, W*=Z*= 40

    Question 5

    1. The optimal company’s production plan is as follows: Produce 33 units of product 1 and
    66 units of product 2. For product 3, the company will not produce it. This optimal plan
    gives an optimal profit of 2200/3 dinars.
    2.
    a. For an additional labor hour, the company is willing to pay up to 2/3 dinars.
    b. For an additional administrative service hour, the company is not willing anything
    because the shadow price of resource 3 is equal to 0.
    3. The profitable products are those in the basis of the optimal simplex tableau. Therefore,
    products 1 and 2 are profitable.
    4. The only non-profitable product is product 3. In order to be incorporated in the production
    plan, its selling price should jump for 4 to at least 6.67 dinars.

    You might also like