Solveeit Logo

Question

Mathematics Question on Linear Programming Problem and its Mathematical Formulation

Corner points of the feasible region determined by the system of linear constraints are (0,3),(1,1)(0, 3), (1, 1) and (3,0)(3, 0). Let z=px=qyz = px = qy, where p,q>0p, q > 0. Condition on pp and qq so that the minimum of zz occurs at (3,0)(3, 0) and (1,1)(1, 1) is

A

p=2qp = 2q

B

p=q2p = \frac {q}{2}

C

p=3qp = 3q

D

p=qp = q

Answer

p=q2p = \frac {q}{2}

Explanation

Solution

Given corner points are (0,3),(1,1),(3,0)(0,3),(1,1),(3,0)
z=px+qyz=p x+q y
At (3,0),z=3p(3,0), z=3 p
At (1,1),z=p+q(1,1), z=p+q
It is given that the minimum of zz occurs at (3,0)(3,0) and (1,1)(1,1)
3p=p+q\Rightarrow 3 p=p+q
2p=q\Rightarrow 2 p = q
p=q/2\Rightarrow p = q / 2