Question

Solve the linear programming problem by the method of corners.

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

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

The minimum is P =  

at (x, y) =

The maximum is P =  

at (x, y) =

Answer 1

Method of corners includes drawing the feasible region of the linear programming problem and then finding the corners(extreme points) of the feasible region and then the maximum(if it exists) is the largest value of objective function at that corner. Similarly, the case for minimum goes!

Min value = 11.23 at B (1.15,3.31)

Max value = 26 at A(3,7)

if doubts still bug you, feel free to comment your query!