MATHINNOVATIONSONLINE.COM Test / Exam Name: Lpp Test Standard: 12th Science Subject: Mathematics Student Name: Section: Roll No.. Questions: 14 Time: 01:00 hh:mm Marks: 30 QA. Objective function of a LPP. is: Mark 1. Aconstant 2. Afunction to be optimised 3. Arelation between the variables 4. None of these {Q2. The number of constraints allowed ina linear program is which of the following? Mark A. Less than 2. Less than 72 3. Less than 512 4, Less than 1,024 5. Unlimited Q3. In linear programming, objective function and objective constraints are 1 Mark 1. Solved 2.Linear 3. Quadratic 4, Adjacent 'Q4, The corner points of the feasible region determined by the system of linear inequalities are (0,0), (4, 41 Mark 0), (2,4) and (0,5). f the maximum value of 2= ax + by, where a, b> 0 accurs at both (2,4) and (4, 0), then: QS. Choose the correct answer from the given four options. 1 Mark ‘The feasible solution for a LPP is shown in, Let 2 = 3x -4y be the objective function. Maximum of Z occurs at 16,0) 2.(6,5) 3.(6,8) 4.(4, 10), Q6. The objective function of LPP defined over the convex set attains its optimum value at. 1 Mark 1. Atleast two of the corner points 2. All the corner points.3. Atleast one of the corner points 4, None of the corner points, 7. The feasible solution for @ LPP is shown in the following figure. Let 2 = 3x-- Ay be the objective function, obo Minimum of Z occurs at 1.00) 2. (0,8) 3.(5,0) 4.(4,10) 8. The corner points of the feasible region determined by the system of linear constraints are (0,10), (5, 5), (15,15), (0, 20). Let z= px+ ay where p, q> 0. Condition on p and q so that the maximum of 2 ‘occurs at both the points (15, 15) and (0,20) is 1.g=2p 4.q=3p (9. The region represented by the inequation system x, y> 1. unbounded in ist quadrant 2. unbounded in first and second quadrants 3. bounded in first quadrant 4, none of these ¥S6,x+y <3 010. Ifthe constraints in linear programming problem are changed. 1. The problem is to be re - evaluated 2, Solution is not defined 3. The objective function has to be modified 4. The change in constraints is ignored 1. Find graphically, the maximum value of z = 2x |. Sy, subject to constraints glven below: 2e+dy<8 Be+y<6 rtys4 z>0y>0 12. Solve the folowing linear programming problem graphically Minimise z ~ 3x + By (13. Maximise 2 +y,subjecttox—y <1, —x+y<0,xy>0. 14. Minimise 2= + 2y subject to 2x +y > 3, x-2y>6, x, y>0. Show that the minimum of Z occurs at more than two points. A Mark a Mark A Mark A Mark 5 Marks 5 Marks 5 Marks 5 Marks