BITSAT2023MathematicsLinear ProgrammingActual

The maximum value of z=5 x+2 y subject to constraints x+y 7, x+2 y 10, x, y 0

Options

Correct 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 .

Practice Linear Programming on Quantrex Academy →

More from Linear Programming

If the number of available constraints is 3 and the number of parameters to be optimise is 4 , then 2024 Minimum value of Z=3 x+5 y subject to constraints x+y 2, x+3 y 3, x, y 0 2023 The maximum value of z=6 x+8 y subject to constraints 2 x+y 30, x+2 y 24 and x 0, y 0 is 2020 The maximum value of Z = 4 x + 2 y subject to constraints 2 x + 3 y ≤ 18 , x + y ≥ 10 and x , y ≥ 0 is 2018 The coordinates of the point at which minimum value of Z = 7 x - 8 y subject to constraints x + y - 20 ≤ 0 , y ≥ 5 , x ≥ 0 , y ≥ 0 is attained, is 2018 Minimise Z= _ j=1 ^ n _ i=1 ^ m c_ i j x_ i j Subject to _ i=1 ^ m x_ i j =b_ j , j=1,2, , n _ j=1 ^ n x_ i j =b_ j , i=1,2, , m is a L P P with number of constr 2015 Consider x 2 + y 4 1 and x 3 + y 2 1, x, y 0 . Then number of possible solutions are : 2014 A shopkeeper wants to purchase two articles A and B of cost price 4 and 3 respectively. He thought that he mayearn 30 paise byselling article A and 10 paise by selling article B . 2013 Full Linear Programming list All BITSAT PYQs