EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 51 of 59

Question 51

MediumOriginal question

For x+2y≥6x + 2y \ge 6, x≥0x \ge 0, y≥0y \ge 0, what is the minimum of Z=x+3yZ = x + 3y?

Options for question 51

Show the answer and explanation
CorrectNot quiteAnswer C

Correct answer: C

Explanation

  1. The corners of this unbounded region are (6,0)(6, 0) and (0,3)(0, 3), with Z=6Z = 6 and Z=9Z = 9.

  2. The half-plane x+3y<6x + 3y < 6 has no point in common with the region, so the minimum is 6.

Worth noting

0 is at the origin, which is not in the region.

Concept
Minimum over an unbounded region
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.