Linear Programming «1 oor 29 OBJECTIVE QUESTIONS: (1) Fillin the blanks with appropriate words given below: a (a) (b) © (d) (3) (h) variables); (d - Constraints); (e - less than); ——___ are the entities whose values are to be determined from the solution of the LPP. (i) Objective function (ii) Decision Variables (iii) Constraints (iv) Opportunity costs specifies the objective or goal of solving the LPP. (i) Objective function (ii) Decision Variables (iii) Constraints (iv) Opportunity costs Objective function is expressed in terms of the (i) Numbers (ii) Symbols (iii) Decision Variables are the restrictions or limitations imposed on the LPP. (i) Variables (ii) Costs (iii) Profits (iv) Constraints The type of constraint which specifies maximum capacity of a resource is‘ or equal to’ constraint. (i) Less than (ii) Greater than (iii) Less than or greater than In linear programming, represents mathematical equation of the limitations imposed by the problem. (April 19) (i) Objective function (ii) Decision: variable (iii) Redundancy (iv) Constraints ‘As for Maximization type problem in LPP, the objective is to maximize the. (i) Profit (ii) Resources (iii) Cost (iv) Time The mathematical model of an LPP problem is important because. (i) It helps in converting the verbal description & numerical data into mathematical expression (ii) (ii) Decision-makers prefer to work with formal models Gii) It captures the relevant relationship among decision factors (iv) It enables the use of algebraic technique (a - Decision variables); (b - Objective function); (c - decision Constraints); (g - Profit); (h ~ It helps in converting the verbal description & numerical data into mathematical expression)) True or False: (a) The limitations imposed on a LPP are called as Decision Variables. (b) The objective function of a LPP is Max Z if profit per unit is given for decision variables. (©) When the maximum capacity of the resources is given, the sign of the constraint is ‘greater than or equal to’. (d) A ‘less than or equal to’ constraint means the highest possible limit of resource utilization is given. Scanned with CamScannerVipul’s™ Operations Research (8M: i ) _ ror (e) In a LPP, Deci relationship with Resources: : . (A linear programming model consists of only decision variables an, a constraints. (Oct. 19) [Ans.: (a — False); (b ~ True); (c~ False) (2)__ Match the followin, sion Variables are always assumed to have a Tineas| (d= True); (¢- True); (f - False)) @ Min.Z (ii) Less than or equal to constraint Gi) more than or equal to constraint (a) Maximum capacity (b) Minimum requirement (©) Linear relationship of variables (@) Profit data Gv) LPP (©) Cost data (w)_Max.Z TAns.: (a — ii); (b — iii); (c— iv); (d- 0); (e- 9) THEORY QUESTIONS: | (2) Explain the concept of linearity in linear programming. ‘Ans. In LPP, it is assumed that the production or output is directly proportional to availability of resources or input. Mathematically, we can say that Y = f(X) ie. Y (output) is a linear function of X (input). Y is the dependent variable and X is the independent variable. If we represent this equation on a graph showing output at various levels of input, the result will be a straight line. Y (Output) X (Resources) In other words, the output will increase or decrease in the same proportion of increase or decrease of resources, i.e. if resources are increased by 50%, output will increase by 50%. (2) Explain what is meant by decision variables, objective function "4 constraints in linear programming. ‘Ans.: Decision variables: Decision variables are entities (e.g. products) who values or quantity is to be determined from the solution of the LPP. Hence, thes are the unknowns in the problem. Decision variables are represented by Xr etc. a Scanned with CamScanner2 Vipul’s™ Operations f 68 rw" *Se2rch yy The iso-profit line is exacly pavallel 10 Poundary BC. Heng, Point on line BC will give Optimal solution. y OBJECTIVE QUESTIONS: ; (1) Fillin the blanks with appropriate words given below: (a) The region of feasible solution in LPP graphical method is caleg Gi) Infeasble region (i) Unbounded region Gi) Infinite jay (iv) Feasible region (6) When itis not possible to find solution in LPP, it is called as cggy (i) Unknown solution (ii) Unbounded solution (iii) Infeasible Solutieg (iv) Improper solution . (©) When the feasible region is such that the value of objective func can extend to infinity, it is called a case of . () Infeasible solution (ii) Alternate optimal (iv) Unique solution Unbounded solutin (4) When the constraints are a mix of ‘less than’ and ‘greater than itisa problem having (i) Multiple constraints (ii) Infinite constraints (iii) Infeasible constraints (iv) Mixed constraints (e) Incase of an‘, : constraint, the feasible region is a straight lin. (@ less than or equal to (ii) greater than or equal to (iii) mel (iv) equal to (f)_Ininear programming, unbounded solution means April 19 (i) Infeasible solution (ii) Degenerate solution (ii) Infinite solutis (iv) Unique solution (g) Graphical method can ve applied for to solve LLP when there are oo variable. (i) One (ii) More than One (i Two liv) Three If the feasible region of a LLP is empty, the solution is (i) Infeasible (i) Unbounded (iti) Alternative (iv) Restricted If in a LPP, the solution of a variable can be made infinity" without violating the constrains, the solution is (i) infeasible (i) Unbounded (ii) Alternative (iv) Feasible ; 7 casi (While solving a LPP Graphically, the area bounded by constaif® called (h) (i) (@ Feasible region (ii) Infeas (iv) Restricted Region wo fAns.: (a ~ Feasible region); (b ~ Infeasible solution); (c - Unboi” solution); (d - Mixed constraints), fe menel Egan sotntion! (g- Two); (h~ Infeasible); (i— Unbounded); j - Feasible Region] * ioe ible region (iii) Unbounded "6 Scanned with CamScannerLinear Programming - It 69 (2) -True or False: (a) In LPP, graphical method can be used only for a two variables problem. (b) Optimal solution to a LPP always exists at one of the corners of the Feasible region. (0 The feasible region of solution may not satisfy the conditions imposed by all the Constraints of the problem. (d) In case of a ‘less than or equal to’ constraint, the Feasible region of solution is outside the constraint line. (ec) Ina ‘greater than or equal to’ constraints the Feasible Region of solution lies inside the constraints line. (© In graphical method of LPP, the optimum value occurs anywhere in feasible region. (Oct. 19) [Ans.: (a - True); (b - True); (c- False); (d - False); (e - False); (f - False)] (3). Match the following: Group ‘A’ Group ‘BY (@) Feasible region ‘|@ Solution is outside the constraint line Region of feasible solution (b) Less than or equal to constraint (O Greater than or equal to constraint No feasible solution possible (d)__Iso-profit or Iso-cost line Solution is inside the constraint (e) _Infeasible solution line (@ Redundant Constraint in| (v)._ Line representing the objective Graphical (Oct. 19) function (vi) Does not affect the feasible region [Ans.: (a — ii); (b - iv); (c - i); (d - v); (e- ii); F- vi)] THEORY QUESTIONS: (1) What is meant by feasible region of solution in LPP graphical method? ‘Ans: The feasible region of solution means that part of graphical solution which satisfies all the constraints of the problem. There may be different types of constraints in the problem eg. S, 2 etc. The feasible region is the common region to all constraints. To find the feasible region, we should eliminate all those parts of the solution which are not common to all constraints. The remaining region is the one that is feasible region of solution. Type of constraint Location of feasible region s Inside the constraint line 2 Outside the constraint line = On the constraint line Scanned with CamScanner