Question
The maximum value of z=5 x+2 y subject to constraints x+y 7, x+2 y 10, x, y 0
BITSAT
Mathematics
Linear Programming
2023
BITSAT 2023 (Memory Based Paper 1)
BITSAT Mathematics Question (2023) — Solution
Options
- A. 10
- B. 26
- C. 35
- D. 70
Answer
C. 35
Step-by-step solution
Change the inequalities into equations and draw the graph of lines, thus we get the required feasible region as shown below. The region bounded by the vertices A(0,5), B(4,3), C(7,0) The objective function is maximum at C (7,0) and Max z=5 7+2 0=35.
Related: Mathematics — Linear Programming · All PYQ Banks