Answer all questions. Or I will dislike your answer

1. What are the basic assumptions in linear programming? 2. Why is it called 'linear' programming? 3. If in the graphical approach indicated in this chapter, the line of objective function is paralle to the line corresponding to one of the constraints, what is the effect? 4. What are the limitations of using the graphical approach to the solution of linear programmin problems? 5. Typical linear programming has one objective function. But, in many practical situations there could be more than one objective. How can one take care of such a situation? Explain b means of an example. 6. What is 'shadow price'? How would you use the information? 7. Can you solve the following linear programming problem? Maximise P = 109 +9r 59 +48 5 14 49 +5r59 79 - 9rs II 8. In a linear programming problem, is it necessary to have at least as many constraints as th number of decision variables? Explain. 9. Will topology' be useful in linear programming? How? 10. Check up on the dynamic programming approach in other literature. Note its basic premise and utility in production and operations management