Teaching DSSSB TGT Mock Test 2025 Mathematics Linear Programmig Problem

Maximize Z = 15X₁ + 20X₂ subject to

12X₁ + 4X₂ ≥ 36

12X₁ – 6X₂ ≤ 24

X₁, X₂ ≥ 0
The above linear programming problem has

1

infeasible solution

2

unbounded solution

3

alternative optimum solutions

4

degenerate solution

Share: WhatsApp Telegram X

Sponsored

hivanix.in

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