The following LPP

Maximize z = 100x1 + 2x2 + 5x3

Subject to

14x1 + x2 − 6x3 + 3x4 = 7

32x1 + x2 − 12x3 ≤ 10

3x1 − x2 − x3 ≤ 0

x1, x2, x3, x4 ≥ 0

has

This question was previously asked in
UGC NET Computer Science (Paper 2) July 2018 Paper
View all UGC NET Papers >
  1. Solution: x1 = 100, x2 = 0, x3 = 0 
  2. Unbounded solution
  3. No solution
  4. Solution: x1 = 50, x2 = 70, x3 = 60

Answer (Detailed Solution Below)

Option 2 : Unbounded solution
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
50 Qs. 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The unbounded feasible solution can not be determined, instead there are infinite many solutions.

Therefore option 2 is correct.

Latest UGC NET Updates

Last updated on Jul 7, 2025

-> The UGC NET Answer Key 2025 June was released on the official website ugcnet.nta.ac.in on 06th July 2025.

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

Hot Links: teen patti gold downloadable content teen patti rich teen patti 3a teen patti live