Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Problem A

    Uploaded by

    cha rish
    1) The document presents an optimization problem to determine the optimal number of workers to hire or fire each week to minimize total costs. 2) It outlines the costs and constraints at each stage (week) and calculates the optimal solution for the number of workers at each stage that results in the minimum total cost. 3) The minimum total cost was found to be $3,400 by hiring 6 workers in week 1, firing 1 worker in week 2, firing 2 more workers in week 3, hiring 3 workers back in week 4, and hiring 2 more workers in week 5.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Problem A

    Uploaded by

    cha rish
    12 views2 pages
    1) The document presents an optimization problem to determine the optimal number of workers to hire or fire each week to minimize total costs. 2) It outlines the costs and constraints at each stage (week) and calculates the optimal solution for the number of workers at each stage that results in the minimum total cost. 3) The minimum total cost was found to be $3,400 by hiring 6 workers in week 1, firing 1 worker in week 2, firing 2 more workers in week 3, hiring 3 workers back in week 4, and hiring 2 more workers in week 5.

    Original Description:

    Original Title

    ProblemA

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) The document presents an optimization problem to determine the optimal number of workers to hire or fire each week to minimize total costs. 2) It outlines the costs and constraints at each stage (week) and calculates the optimal solution for the number of workers at each stage that results in the minimum total cost. 3) The minimum total cost was found to be $3,400 by hiring 6 workers in week 1, firing 1 worker in week 2, firing 2 more workers in week 3, hiring 3 workers back in week 4, and hiring 2 more workers in week 5.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    12 views2 pages

    Problem A

    Uploaded by

    cha rish
    1) The document presents an optimization problem to determine the optimal number of workers to hire or fire each week to minimize total costs. 2) It outlines the costs and constraints at each stage (week) and calculates the optimal solution for the number of workers at each stage that results in the minimum total cost. 3) The minimum total cost was found to be $3,400 by hiring 6 workers in week 1, firing 1 worker in week 2, firing 2 more workers in week 3, hiring 3 workers back in week 4, and hiring 2 more workers in week 5.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    Andrade, Charish Garlet F.

    May 11,2021

    SBIE-3F OR2

    PROBLEM A

    a) b1=6, b2=5, b3=3, b4=6, b5=8


    C1= 300 = 3 ; C2= 400 + 200 = 4+2

    Stage 5 (b5= 8)

    C1(X5-8)+C2(X5-X4) Optimum Solution


    X4
    X5=8 F5(X4) X5
    6 3(8-8)+4+2(8-6) = 8 8 8
    8 3(8-8)+4+2(8-8) = 0 0 8

    Stage 4 (b4= 6)

    C1(X4-6)+C2(X4-X3) + F5(X4) Optimum Solution


    X3
    X4= 6 X4= 8 F4(X3) X4
    3 3(6-6)+4+2(6-3)+8 = 18 3(8-6)+4+2(8-3)+0 = 20 18 6
    5 3(6-6)+4+2(6-5)+8 = 14 3(8-6)+4+2(8-5)+0 = 16 14 6
    6 3(6-6)+4+2(6-6)+8 = 8 3(8-6)+4+2(8-6)+0 = 14 8 6
    8 3(6-6)+4+2(6-8)+8 = 8 3(8-6)+4+2(8-8)+0 = 6 6 8

    Stage 3 (b3= 3)

    C1(X3-3)+C2(X3-X2) + F4(X3) Optimum Solution


    X2
    X3= 3 X3= 5 X3= 6 X3= 8 F3(X2) X3

    3(3-3)+4+2(3-5)+18 = 3(5-3)+4+2(5-5)+14 3(6-3)+4+2(6-5)+8 = 3(8-3)+4+2(8-5)+6


    5 23 = 31 18 3
    18 = 20

    3(3-3)+4+2(3-6)+18 = 3(5-3)+4+2(5-6)+14 3(6-3)+4+2(6-6)+8 3(8-3)+4+2(8-6)+6


    6 = 17 = 29 17 6
    18 = 20

    3(3-3)+4+2(3-8)+18 = 3(5-3)+4+2(5-8)+14 3(6-3)+4+2(6-8)+8 3(8-3)+4+2(8-8)+6


    8 = 17 = 21 17 6
    18 = 20
    Stage 2 (b2 = 5)

    C1(X2-5)+C2(X2-X1)+F3(X2) Optimum Solution


    X1
    X2= 5 X2= 6 X2= 8 F2(X1) X2
    3(5-5)+4+2(5-6)+18 3(6-5)+4+2(6-6)+17 3(8-5)+4+2(8-6)+17
    6 18 5
    = 18 = 20 = 34
    3(5-5)+4+2(5-8)+18 3(6-5)+4+2(6-8)+17 3(8-5)+4+2(8-8)+17
    8 18 5
    = 18 =20 = 26

    Stage 1 (b1= 6)

    C1(X1-6)+C2(X1-X0) +F2(X1) Optimum Solution


    X0
    X1= 6 X1= 8 F1(X0) X1
    3(6-6)+4+2(6-0)+18 = 3(8-6)+4+2(8-0)+18 =
    0 34 6
    34 44

    MinZ= 3,400 dollars

    Decision:

    Week Actual Computation Decision


    0 0 0 0
    1 6 6 Hired 6 workers
    2 5 5 Fired 1 worker
    3 3 3 Fired 2 workers
    4 6 6 Hired 3 workers
    5 8 8 Hired 2 workers

    You might also like