Saturday
April 19, 2014

Homework Help: linear programming

Posted by nmh on Friday, July 8, 2011 at 2:52pm.

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.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

math - Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 x...
MATH - 1. Maximize z = 16x + 8y subject to: 2x + y ≤ 30 x + 2y ≤ 24 ...
Math - Solve this linear programming problem using the simplex method: Maximize ...
linear programming - Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y...
math - Maximize P = 2x − 3y subject to x + 2y ≤ 14 6x + y ≤ ...
Linear Programming - Maximize P = 16x + 80y subject to these constraints: 2x + ...
algebra 1 - (2x-1)/3 +3≤-4 or (8x-2)/2 -1≥6 a. x≤-10 or x&#...
math - Maximize and minimize p = x + 2y subject to x + y ≥ 8 x + y ≤...
maths-Linear inequations - Find the solution (feasible) of following inequations...
math (double checking) - I've posted this question before but I forgot to say ...

Search
Members