Multiple Choice Questions 51 1.Linear Programming technique is used to allocate scarce resources in an optimum manner in problems of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ? a) Schedule b) Product Mix c) Both A and B d) Servicing Cost 2.Allocation problems can be solved by a) Linear Programming Technique b) Non – Linear Programming Technique c) Both A and B d) None of the above Answers: 1. c) 2. c) www.cuidol.in Unit 7 (BBA 102 /BCM 102) All right are reserved with CU-IDOL
Multiple Choice Questions 52 3.The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐ a) Variables b) Constraints c) Functions d) All of the above 4.In converting a less-than-or-equal constraint for use in a simplex table, we must add a) A slack variable b) A surplus variable c) An artificial variable d) None of above Answers: 3.a) 4.a) www.cuidol.in Unit 7 (BBA 102 /BCM 102) All right are reserved with CU-IDOL
Frequently Asked Questions 53 Q.1 What is Linear Programming problem? Ans: Linear programming is an optimization technique for a system of linear constraints and a linear objective function. An objective function defines the quantity to be optimized, and the goal of linear programming is to find the values of the variables that maximize or minimize the objective function. Q.2 What do you understand by simplex method and graphical method of LLP? Ans: Simplex method, Standard technique in linear programming for solving an optimization problem, typically one involving a function and several constraints expressed as inequalities. The inequalities define a polygonal region (see polygon), and the solution is typically at one of the vertices.Graphical method, or Geometric method, allows solving simple linear programming problems intuitively and visually. This method is limited to two or three problems decision variables since it is not possible to graphically illustrate more than 3D. www.cuidol.in Unit 7 (BBA 102 /BCM 102) All right are reserved with CU-IDOL
REFERENCES 54 • Bland, Robert G. (1977). \"New Finite Pivoting Rules for the Simplex Method\". Mathematics of Operations Research. 2 (2): 103–107 • George B. Dantzig and Mukund N. Thapa. 1997. Linear programming 1: Introduction. Springer-Verlag. • Edmonds, Jack; Giles, Rick (1977). \"A Min-Max Relation for Submodular Functions on Graphs\". Studies in Integer Programming. Annals of Discrete Mathematics. 1. pp. 185–204. www.cuidol.in Unit 7 (BBA 102 /BCM 102) All right are reserved with CU-IDOL
55 THANK YOU For queries Email: [email protected] www.cuidol.in Unit 7 (BBA 102 /BCM 102) All right are reserved with CU-IDOL
Search
