It is generally agreed that Operations Research came into existence as a discipline during the World War II when there was a critical need to manage scarce resources. However, a particular model and technique of OR can be traced back to much earlier times, The term 'Operations Research' was coined as a result of research on military Operations during this war. Since the war involved strategic and ......

To constitute on development of the specific Operational research techniques to determine the optimal choice among several courses of Operations, including the evaluation of specific numerical values we need to construct (formulate) a mathematical model. LP had its beginning in the input-output analysis developed by the well known economist W. W. Leontief. Hitchcock and Koopman's transportation ty ......

In the last section, we've discussed the formulation of LPP and existence of different types of solutions and the nature of the solutions. In this section, we've solved the LPP problems by describing different methods. In particular, we concentrate on the following methods. Graphical method, Simplex method, Big••M method, Dual Simplex method and Two - Phase Simplex method. All the above ......

Dual Simplex Method is very similar to the regular Simplex Method. In Simplex method we, first select a vector to enter the basis and to leave the basis. In Dual Simplex Method, we determine the vector to leave the basis and then the vector to enter the basis. Dual Simplex Method works towards feasibility where Simplex Method works towards optimality. Main advantage is (Dual Simplex method/Simplex ......

One of the most important and successful applications of quantitative analysis to solve business problems has been in the physical distribution of products, commonly referred to as transportation problems. Basically, the purpose is to minimize the cost of shipping goods from one location to another so that the needs of each arrival area are met and every
shipping location operates within its capa ......

The transportation techniques have n origins and m destinations (or) n availabilities and m requirements.
In this unit we can solve the transportation problem by different methods and we can get the basic feasible and initial basic feasible solutions.

After obtaining an initial basic feasible solution to a given transportation problem, the next question is how to arrive at the optimum solution The basic step for reaching the optimum solution are the same as given for simplex method.

LPP is related to distribution of various reasons, Such as many, machines, time, production etc. Satisfying some constraints which can be represented as linear equation/inequalities, so as to minimize the cost or minimize profit. Assignment technique - which is applicable to a class of very particular problems generally called assignment problems.

Game theory (mathematics), mathematical analysis of any situation involving a conflict of interest, with the intent of indicating the optimal choices that, under given conditions, will lead to a desired outcome. Although game theory has roots in the study of such well-known
amusements as noughts much more serious conflicts of interest arising in such fields as sociology, economics, and political ......

In this unit we shall study to mathematical formulation of game theory. Further we study minimax and maxmini principles for mixed strategies, linear programming approach. In the last section we solved the game problems by using the optimal strategies for 2 x n or m x 2 games by using simple graphical method further we solve some problem.

Queuing theory is concerned with the statistical description of the behavior of queues with finding, e.g., the probability distribution of the number in the queue from which the mean and variance of queue length and the probability distribution of waiting time for a customer, on
the distribution of a server's busy periods can be found.

In this unit, we study the methods of solving the queuing problems, classifications of the queuing models, solutions of the queuing models and limitations of the queuing models.

Pages: 17

Price:
Rs 12.75

Total 0 Chapter(s) Shortlisted and Price Rs..00Purchase Now

Home

About Us

Payments

Contact Us

Claims

Help

Advertising Guidelines

Safe and Secure Payment
All major credit and debit cards are accepted.