Scribd
Upload
31 views7 pages

Xii CH12 Practice Question

It helps you

Uploaded by

lamok.2212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
31 views7 pages

Xii CH12 Practice Question

It helps you

Uploaded by

lamok.2212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Linear Programming Problems ‘The term ’Programming’ means planning and it refers to a particular plan of actions from amongst several alternatives for maximizing profit or minimizing cost etc. The term ‘Linear’ means that all inequations or equations used and the function to be maximized or minimized are linear. So, linear programming deals with the optimization (maximization or minimization) of a linear function of a number of variables subject to a number of conditions on the variables, in the form of linear inequations or equations in variables involved. Few important terms related to LPP : Objective function: or minimized according to a set of given conditions, is called as linear objective function. Variables x and y A linear function 2 = ax + by, (where a and b are constants) which has to be maximized are called Decision variables. Constraints: The restrictions in the form of linear inequalities on the variables of linear programming problems are called constraints. The condition x >= 0 y >= 0 are called non-negative constraints. Solution: A set of values of variables x, y which satisfies the constraints of LPP, is called a solution of LPP. Feasible Solution: A set of values of the variables x, y is called a feasible solution of a LPP, if it satisfies the constraints and non-negati ty restrictions of the problem. Infeasible Solution: If the system of constraints has no point which satisfies all the constraints and non- negativity restrictions. Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region. Theorem 2 Let R be the feasible region for a linear programming problem, and let, 2 = ax + by be the objective function. If R is bounded , then the objective function Z has both a maximum and a minimum value on R and each of these occurs at a corner point (vertex) of R. 105 If Ris unbounded, then a maximum or a minimum value of the objective function may not exist. However, if it exists, it must occur at a corner point of R. Solving linear programming problem using Corner Point Method. The method comprises of the following steps: > Find the feasible region of the linear programming problem and determine its corner Points (vertices) either by inspection or by solving the two equations of the lines intersecting at the point. > Evaluate the objective function Z=ax+ by at each corner point. Let M and m, respectively denote the largest and smallest values of these points. (1) When the feasible region is bounded, M and m are the maximum and minimum value of Z. (lt) In case, the feasible region is unbounded, we have: {a) Mis the maximum value of Z, if the open half plane determined by ax+ by > M has no point in common with the feasible region Otherwise, Z has no maximum value. {(b) Similarly, m is the minimum value of Z, if the open half plane determined by ax+ by 0. The condition on p and q so that the minimum of Z occurs at (3,0) and (1,1) is 106 (a) p=2q (b) p=q/2 (c) p=3q 4, The feasible region satisfied by the constraints X+YS5,XS4, YEA, X20, y20, SxFy25, xH6y26 is bounded by (a)4 straight lines (b) Sstraight lines (c) 6 straight lines (d) 7 straight lines 5. For the following feasible region, the linear constraints are: x 2 0,7 2 0, 3x + 2y $ 12, x+3y $11 (a) x2 0,y 2 0,3x+42y 2 12,x+3y 211 (b) x 20,y 2 0,3x+2y< 12,x43y 211 (c) x20, 20,3x+2y $12,x43y S11 (d) None of these 6. Based on the given shaded region as the feasible region in the graph, at which point(s) is the objective function Z = 3x + 9y maximum? 107/19 a 7 vv (a) Point 8 {b) Point — (c) Every point on line segment CD (d) Point D 7. In the given graph, the feasible region for a LPP is shaded. The objective function Z = 20x + 10y, will be minimum at: (a) (15,0) (b) (40,0) (c)(4,18) (d)(6,12) 8. Corner points of the feasible region for an LPP are (0,2), (3,0), (6,0), (6,8) and (0,5). Let Z = 4x + 6y be the objective function. The minimum value of Z occurs at: {a) (0,2) only —_—_(b) (3,0) only _(¢) The mid-point on the line segment joining the point (0,2) and (3,0) only —_(d)Any point on the line segment joining the points (0,2) and (3,0). 9. The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below. Which of the following is not a constraint to the given Linear Programming Problem? (a) x+y22_ (b)x+2ys10 (c)x-y2t— (d) wy st 10. The comer points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function 2 = 4x + 6y occurs at \ 108/19 a ‘ 7 v (a)(0.6, 1.6) only (b) (3, 0) only (c) (0.6, 1.6) and (3, 0) only (d) at every point of the line-segment joining the points (0.6, 1.6) and (3, 0) SA (This section comprises of short answer type questions of 3 marks each) 11. Solve the following Linear Programming Problem graphically: Minimize: x+2y, subject to the constraints: x + 2y 2100, 2x-ys0, 2x +y $200, xy20 12. Solve the following Linear Programming Problem graphically: Maximize: z= -x+2y subject to the constraints: x23, x +y 25, x +2y 26, y20 13. Solve the following Linear Programming Problem graphically: 108 Maximize Z = 400x + 300y subject to x+y $200, x < 40, x2 20, 20 14, Solve the following Linear Programming Problem graphically Minimize 2=5x + 10y subject to x + 2y $120, x+y 2 60, x-2y20, x20, y20 15. Solve the following Linear Programming Problem graphically: Maximize Z = 3x + 9y subject to the constraints x + y 210, x +3y $60, xsy, x20, ¥20 McQs(Answers) 1.(b) 2.(d) 3.(b) 4.(b) 5.(c) 6.() 7.) 8&.(d) 9.(c) 10.(d) 11. Minimize: z = x + 2y , subject to the constraints: x + 2y 2100, 2x -ysO, 2x +y $200, x,y20 109/19 a 7 vv Corner Point Zexady ‘A(0,50) 100 Min 8(20,40) 100 Min (50,100) 250 (0,200) 400 The minimum value of Zs 100 at all the points on the line segment joining the points A(0,50) and (20,40) 12. Maximize: xy, subject to the constraints: x23, x +y 25, x +2y 26, y20 109 Corner Point ‘A(3,2) (may or may not be the maximum value) 84,1) (6,0) 6 Since the feasible region is unbounded, 2=1 may or may not be the maximum value. Now, we drawg the graph of — x#2ye1 and we check whether the resulting open half-plane has any point/s, in common with the feasible region or rot. Here, the resulting open half plane has points in common with the feasible region. Hence, Z =1 is not the maximum value. We conclude, Z has no maximum value 13, We have Z= 40x +300y, subject to x + y < 200, < 40, x2 20, y 20. The corner points of the feasible region are {20,0}, 0(40,0), 8(40,160), A(20,180) Corner Point 2 = 400x + 300y A(20,180) 62000 5(40,160) 64000 maximum 110/19 C(20,0) 8000 (40,0) 16000 7 Maximum profit occurs at x= 40, y=160 and the maximum profit = Rs 64,000 14. We have minimize Z= 5x+ 10y subject to x+2y $120, x +y260, x-2y20, x20, y20 Comer Point A(40,20) (60,0) €(120,0) (60,30) 15. We have maximize Z= 3x +9y subject to the constraints x + y 210, x +3y <60, xsy, x20,720 Corner Points ‘A(0,20) (0,10) 90 15.5) 60 (45,15) 180 max So, Z na= 180 at infinitely many points lying on the line joining points (0,20) and (15,15).

You might also like