(a) What are the different graphical methods to solve a linear programming problem? Briefly describe the steps needed in each method.
(b) What is an infeasible linear programming problem? How do we find if a given linear programming problem is infeasible? Give a real world example of an infeasible linear programming problem.
(c) Define the slack and surplus variables. What do they represent? What is (are) the difference(s) between a slack and a surplus variable?
(d) Briefly describe the important parts of each step needed to make a decision using decision sciences models.