2.Explain the concept and computational steps of the simplex method for solving linear programming problems. How would you identify whether an optimal solution to a problem obtained using simplex algorithm is unique or not? a)What is the difference between a feasible solution, a basic feasible solution, and an optimal solution of a linear programming problem? b)What is the difference between simplex solution procedure for a `maximization’ and a `minimization’ problem? c)Using the concept of net contribution, provide an intuitive explanation of why the criterion for optimality for maximization problem is different from that of minimization problems. Outline the steps involved in the simplex algorithm for solving a linear programming maximization problem. Also define the technical terms used therein.

3.``Linear programming is one of the most frequently and successfully employed Operations Research techniques to managerial and business decisions.’’ Elucidate this statement with some examples. …2…

…2…

4.Describe the transporation problem and give its mathematical model. Explain, by taking an illustration, the North-West Corner Rule, the Least Cost Method and the Vogel’s Approximation Method to obtain the initial feasible solution to a transportation problem.

Discuss the various methods of finding initial feasible solution of a transportation problem and state the advantages, disadvantages, and areas of application for them.

5.What is an assignment problem? It is true to say that it is a special case of the transportation problem? Explain. How can you formulate an assignment problem as a standard linear programming problem? Illustrate. What do you understand by an assignment problem? Give a brief outline for solving it.

6.What are different types of inventories? Explain. What functions does inventory perform? State the two basic inventory decisions management must make as they attempt to accomplish the functions of inventory just described by you.

7.What is queuing theory? What type of questions are sought to be answered in analyzing a queuing system? Give a general structure of the queuing system and explain. Illustrate some queuing situations. What is queuing theory? In what types of problem situations can it be applied successfully? Discuss giving examples.

8.What is a replacement problem? Describe some important replacement situations and policies. Briefly explain the costs which are relevant to decisions for replacement of depreciable assets. Illustrate their behaviour and explain how the optimal time for replacement of an asset can be determined. …3…

…3…

9.What kinds of decision-making situations may be analysed using PERT and CPM techniques? State the major similarities between PERT and CPM. Under what circumstances is CPM a better technique of project management than PERT? A construction company has received a contract to build an office complex. It has frequently engaged itself in constructing such buildings. Which of the two network techniques, PERT and CPM, should in your opinion, be employed by the company? Why?

10.Describe the steps involved in the process of decision making. What are pay-off and regret functions? How can entries in a regret table be derived from a pay-off table?

11.What do you understand by Markov processes? In what areas of management can they be applied successfully? What do you understand by transition probabilities? Is the assumption of stationary transition probabilities realistic, in your opinion? Why or why not?

12.Explain how the probability tree helps to understand the problem of Markov processes. Explain the method of calculation of ending up in each absorbing state when a chain beings in a...

## Share this Document

Let your classmates know about this document and more at StudyMode.com