Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming

Consider the following linear programming problem (LPP)

Maximize Z = 5x1 + 3x2

Subject to

x1 – x2 ​≥ 2

x1 + x2 ≥ 3

x1, x2, ≥ 0

the LPP has

1
Unique solution
2
No solution
3
Two solution
4
Unbound solution
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