MATH

posted by .

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 the objective function z = 16x + 8y.

  • MATH -

    The corner points are, by inspection:
    (0,30),(0,12), (15,0), (24,0),
    and (12, 6)[inters. of the two lines].
    The points in italics do not satisfy at least one constraint.
    Now evaluate the objective function at each of the feasible corner points and select the one that maximizes the objective function.
    If there are two points that give the same maximum value of the objective function, then any point that lie on the line joining the two points and is located between the two points maximizes the objective function.

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

    Minimize z = 3x + 6y subject to: 4x + y ?
  8. math

    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 …
  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