Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Name: Trisky Mangunsong IDN: 4182111031 Class: Bilingual Mathematics Education 2018

    Uploaded by

    Triski Mangunsong
    This document provides solutions to optimization problems involving maximizing or minimizing objective functions subject to constraints. Four problems are solved: 1. Maximizing a function of x1 and x2, with the maximum found to be 27.49. 2. Maximizing a function of x and y for a furniture business, with the optimum value found to be 400. 3. Maximizing a function of x and y for an animal farming business, with the minimum value found to be 13.5. 4. Maximizing a function of x and y for electronics production, with two maximum values found to both be 1400.

    Copyright:

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

    Name: Trisky Mangunsong IDN: 4182111031 Class: Bilingual Mathematics Education 2018

    Uploaded by

    Triski Mangunsong
    29 views7 pages
    This document provides solutions to optimization problems involving maximizing or minimizing objective functions subject to constraints. Four problems are solved: 1. Maximizing a function of x1 and x2, with the maximum found to be 27.49. 2. Maximizing a function of x and y for a furniture business, with the optimum value found to be 400. 3. Maximizing a function of x and y for an animal farming business, with the minimum value found to be 13.5. 4. Maximizing a function of x and y for electronics production, with two maximum values found to both be 1400.

    Original Description:

    routine task

    Original Title

    Routine Task 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides solutions to optimization problems involving maximizing or minimizing objective functions subject to constraints. Four problems are solved: 1. Maximizing a function of x1 and x2, with the maximum found to be 27.49. 2. Maximizing a function of x and y for a furniture business, with the optimum value found to be 400. 3. Maximizing a function of x and y for an animal farming business, with the minimum value found to be 13.5. 4. Maximizing a function of x and y for electronics production, with two maximum values found to both be 1400.

    Copyright:

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

    Name: Trisky Mangunsong IDN: 4182111031 Class: Bilingual Mathematics Education 2018

    Uploaded by

    Triski Mangunsong
    This document provides solutions to optimization problems involving maximizing or minimizing objective functions subject to constraints. Four problems are solved: 1. Maximizing a function of x1 and x2, with the maximum found to be 27.49. 2. Maximizing a function of x and y for a furniture business, with the optimum value found to be 400. 3. Maximizing a function of x and y for an animal farming business, with the minimum value found to be 13.5. 4. Maximizing a function of x and y for electronics production, with two maximum values found to both be 1400.

    Copyright:

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

    Name : Trisky Mangunsong

    IDN : 4182111031
    Class : Bilingual Mathematics Education 2018

    Routine Task
    1. Determine the solution area for the following problems
    a. Maximize 𝑧 = 3𝑥1 + 5𝑥2
    Constraints :
    2𝑥1 ≤ 8
    3𝑥2 ≤ 15
    6𝑥1 + 5𝑥2 ≤ 30
    𝑛𝑜𝑛 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒 𝑡𝑒𝑟𝑚𝑠 ∶ 𝑥1 + 𝑥2 ≥ 0

    Answer :
    2𝑥1 ≤ 8 ; 𝑥1 ≤ 4 ; (4,0)
    3𝑥2 ≤ 15 ; 𝑥2 ≤ 5 ; (0,5)
    6𝑥1 + 5𝑥2 ≤ 30 ;
    𝑖𝑓 𝑥1 = 0, 𝑠𝑜 𝑥2 = 6 ; (0,6)

    𝑖𝑓 𝑥2 = 0, 𝑠𝑜 𝑥1 = 5 ; (5,0)

    So, we can make that graphic like this

    Y-Values
    7

    6
    (0,83 ; 5) (4,5)
    5

    1 HP (4 ; 1,2)

    0
    0 1 2 3 4 5 6

    A = (4,0) So, z = 3(4) + 5(0) = 12


    B = (0,5) So, z = 3(0) + 5(5) = 25
    C = (4, 1,2) So, z = 3(4) + 5(1,2) = 18
    D = (0,83 ,5) So, z = 3(0,83) + 5(5) = 27,49
    So, the maximize value is Z= 27,49 which is located at the coordinate point D= (0,83 , 5)

    For Autograph solution we can see the isoprophyt line value in 27,5

    3. find the settlement area and the solution from the question bellow.

    a. Usaha Furniture Bapak Fatih


    b. Program diet dr. Farras
    c. Usaha ternak PT Aryasatya
    d. PT Dewi Elektronik

    a. Constrain function:
    x represent the sum of the table
    y represent the sum of the chair
    2x + y ≤ 40
    6y ≤ x or 6y – x ≤ 0
    x ≥ 0, y ≥ 0
    Objective function: maximize the f(x,y) = 20x + 10y (in 10.000)

    Solution:
    2x + y = 40
    6y = x
    2(6y) + y = 40
    12y + y = 40
    13y = 40
    y = 40/13 ≈ 3
    2x + y = 40
    2x + 40/13 = 40
    2x = 40 – 40/13
    x = 240/13 ≈18

    The Graph is like thIS

    The points that we get from graph is:


    A(0,0) → f(0,0) = 20x + 10y = 20(0) + 10(0) = 0
    B(18,3) → f(18,3) = 20(18) + 3(10) = 390 (in 10.000)
    C(20,0) → f(20,0) = 20(20) + 10(0) = 400 (in 10.000) → optimum value

    To find Optimum value with isoprophit Line we use the autograph softwate

    b. Constrain function:
    x represent the sum of the cheese cake
    y represent the sum of the honey cake
    5x + 20y ≥ 60
    6x + 4y ≥ 30
    10x + 5y ≥ 40
    x≤8
    y ≤ 12
    x ≥ 0, y ≥ 0
    Objective function: maximize the f(x,y) = 2x + 3y (in 10.000)
    Solution
    5x + 20y = 60 │x1│
    6x + 4y = 30 │x5│
    5x + 20y = 60
    30x + 20y = 150 -
    -25x = -90
    x = 3,6
    5x + 20y = 60
    5(3,6) + 20y = 60
    18 +20y = 60
    20y = 60 -18
    y = 42/20
    y = 2,1
    (x,y) = (3.6,2.1)
    6x + 4y = 30 │x5│
    10x + 5y = 40 │x4│
    30x + 20y = 150
    40x + 20y = 160 -
    -10x = -10
    x=1
    6x + 4y = 30
    6(1) + 4y = 30
    6 +4y = 30
    4y = 24
    y=6
    (x,y) = (1,6)

    The graph is like :

    The points that we get from the graph is:


    A(0,8) → f(0,8) = 2(0) + 3(8) = 24 (in 10.000)
    B(1,6) → f(1,6) = 2(1) + 3(6) = 20 (in 10.000)
    C(3.6,2.1) → f(3.6,2.1) = 2(3,6) + 3(2,1) = 13,5 (in 10.000) → minimum value
    D(8,1) → f(8,1) = 2(8) + 3(1) = 19 (in 10.000)
    The solution using the Isophropyt line is:

    c. Constrain function:
    x represent the number (kg) of the soybean seeds
    y represent the number ( kg) of the corn kernels
    x + y = 50
    0,003x + 0,002y ≤ 1
    0,8x + 0,1y ≥ 10
    0,08x + 0,04y ≤ 1
    x ≥ 0, y ≥ 0
    Objective function: maximize the f(x,y) = 6x + 4y (in 1000)
    The graph is like that

    There are the constrain about x1 + x2 =50. So the point solution must be in red line
    (x + y =50).
    From the calculation of intersection point we get the P point is ≈ (7, 43). So we
    substitute in objective function : Z = 6000x1 + 4000x2
    So Z = 6000(7) + 4000(43) = 214000.

    Using the isophropyt line:

    d. Constrain function:
    x represent the number of radio that will be production every week
    y represent the number of television that will be production every week
    x + 4y ≤ 2400
    x + 2y ≤ 1400
    x ≥ 250
    x ≥ 0, y ≥ 0
    Objective function: maximize the f(x,y) = 1x + 2y (in 100.000)

    Solution
    x + 4y = 2400
    x + 2y = 1400 -
    2y = 1000
    y = 500
    x + 4y = 2400
    x + 4(500) = 2400
    x + 2000 = 2400
    x = 400
    (x,y) = (400,500)
    The graph like this :

    The points that we get from the graph is:


    A(250,537.5) → f(250,537.5) = 1(250) + 2(537.5) = 1325 (in 100.000)
    B(400,500) → f(400,500) = 1(400) + 2(500) = 1400 (in 100.000) →maximum
    value
    C(1400,0) → f(1400,0) = 1(1400) + 2(0) = 1400 (in 100.000) →maximum value

    There are 2 same solution because between the objective function and the constrain
    of limit time testing have same gradien.

    Using isophropyt line we will see like this

    You might also like