Minimise Z - 3x - 2ysubject to the constraints- x - y - 8 - 1 3x - 5y - 15 - 2 x - 0- y - 0 - 3-

Let us graph the inequalities #160;(1)(1) #160;to #160;(3)(3) #160;(Fig).From Fig, you can see that #160;there is no point satisfying all the #160;c ...

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Byju's Answer

Standard XII

Mathematics

Types of Linear Programing Problems

Minimise Z ...

Question

Minimise $Z = 3 x + 2 y$
subject to the constraints:
$x + y \geq 8 . . . (1)$
$3 x + 5 y \leq 15 . . . (2)$
$x \geq 0, y \geq 0 . . . (3)$ .

Open in App

Solution

Let us graph the inequalities (1)
to (3) (Fig).
From Fig, you can see that there is no point satisfying all the constraints simultaneously. Thus, the problem is having no feasible region and hence no feasible solution.

Suggest Corrections

Similar questions

Q. Minimise

Z = 3 x + 2 y

subject to constraints:

x + y \geq 8

3 x + 5 y \leq 15

x \geq 0, y \geq 0

Q. Minimise and maximise

z = 5 x + 2 y

subject to the following constraints :

x - 2 y \leq 2

3 x + 2 y \leq 12

- 3 x + 2 y \leq 3

x \geq 0, y \geq 0

Q. Solve the following linear programming problem graphically :
Minimise

Z = 200 x + 500 y . . . (1)

subject to the constraints:

x + 2 y \geq 10 . . . (2)

3 x + 4 y \leq 24 . . . (3)

x \geq 0, y \geq 0 . . . (4)

Maximize Z = 3x + 2y, subject to constraints are $x + 2 y \leq 10, 3 x + y \leq 15 a n d x, y \geq 0$ .

Maximize $Z = 5 x + 3 y$ , subject to constraints $3 x + 5 y \leq 15, 5 x + 2 y \leq 10, x \geq 0$ and $y \geq 0$ .

Join BYJU'S Learning Program

Minimise Z=3x+2ysubject to the constraints:x+y≥8...(1)3x+5y≤15...(2)x≥0,y≥0...(3).

Let us graph the inequalities (1)(1) to (3)(3) (Fig).From Fig, you can see that there is no point satisfying all the constraints simultaneously. Thus, the problem is having no feasible region and hence no feasible solution.

Minimise $Z = 3 x + 2 y$
subject to the constraints:
$x + y \geq 8 . . . (1)$
$3 x + 5 y \leq 15 . . . (2)$
$x \geq 0, y \geq 0 . . . (3)$ .

Let us graph the inequalities (1)
to (3) (Fig).
From Fig, you can see that there is no point satisfying all the constraints simultaneously. Thus, the problem is having no feasible region and hence no feasible solution.