The book is designed to meet the requirements of B.Tech, M.B.A., B.B.A. students of various universities.The book covers the topics of Linear Programming, its duality and sensitivity analysis, Transportation Problem, Assignment Problems, Dynamic Programming, Decision Theory, Theory of Games, Stochastic Inventory Models, Simulation and Queueing Models.
Additional Info
  • Publisher: Laxmi Publications
  • Language: English
  • ISBN : 978-93-81159-65-1
  • Chapter 1

    Graphical Solution and Formulation Price 2.99  |  2.99 Rewards Points

    Linear programming deals with the maximization or minimization (or optimization ) of a function of variables known as objective function, subject to a set of linear equalities and/or inequalities known as constraints. Here, the objective function can be cost, profit or production capacity, which is to be obtained in the best possible manner. The constraints may be imposed by different sources such as market demand, storage capacity, raw material availability etc. The word ‘linear’ here implies that the variables, considered here do not certain any powers greater than one.
  • Chapter 2

    Linear Programming— Simplex Method Price 2.99  |  2.99 Rewards Points

    Linear Programming—Simplex Method
  • Chapter 3

    Duality and Sensitivity Analysis in Linear Programming Price 2.99  |  2.99 Rewards Points

    Every linear programming problem is associated with another linear programming problem. The original (or the given) LPP is called the primal problem, where as the associated problem is called the dual problem. In general, either problem can be considered the primal, while the other remaining problem as dual.
  • Chapter 4

    Transportation Problem Price 2.99  |  2.99 Rewards Points

    Transportation problems are one of the first types of problems analyzed in the early history of linear programming. This is also one of the sub classes of linear programming problems. The transportation problem can be solved by the regular simplex method. However, its special structure allows the development of a solution procedure, called the transportation technique, that is computationally more efficient.
  • Chapter 5

    Assignment Problems Price 2.99  |  2.99 Rewards Points

    Assignment problem applies to the problems where the objective is to assign a number of jobs (origins) to the equal number of persons (destination) at a minimum cost (or maximum profit). The assignment problem is a special type of transportation problem. In this assignment problem, the assignment is made on a one-to-one basis, i.e., no two jobs will be assigned to same one person or machine.
  • Chapter 6

    Dynamic Programming Price 2.99  |  2.99 Rewards Points

    Dynamic programming is a mathematical technique dealing with the optimization of multistage decision problems. Dynamic programming was developed by Richard Bellman and G.B. Dantzig in 1950s. In the beginning this technique was termed as stochastic linear programming or linear programming dealing with uncertainty. Dynamic programming can be given a more significant name as recursive optimization. In dynamic programming the term ‘dynamic’ stands for its usefulness in problems where decisions have to be taken at several distinct stages and ‘programming’ is used in a mathematical sense of selecting an optimum allocation of resources. In dynamic programming a large problem having n variables is divided into n subproblems (stages), each of which involves one variable. The optimum solution is obtained in an orderly manner starting from one stage to the next and continued till the final stage is reached.
  • Chapter 7

    Decision Theory Price 2.99  |  2.99 Rewards Points

    Decision analysis involves the use of a rational process for selecting the best of several alternatives. The goodness of a selected alternative depends on the quality of the data used in describing the decision situation. A decision-making process falls into one of the three categories; decisionmaking under certainty, decision-making under uncertainty and decision-making under risk.
  • Chapter 8

    Theory of Games Price 2.99  |  2.99 Rewards Points

    In all the various types of optimization problems there is a single decision maker whose interest lies in selecting the variables in such a way as to optimize objective function, there being no conflict in deciding what the objective is. But in many practical problems, it is required to take decision in a situation, where there are two or more decision makers with conflicting interests and the action of one depends upon the action taken by the other. This situation is known as competitive situation (game). Game theory is a distinct and interdisciplinary approach to the study of human behaviour. The disciplines in the game theory are mathematics, economics and the other social and behavioural sciences.
  • Chapter 9

    Stochastic Inventory Models Price 2.99  |  2.99 Rewards Points

    Inventory is defined as a stock of goods which is kept for the purpose of future use. The stock of goods can be in the form of raw materials, parts, finished or semi-finished goods, machinery etc. Inventory can also be defined as the stock of goods, items other economic resources that are stored or kept to ensure smooth and efficient running of business operations.
  • Chapter 10

    Simulation Price 2.99  |  2.99 Rewards Points

    The mathematical models can help to describe and analyse a wide variety of problems. But, all real life problems cannot be converted into a mathematical form due to the complexity of the situations. In such cases, simulation is a very useful technique. Today, simulation is one of the most multifaceted topics that can face an industrial engineer in the workplace. It is also very important to a corporation, regardless of the industry. It can be used as a tool to increase the production capacity.
  • Chapter 11

    Queueing Models Price 2.99  |  2.99 Rewards Points

    Queueing theory is the study of queues (sometimes are called waiting lines). Most people are familiar with the concept of queues, they exist all around us in daily lives. Queueing theory can be used to describe these real world queues. Queueing theory is the branch of operations research which explores the relationships between demand on a service system and the delays suffered by the users of that system. Queue occurs whenever arriving customers wait in a line to get service at one or more service point. It is formed when the number of customers arriving is greater than the number of customers being served during a period of time.