Q1.Why is the term linear used in Linear programming? A1.

A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints.The term linear is used in Linear programming because it does not contain x3, cosines, x*y, etc. Standard Form Linear programs are written the following way: Max 3x + 4y s.t. x + y < =10 x + 2y < = 12 x > =0 y > =0 Q2.Describe the steps one should follow in formulating linear programming model. A2. Step 1. It is always good to place all information in a table format, if it is not given to you, to better understand the problem. 2. List the constraints. 3. Decide what the decision variables are going to be. 4. Determine the objective function. 5. Develop equations for the numerical valued constraints (i.e. constraints with or signs). 6.Write out the full LP problem and include the subject to statement and the desired sign of the decision variables.

Q3.Summarise the steps for solving a linear programming model graphically. A3.The graphical method can be used to solve any linear programming problem having only two decision variables. The method uses the following steps: 1. Draw the constraint boundary line for each functional constraint. Use the origin (or any point not on the line) to determine which side of the line is permitted by the constraint. 2. Find the feasible region by determining where all constraints are satisfied simultaneously. 3. Determine the slope of one objective function line. All other objective function lines will have the same slope. 4. Move a straight edge with this slope through the feasible region in the direction of improving values of the objective function. Stop at the last instant that the straight edge still passes through a point in the feasible region. This line given by the straight edge is the optimal objective function line. 5. A feasible point on the optimal objective function line is an optimal solution. Q4.In a graphical analysis of a linear programming model what occurs when the slope of the objective function is same as the slope of one of the constraint equation.

Q5.What are the benefits and limitations of the graphical method for solving np problems? Q6.What constitutes the feasible solution area of a graph of a lp model? Q7.How is the optimal identified on the graph of a lp model? Q8.Why does the coefficient of a slack variable equal to zero in the objective function?