Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Mathematics Mathematics Linear Programmig Problem
A dealer wishes to purchase toys \(A\) and \(B\). He has Rs. \(580\) and has space to store \(40\) items. \(A\) costs Rs. \(75\) and \(B\) costs Rs. \(90\). He can make profit of Rs. \(10\) and Rs.\(15\) by selling \(A\) and \(B\) respectively assuming that he can sell all the items that he can buy formulation of this as L.P.P. is
1
Maximize \(z=10x+15y\)
Subject to \(x+y\le 40,75x+90y\le 580,x\ge 0,y\ge 0\)
2
Maximize \(z=10x+15y\)
Subject to \(x+y\ge 40,x\ge 0,y\ge 0,75x+90y\ge 580\)
3
Maximize \(z=15x+10y\)
Subject to \(x+y\le 40,75x+90y\le 580,x\ge 0,y\ge 0\)
4
Maximize \(z=10x+15y\)
Subject to \(x+y\ge 40,75x+90y\le 580,x\ge 0,y\ge 0\)