You are on page 1of 3



LINEAR PROGRAMMING Question 1 why is the term linear used in the name linear programming? QUESTION 2 Describes the steps which is follows in formatting in linear programming? QESTION 3 In the graph analysis of a linear programming model what occur when the slope of the objective function is same as the slope of the one constraint equation? QUESTION4 Summarize the steps for solving a linear programming model graphically? QUESTION 5 What are the advantages and limitations of linear programming methods? QUESTION 6 What constitutes the feasible solution area on the graph of linear programming model? QUESTION 7 How is the optimal solution point identify on the graph of a linear programming? QUESTION 8 Why does the coefficient of slack variable is equal to zero in the objective function?

Ans 3) Steps of Graphical method of solving linear programming: 1. Formulate the linear programming problem. 2. Each inequality in the constraints may be written as equality 3. Plot the constraint lines considering them as equations. 4. Identify the feasible solution region. 5. Locate corner points of the feasible region. 6. Calculate value of the objective function on the corner points. 7. Choose the point where the objective function has optimal value. It has the most favorable value of the objective function. (Largest value if objective function is to be maximized and the smallest value if it is to be minimized) Ans 4) Advantages 1. It helps in attaining the optimum use of productive factors. 2. It improves the quality of decisions. The individual who makes use of linear programming methods becomes more objective than subjective. 3. It also helps in providing better tools for adjustment to meet changing conditions. 4. It highlights the bottlenecks in the production processes. 5. Most business problems involve constraints like raw materials availability, market demand etc. which must be taken into consideration. Just we can produce so many units of product does not mean that they can be sold. Linear programming can handle such situation also. Limitations 1. In some problems objective functions and constraints are not linear. LPP under non linear condition usually results in an incorrect soIution 2. LPP deals with problems that have a single objective. Real life problem may involve multiple objectives. 3. Parameters appearing in the model are assumed to be constant. But in real life situation they are neither constant nor deterministic.

4. It is applicable to only static situations since it does not take into account the effect of time. 5. LPP cannot be used efficiently for large scale problems, the computational difficulties are enormous, even when the large digital computer is available. 6. LPP may get fractional valued answers for the decision variables, whereas it may happen that only integer values of the variable are logical.

Ans 6)

The intersection set of all half-planes is formed by the constraints which determine a site. This site is called the validity region or area of feasible solutions.