Solve the following Linear Programming Problems graphically:
1. Maximize Z = 3x + 4y subject to the constraints: x + y ≤ 4, x ≥ 0, y ≥ 0.
Solve the following Linear Programming Problems graphically:
1. Maximize Z = 3x + 4y subject to the constraints: x + y ≤ 4, x ≥ 0, y ≥ 0.
-
1 Answer
-
Maximise
Subject to the constraints:
The corresponding equation of the above inequality are
The graph of the given inequalities.
The shaded region OAB is the feasible region which is bounded.
The corresponding of the corner point of the feasible region are O (0,0), A (4,0), and B (0,4).
The value of Z at these points are as follows,
Corner point
O (0,0) 0
A (4,0) 12
B (0,4) 16
Therefore the maximum value of Z is 16 at the point B (0,4).
Similar Questions for you
= -8 (-3 + k)
For inconsistent
. (ii)
by using property
Adding (i) and (ii) we get 2l =
Given 2x + y – z = 3 . (i)
x – y – z = α . (ii)
3x + 3y + βz = 3 . (iii)
(i) x 2 – (ii) – (iii) – (1 + β) z = 3 - α
For infinite solution 1 + β = 0 = 3 - α
=> α = 3, β = -1
So, α + β - αβ = 5
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 65k Colleges
- 1.2k Exams
- 687k Reviews
- 1800k Answers