Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Mathematical Science LPP, Simplex Methods, Duality

Consider the following Linear programming problem (LPP):

Maximize z = x1 + x2

Subject to the constraints:

x1 + 2x2 ≤ 2000

x1 + x2 ≤ 1500

x2 ≤ 600

and x1, x2 ≥ 0

The solution of the above LPP is:

1
x1 = 750, x2 = 750, z = 1500
2
x1 = 500, x2 = 1000, z = 1500
3
x1 = 1000, x2 = 500, z = 1500
4
x1 = 900, x2 = 600, z = 1500
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters