Ask a New Question

Asked by Brian

Solve the linear programming problem by the method of corners.

Find the minimum and maximum of
P = 3x + 2y subject to

3x + 5y ≥ 20
3x + y ≤ 16
−2x + y ≤ 2
x ≥ 0, y ≥ 0

The minimum is P =
at (x, y) =
8 years ago

Answers

Answered by Damon
I think you can do them all as standard linear programming problems. I gave you a link below. I do not know any method OTHER than by corners.
8 years ago

Related Questions

how do i do linear programming in algebra 2? set up the linear programming problem. Do not solve. A brewery manufactures three types of beer-lite... Solve this linear programming problem using the simplex method: Maximize P = 21x + 12y + 24z subj... Solve the linear programming problem by the method of corners. Minimize C = 3x + 7y subject to... solve this linear programming problem; A chain saw requires 4 hours of assembly and a wood chipp... Solve the linear programming problem by the method of corners. Minimize C = 5x + y subject to... Solve the linear programming problem by the simplex method. Maximize P = 10x + 6y subject to x + y... Solve the linear programming problem by the simplex method. Maximize P = 5x + 4y subject to 3x + 5... Solve the linear programming problem by the simplex method. Maximize P = 27x + 27y + 36z subject t... Solve the linear programming programing by graphing and then determining which vertex minimizes the...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use