Consider the following Linear Programming problem: Maximise Z = -x 1 + 2x 2 subject to the constraints: x 1 - x 2 ≤ -1, -0.5x 1 + x 2 ≤ 2, x 1 , x 2 ≥ 0. Then the above problem has:

Question

Mathematics · Linear Programming

Consider the following Linear Programming problem: Maximise Z = -x 1 + 2x 2 subject to the constraints: x 1 - x 2 ≤ -1, -0.5x 1 + x 2 ≤ 2, x 1 , x 2 ≥ 0. Then the above problem has:

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

multiple optimal solutions with Max Z = 4

Download Single Question PDF

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Share with Friends & Study Groups

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Preparing for Mathematics?

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Start Free Mock Test →

Chapter Practice

Want more practice questions on Linear Programming?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Linear Programming MCQs →

Recommended practice questions in Mathematics · Linear Programming

Browse More Mathematics →

1

Which of the following events is considered a major turning point that fueled Indian nationalism during British rule due to its brutal nature and widespread condemnation?

Solve Question→

2

Which of the following events is considered the first major peasant uprising against the British in India?

Solve Question→

3

Answer 1

no optimal solution

Answer 2

a unique optimal solution Max Z = 2 for x 1 = 0, x 2 = 1

Answer 3

multiple optimal solutions with Max Z = 4

Answer 4

a unique optimal solution Max Z = 4 for x 1 = 0, x 2 = 2

Consider the following Linear Programming problem: Maximise Z = -x 1 + 2x 2 subject to the constraints: x 1 - x 2 ≤ -1, -0.5x 1 + x 2 ≤ 2, x 1 , x 2 ≥ 0. Then the above problem has:

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Mathematics?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

Consider the following Linear Programming problem: Maximise Z = -x 1 + 2x 2 subject to the constraints: x 1 - x 2 &le; -1, -0.5x 1 + x 2 &le; 2, x 1 , x 2 &ge; 0. Then the above problem has:

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Mathematics?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

Consider the following Linear Programming problem: Maximise Z = -x 1 + 2x 2 subject to the constraints: x 1 - x 2 ≤ -1, -0.5x 1 + x 2 ≤ 2, x 1 , x 2 ≥ 0. Then the above problem has: