math

posted by .

Maximize z = 16x + 8y subject to:
2x + y ≤ 30
x + 2y ≤ 24
x ≥ 0
y ≥ 0
Graph the feasibility region.
Identify all applicable corner points of the feasibility region.
Find the point(s) (x,y) that maximizes the objective function z = 16x + 8y.

  • Linear Programming -

    If you rewrite the constraints in terms of y, for example,
    2x+y≤30 as
    y≤-2x + 30
    then you can graph the constraints.
    When y≤ something, then the feasible region is below the line, if y>0, the feasible region is above the line.
    For x≥0, it is on the right of the y-axis.

    What do you get for the corner points?

    Once you have the corner points in the form of (x,y), you can evaluate
    Z(x,y) in terms of x and y and hence compare the value of Z that maximizes its value.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Linear Programming

    Maximize P = 16x + 80y subject to these constraints: 2x + 20y ≤ 430 4x + 70y ≤ 1400 8x + 30y ≤ 980 10x + 10y ≤ 1000 4x + 30y ≤ 700 x ≥ 0, y ≥ 0 Maximum value for P = ?
  2. Math

    Use the simplex method to find the maximum value of P = 3x + 3y subject to these constraints: 3x + 2y ≤ 360 x - y ≤ 60 y ≤ 120 x ≥ 0, y ≥ 0 What is the maximum value of P?
  3. Math

    Solve this linear programming problem using the simplex method: Maximize P = 21x + 12y + 24z subject to these constraints: 3x + 2y + 3z ≤ 864 15x + 6z ≤ 1296 9x + 8y + 18z ≤ 4608 x ≥ 0, y ≥ 0, z ≥ …
  4. Math

    Maximize P = 16x + 80y subject to these constraints: 2x + 20y ≤ 430 4x + 70y ≤ 1400 8x + 30y ≤ 980 10x + 10y ≤ 1000 4x + 30y ≤ 700 x ≥ 0, y ≥ 0 Maximum value for P = ?
  5. linear programming

    Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 x ≥ 0 y ≥ 0 Graph the feasibility region. Identify all applicable corner points of the feasibility region. Find the point(s) (x,y) that maximizes the …
  6. linear programming

    Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y ≤ 20 x + y ≥ 10 x ≥ 0 y ≥ 0 Graph the feasibility region. Identify all applicable corner points of the feasibility region. Find the point(s) (x,y) that …
  7. MATH

    1. Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 x ≥ 0 y ≥ 0 Graph the feasibility region. Identify all applicable corner points of the feasibility region. Find the point(s) (x,y) that maximizes …
  8. math

    Minimize z = 3x + 6y subject to: 4x + y ?
  9. Algebra 2

    Can someone explain this inequality equation to me please?
  10. Algebra 2

    Jack is selling wristbands and headbands to earn money for camp. He earns $2 for each wristband and $3 for each headband. He wants to earn at least $50. He needs to sell at least 5 wristbands. Which system of inequalities is shown …

More Similar Questions