EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 49 of 59

Question 49

MediumOriginal question

What can be said about the problem: maximise Z=x+yZ = x + y subject to x+y≤2x + y \le 2, x+y≥5x + y \ge 5, x≥0x \ge 0, y≥0y \ge 0?

Options for question 49

Show the answer and explanation
CorrectNot quiteAnswer C

Correct answer: C

Explanation

  1. No point can have x+yx + y at most 2 and at least 5 at the same time.

  2. So the feasible region is empty and the problem has no solution at all.

Concept
An infeasible problem
Typical time
90 s
Your time
—
The rule this testsUnbounded and infeasible problems
Practise this chapter →

Ten questions from Linear Programming, at your own pace.

Practise this chapter →

Ten questions from Linear Programming, at your own pace.