EduFarming
Your list · 0हिं

Type at least two letters. Press Esc to close.

↑↓ navigate↵ openTAB cycle filter

Linear Programming · Question 29 of 59

The shaded region in the figure is the feasible region for x + y ≤ 4, x + 3y ≤ 6, x ≥ 0, y ≥ 0.

Question 29

EasyOriginal question

The shaded region in the figure is the feasible region for x+y≤4,x+3y≤6,x≥0,y≥0x + y \le 4, x + 3y \le 6, x \ge 0, y \ge 0. What is the maximum value of Z=3x+2yZ = 3x + 2y?

The feasible region, shaded, is a polygon with corners (0, 0), (0, 2), (3, 1), (4, 0), bounded by the lines x + y = 4, x + 3y = 6 and the axes.
Options for question 29

Show the answer and explanation
CorrectNot quiteAnswer D

Correct answer: D

Explanation

  1. The corner points of the feasible region are (0,0)(0, 0), (0,2)(0, 2), (3,1)(3, 1), (4,0)(4, 0).

  2. Values of ZZ: 00 at (0,0)(0, 0), 44 at (0,2)(0, 2), 1111 at (3,1)(3, 1), 1212 at (4,0)(4, 0).

  3. The region is bounded, so the maximum is the largest of these: 1212, at (4,0)(4, 0).

Worth noting

00 is the minimum, at the opposite end.

Concept
The corner-point method
Typical time
60 s
Your time
—
The rule this testsThe corner-point method
Practise this chapter →

Ten questions from Linear Programming, at your own pace.

Practise this chapter →

Ten questions from Linear Programming, at your own pace.