# Techniques of Operations Research

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Techniques of Operations Research C HAPTER INTRODUCTION The term, Operations Research was first coined in 1940 by McClosky and Trefthen in a small town called Bowdsey of the United Kingdom. This new science came into existence in a military context. During World War II, military management called on scientists from various disciplines and organised them into teams to assist in solving strategic and tactical problems, relating to air and land defense of the country. Their mission was to formulate specific proposals and plans for aiding the Military Commands to arrive at decisions on optimal utilisation of scarce military resources and efforts and also to implement the decisions effectively. This new approach to the systematic and scientific study is operational research. Hence, OR can be associated with an art of winning the war without actually fighting it. 2.2 SCOPE OF OPERATIONS RESEARCH There is a great scope for economists, statisticians, administrators and the technicians working as a team to solve problems of defense by using the OR approach. Besides this, OR is useful in the various other important fields like: 1. Agriculture 2. Finance 3. Industry 4. Marketing and Personnel management 5. Production Management 6. Research and Development etc. 2.3 VARIOUS TECHNIQUES OF OPERATIONS RESEARCH 1. Linear Programming Problem Simplex Algorithm Two-Phase Simplex Method Duality Theory

2 Techniques of Operations Research Applications Optimising refinery operations. Supply distribution marketing (SDM) system. Diet problem. Work scheduling problem. Capital budgeting problem. Short-term financial planning. Blending problems. Productions process models. Inventory model, etc Simplex Method Simplex method is an iterative procedure for solving Linear Programming Problem (LPP) in a finite number of steps. This method provides an algorithm which consists of moving from one vertex of the region of feasible solution to another in such a manner that the value of the objective function at the succeeding vertex is less or more as the case may be than at the previous vertex. This procedure is repeated and since the number of vertices is finite, the method leads to an optimal vertex in a finite number of steps or indicates the existence of unbounded solution. Definition Let X b be a basic feasible solution to the LPP, Max Subject to And Z = C x A x = b X 0, such that it satisfies X b = B 1 b where B is the basic matrix formed by the column of basic variables. The vector C b =(C b1,c b2...c bm ) where C ij are components of C associated with the basic variables is called the cost vector associated with the basic feasible solution X b. In the simplex method the following procedure is to be studied to solve the problem and this will be explained in detail in the next chapters: 1. Converting linear programming to standard form 2. Finding basic and non-basic variables 3. Determining the entering and leaving variable 4. Feasible solutions 5. Unbounded solutions and others The main feature of the simplex method is that it solves the LP in iterations. Each iteration moves the solution to a new corner point that has the potential to improve the value of the objective function. The process ends when no further improvements can be realised. The simplex method involves tedious and voluminous computations, which makes the computer an essential tool for solving LP problems. The computational rules of the simplex method are thus designed to facilitate automatic computations.

3 2.4.7 Duality Theory Techniques of Operations Research 23 From both the theoretical and practical points of view, the theory of duality is one of the most important and interesting concepts in linear programming. The basic idea behind the duality theory is that every linear programming problem has an associated linear program called its dual such that a solution to the original linear program also gives a solution to its dual. Whenever a linear program is solved by the simplex method, we are actually getting solutions for two linear programming problems. Knowing the relation between a LP and its dual is vital to understand advanced topics in linear and nonlinear programming. This relation is important because it gives us interesting economic insights. Knowledge of duality will also provide additional insights into sensitivity analysis. The linear programming problem can be viewed as a resource allocation model in which the objective is to maximise revenue or profit subject to limited resources. Looking at the problem from this standpoint, the associated dual problem offers interesting economic interpretations of the LP resource allocation model Important Results in Duality 1. The dual of the dual is primal. 2. If one is a maximisation problem then the other is a minimisation one. 3. The necessary and sufficient condition for any LPP and its dual to have an optimal solution is that both must have feasible solution. 4. Fundamental duality theorem states that if either the primal or dual problem has a finite optimal solution, then the other problem also has a finite optimal solution and also the optimal values of the objective function in both the problems are the same i.e., Maximum Z = Minimum Z. The solution of the other problem can be read from the Z C row below the columns of slack surplus variables. 5. Existence theorem states that, if either problem has an unbounded solution then the other problem has no feasible solution. 6. Complementary slackness theorem states that i) if a primal variable is positive, then the corresponding dual constraint is an equation at the optimum and vice versa. ii) if a primal constraint is a strict inequality then the corresponding dual variable is zero at the optimum and vice versa Dual Simplex Method The dual simplex method is very similar to the regular simplex method, the only difference lies in the criterion used for selecting a variable to enter the basis and to leave the basis. In dual simplex method, we first select the variable to leave the basis and then the variable to enter the basis. This method yields an optimal solution to the given LPP in a finite number of steps provided, no basis is repeated. The dual simplex method is used to solve problems which start dual feasible (i.e., whose primal is optimal but infeasible). In this method the solution starts optimum, but infeasible and remains infeasible until the true optimum is reached, at which the solution becomes feasible. The advantage of this method is avoiding the artificial variables introduced in the constraints along with the surplus variables as all constraints are converted into type.

4 24 Operations Research 2.5 TRANSPORTATION The transportation model is a special case of linear programming that deals with shipping a commodity from sources to destinations (factories to warehouses). The objective of transportation model is to determine the shipping schedule that minimises the total shipping cost while satisfying supply and demand limitations. The model assumes that the shipping cost is proportional to the number of units shipped on a given route. The transportation can be extended to the areas of operation, inventory control, employment scheduling and personnel assignment. The transportation model can be solved as a regular linear programming; its special structure allows the development of a simplex based computational algorithm that makes use of the primal-dual relationships to simplify the computations. The transportation problems actually are special cases of the minimum cost flow problem and can be used for network representation of the transportation. The transportation problem involves m sources each of which are available a i (i =1, 2,...m) units of a homogeneous product and n destinations each of which requires b j (j =1, 2,...n) units of this product. The numbers a and b, are positive integers. The cost of C i of transporting one unit of product from the ith source to the jth destination is given for each i and j. The objective is to develop an integral transportation schedule that meets all demands from current inventory at a minimum total shipping cost; it is assumed that total supply and total demand are equal. m n a i = i=1 b j j=1 The transportation algorithm is the simplex method specialised to the format and it involves: Finding an initial basic feasible solution. Testing the solution for optimality. Improving the solution when it is not optimal. The transportation model can be solved by software like TORA, Excel Solver Solution, LINGO and LINDO and others. The goal is to allocate the supply available for each origin so as to optimise a criterion while satisfying the demand at each destination. The usual objective function is to minimise the total transportation cost or total weighted distance or to maximise the total profit contribution from the allocation Applications To minimise the sum of shortage and shipping costs. To minimise purchase and shipping cost. To minimise the daily cost of processing checks. To maximise the revenue. 2.6 ASSIGNMENT MODEL The best person for the job is a description of the assignment model. The situation can be illustrated by the assignment of workers with varying degrees of skills to jobs. A job that happens to match a worker s skill costs less than that in which the operator is not as skillful. The objective of the model is to determine the least cost (optimum) assignment of workers job.

5 Techniques of Operations Research 25 The assignment model is actually a special of the transportation model in which the workers represented the sources and its jobs represent the destinations. The supply amount at each destination exactly equal one. The cost of transporting worker i to the job j is C ij. The assignment model can be solved directly as a regular transportation model. The fact that all supply and demand amount equal one has led to the development of a simple solution algorithm called the Hungarian method. The new method appears totally unrelated to the transportation model. The algorithm is actually rooted in the simplex method just as the transportation model is. A more efficient way of solving the assignment problem has been developed based on a mathematical property due to the Hungarian method. The basic principle of this method is that the optimal assignment is not affected if a constraint is added or subtracted from any row or column of the standard assignment of cost matrix. A naïve approach to solve this problem is to enumerate all possible assignments of jobs to machines. For each assignment the total cost may be computed, and the one with the least cost is picked as the best assignment. This will be an inefficient and expensive approach since the number of possible assignments is n! even for n=5, there are 120 possible assignments! It can be thought of formulating to linear programming problem. The assignment problem can be solved by the Hungarian Method. Step 1: In the original cost matrix, identify each row s minimum and subtract it from all the entries of the row. Step 2: For the matrix resulting from step 1, identify each column s minimum and subtract it from all the entries of the column. Step 3: Identify the optimal solution as the feasible assignment associated with the zero elements of the matrix obtained in step 2. The Assignment model also, can be solved by softwares like TORA, Excel Solver Solution, LINGO and LINDO and others Applications To minimise the total time required to complete the jobs. To minimise cost assignment of persons to jobs. To minimise time for arrival and departure of flights. The application of assignment technique is assigning people to tasks, airline departure and arrival of the flights and other areas. 2.7 QUEUING THEORY Queues are a part of everyday s life. We all wait in queues to buy a movie ticket, to make a bank deposit, pay for groceries, mail a package, obtain a food in a cafeteria, to have ride in an amusement park and have become adjusted to wait but still get annoyed by unusually long waits. Queueing theory is the study of waiting in all these various activities. It uses queueing models to represent the various types of queueing systems that arise in practice. Formulas for each model indicate how the corresponding queueing system proceed, perform, including the average amount of waiting that will occur under a variety of circumstances. The queueing models are very helpful for determining

6 26 Operations Research how to operate a queueing system in the most effective way if too much service capacity to operate the system involves excessive costs. The models enable finding an appropriate balance between the cost of service and the amount of waiting. The flows of materials through manufacturing operations through a sequence of processing stages represent other forms of queues. In this chapter we learn how to construct and solve equations that describe queueing behaviour for a wide variety of situations. We cannot exhaust even the elementary models, because the number of possible variations is enormous. In the terminology of queueing theory, the first proposal involves changing the parameter values of the models but does not involve structural changes. The queueing models are very helpful for determining how to operate a queueing system (as shown in Fig. 2.1) in the most effective way if too much service capacity to operate the system involves excessive costs. The models enable finding an appropriate balance between the cost of service and the amount of waiting. The queueing models can also be solved using software like TORA, Excel Solver Solution, LINGO and LINDO and others. Input Input Source Queue Discipline Service Mechanism Served Units Fig. 2.1 The basic structure of Queueing Model. The second proposal is for a two-server, single queue system and the third is for a two-server separated queue system Applications Bank teller Bank staffing Barber shop Tool centre Service station. 2.8 GAME THEORY Life is full of conflicts and competition. The examples of conflicts include parlour games, military battles, political campaigns, advertising and marketing campaigns by competing business firms etc. Game theory deals with decision situation in which two intelligent opponents have competing objectives. In a game conflict, two opponents known as players will each have a number of alternatives or strategies. Associated with each pair of strategies is a pay-off that one player pays to the other, such games are known as two-person zero sum games because the gain by one player equals the loss of the other so that the sum of their net winning is zero. The basic characteristics of two-person zero sum games consider the game called evens and odds. In general a two-person game is characterised by 1. The strategies of player 1 2. The strategies of player 2 3. The pay-off table.

7 Techniques of Operations Research 27 A primary objective of game theory is the development of rational criteria for selecting a strategy. The following two key assumptions are made: 1. Both players are rational 2. Both players choose their strategies solely to promote their own welfare. Game theory contrasts with decision analysis where the assumption is that the decision maker is playing a game with a passive opponent which chooses its strategies in some random fashion Applications Constant sum TV game Odds and evens Coin toss game with bluffing Prisoner s dilemma Advertising prisoner s dilemma game Chicken game. 2.9 NETWORK METHODS Management of big projects with a large number of activities pose complex problems in planning, scheduling and controlling, especially when the activities have to be performed in a specialised technological sequence. Fortunately, two operation research techniques, PERT (Program Evaluation and Review Technique) and CPM (Critical Path Method) are available to assist the project manager in carrying out these responsibilities. These techniques make heavy use of networks to help plan and display the coordination of all the activities. They also normally use a software package to deal with all the data needed to develop schedule information and then to monitor the progress of the project. Project management software, namely, MS Project is available for these purposes. Some recent surveys report that as much as 70% of the world s mathematical programming problems can be represented by network related models. The applications of networks are: Determination of the shortest route between two cities in a network of roads. Determination of the time schedule for the activities of a construction project. Determination of the time schedule from oil fields to refineries through a pipeline network. The solutions of these situations are accomplished through a variety of network optimization algorithms. The following are the algorithms: Minimal spanning tree Shortest route algorithm Maximum flow algorithm Minimum cost network algorithm. The Network model also, can be solved using software like TORA, Excel Solver Solution, LINGO and LINDO and others.

8 Techniques of Operations Research Importance of Integer Programming Problems (IPP) In LPP all the decision variables were allowed to take any non-negative real values as it is quite possible and appropriate to have fractional values in many situations. There are several frequently occurring circumstances in business and industry that lead to planning models involving integer valued variables. For example, in production, manufacturing is frequently scheduled in terms of batches, lots or runs. In allocation of goods, a shipment must involve a discrete number of trucks or aircraft. In such cases the fractional values of variables like 1/3 may be meaningless in the context of the actual decision problem. This is the main reason why integer programming is so important for managerial decisions Applications of Integer Programming Integer programming is applied both in business and industry. All assignment and transportation problems are integer programming problems, as in assignment and travelling salesmen problems, all the decision variables are either zero or one, i.e., x ij = 0 or 1 Other examples are capital budgeting and production scheduling problems. In fact any situation involving decisions of the type either to do a job or not to do can be viewed as an IPP in all such situations x ij = 1 if the j th activity is performed = 0 if the j th activity is not performed. In addition, allocation problems involving the allocation of men and machines give rise to IPP, since such communities can be assigned only in integers and not in fractions. Note: If the non-integer variable is rounded off, it violates the feasibility and also there is no guarantee that the rounded off solution will be optimal. Due to these difficulties there is a need for developing a systematic and efficient procedure for obtaining the exact optimal integer solution to such problems MARKOV CHAINS Sometimes we are interested in how a random variable changes over time. For example, we may want to know how the price of a share of a stock or a firm s market share evolves. The study of how a random variable changes over time includes stochastic processes; in particular, we focus on a type of stochastic process known as a Markov chain. A discrete-time stochastic process is a Markov chain Applications of Markov Chains Markov chains have been applied in areas such as Education Marketing Health Services

9 32 Operations Research Finance Accounting and Production INVENTORY MODELS A business or an industry usually maintains a reasonable inventory of goods to ensure smooth operation. Traditionally, inventory is viewed as a necessary evil: too little of it causes costly interruptions; too much results in idle capital. The inventory problem determines the inventory level that balances the two extreme cases. An important factor in the formulation and solution of an inventory model is that the demand (per unit time) of an item may be deterministic (known with certainty) or probabilistic (described by a probability distribution). Inventory is essential to provide flexibility in operating a system or organisation. An inventory can be classified into raw material, work-in-process inventory and finished goods inventory. The raw material inventory avoids the costly machines being idle and the work in-process inventory removes dependency between various machines of a product line. The finished goods inventory removes dependency between plants and its customers or market. The main functions of an inventory are: smoothing out irregularities in supply, minimising the production cost and allowing organisations to cope up with perishable materials Models of Inventory There are different models of inventory. The inventory models can be classified into deterministic models and probabilistic models. The various deterministic models are: 1. Purchasing model: No shortages. 2. Manufacturing model: No shortages. 3. Multi-item deterministic model. 4. Purchasing model with shortages. 5. Manufacturing model with shortages. 6. Stochastic models. 7. Purchase inventory model with price breaks. The various probabilistic modes are 1. Binomial distribution 2. Poisson distribution 3. Negative exponential distribution 4. Normal distribution 5. Dynamic programming 6. Forecasting models 7. Inventory models 8. Queueing system 9. Simulation models.

10 34 Operations Research Capital budgeting problem Reliability improvement problem Stage-coach problem (shortest-path problem) Cargo loading problem Minimising total tardiness in single machine scheduling problem Optimal subdividing problem Linear programming problem NONLINEAR PROGRAMMING In previous discussions, we have studied linear programming problems. In a LPP, our goal was to maximise or minimise a linear function subject to linear constraints. In many interesting maximisation and minimisation problems, the objective function may not be a linear function, or some of the constraints may not be linear constraints. Such an optimisation problem is called a nonlinear programming problem (NLP). The solution methods of nonlinear programming generally can be classified as either direct or indirect algorithms. Examples of direct methods are the gradient algorithms, where the maximum (minimum) of a problem is sought by following the fastest rate of increase (decrease) of the objective function. In indirect methods, the original problem is replaced by another from which the optimum is determined. Examples of these situations include quadratic programming separable programming, and stochastic programming.

### OPERATIONS RESEARCH Code: MB0048. Section-A

Time: 2 hours OPERATIONS RESEARCH Code: MB0048 Max.Marks:140 Section-A Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue

### INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH.

INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH. Dec 2014 DATE: 20.12.2014 Max. Marks: 100 TIME: 2.00 p.m to 5.00 p.m. Duration: 03

### Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras

Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 37 Transportation and Distribution Models In this lecture, we

### Modeling of competition in revenue management Petr Fiala 1

Modeling of competition in revenue management Petr Fiala 1 Abstract. Revenue management (RM) is the art and science of predicting consumer behavior and optimizing price and product availability to maximize

### Presentation: H. Sarper An Introduction to Modeling

Chapter 1 An introduction to Model Building to accompany Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Presentation:

### ISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ

ISE 204 OR II Chapter 8 The Transportation and Assignment Problems Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ 1 The Transportation and Assignment Problems Transportation Problems: A special class of Linear Programming

### TRANSPORTATION PROBLEM AND VARIANTS

TRANSPORTATION PROBLEM AND VARIANTS Introduction to Lecture T: Welcome to the next exercise. I hope you enjoyed the previous exercise. S: Sure I did. It is good to learn new concepts. I am beginning to

### (Assignment) Master of Business Administration (MBA) PGDPM Subject : Management Subject Code : PGDPM

(Assignment) 2017-2018 Master of Business Administration (MBA) PGDPM Subject : Management Subject Code : PGDPM Subject Title : Operation Research Course Code : PGDPM-01 Maximum Marks: 30 Note: Long Answer

### Assignment Technique for solving Transportation Problem A Case Study

Assignment Technique for solving Transportation Problem A Case Study N. Santosh Ranganath Faculty Member, Department of Commerce and Management Studies Dr. B. R. Ambedkar University, Srikakulam, Andhra

### Transportation problem

Transportation problem Operations research (OR) are concerned with scientifically deciding how to best design and operate people machine systems, usually under conditions requiring the allocation of scarce

### SEQUENCING & SCHEDULING

SEQUENCING & SCHEDULING November 14, 2010 1 Introduction Sequencing is the process of scheduling jobs on machines in such a way so as to minimize the overall time, cost and resource usage thereby maximizing

### 1. Introduction to Operations Research (OR)

1. Introduction to Operations Research (OR) 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Management Applications of OR 1.5 Phases of OR 1.6 Models in

### TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS

TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS Fauziah Ab Rahman Malaysian Institute of Marine Engineering Technology Universiti Kuala Lumpur Lumut, Perak, Malaysia fauziahabra@unikl.edu.my

### Queuing Theory 1.1 Introduction

Queuing Theory 1.1 Introduction A common situation occurring in everyday life is that of queuing or waiting in a line. Queues (waiting lines) are usually seen at bus stop, ticket booths, doctor s clinics,

### Transportation Problems

C H A P T E R 11 Transportation Problems Learning Objectives: Understanding the feature of Assignment Problems. Formulate an Assignment problem. Hungarian Method Unbalanced Assignment Problems Profit Maximization

### The Transportation and Assignment Problems. Hillier &Lieberman Chapter 8

The Transportation and Assignment Problems Hillier &Lieberman Chapter 8 The Transportation and Assignment Problems Two important special types of linear programming problems The transportation problem

### INDUSTRIAL ENGINEERING

1 P a g e AND OPERATION RESEARCH 1 BREAK EVEN ANALYSIS Introduction 5 Costs involved in production 5 Assumptions 5 Break- Even Point 6 Plotting Break even chart 7 Margin of safety 9 Effect of parameters

### Decision Support and Business Intelligence Systems

Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 4: Modeling and Analysis Learning Objectives Understand the basic concepts of management support system (MSS) modeling

### The Study of Using LP to Solve Flower Transport Problem

The Study of Using LP to Solve Flower Transport Problem 1 Chung-Hsin Liu, 2 Le Le Trung 1 Department of Computer Science & Information Engineering, Chinese Culture University, Taiwan, R.O.C. liu3.gold@msa.hinet.net

### Linear Programming and Applications

Linear Programming and Applications (v) LP Applications: Water Resources Problems Objectives To formulate LP problems To discuss the applications of LP in Deciding the optimal pattern of irrigation Water

### SCHEDULING IN MANUFACTURING SYSTEMS

In process planning, the major issue is how to utilize the manufacturing system s resources to produce a part: how to operate the different manufacturing processes. In scheduling. The issue is when and

### Linear Programming for Revenue Management in Hotel Industry

Linear Programming for Revenue Management in Hotel Industry Mrs Shreelatha Rao, MSc, MBA, PGDHE Welcomgroup Graduate School of Hotel Administration Manipal University Manipal 576 104 Karnataka - India

### Lecture 45. Waiting Lines. Learning Objectives

Lecture 45 Waiting Lines Learning Objectives After completing the lecture, we should be able to explain the formation of waiting lines in unloaded systems, identify the goal of queuing ( waiting line)

### SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES

SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES Al-Naimi Assistant Professor Industrial Engineering Branch Department of Production Engineering and Metallurgy University of Technology Baghdad - Iraq dr.mahmoudalnaimi@uotechnology.edu.iq

Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department

### Nature and Scope of operations research

Nature and Scope of operations research What is an Operation Research Operations Research is the science of rational decision-making and the study, design and integration of complex situations and systems

### SINGLE MACHINE SEQUENCING. ISE480 Sequencing and Scheduling Fall semestre

SINGLE MACHINE SEQUENCING 2011 2012 Fall semestre INTRODUCTION The pure sequencing problem is a specialized scheduling problem in which an ordering of the jobs completely determines a schedule. Moreover,

### Container packing problem for stochastic inventory and optimal ordering through integer programming

20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Container packing problem for stochastic inventory and optimal ordering through

### Logistics. Lecture notes. Maria Grazia Scutellà. Dipartimento di Informatica Università di Pisa. September 2015

Logistics Lecture notes Maria Grazia Scutellà Dipartimento di Informatica Università di Pisa September 2015 These notes are related to the course of Logistics held by the author at the University of Pisa.

### INFORMATION TECHNOLOGY IN THE SUPPLY CHAIN

INFORMATION TECHNOLOGY IN THE SUPPLY CHAIN Introduction Information is crucial to the performance of a supply chain because it provides the basis upon which supply chain managers make decisions. Information

### WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010

WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010 PhD Preliminary Examination Candidate Name: 1- Sensitivity Analysis (20 points) Answer ALL Questions Question 1-20

### and type II customers arrive in batches of size k with probability d k

xv Preface Decision making is an important task of any industry. Operations research is a discipline that helps to solve decision making problems to make viable decision one needs exact and reliable information

### 1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS

1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS Professor Cynthia Barnhart Professor Nigel H.M. Wilson Fall 2003 1.224J/ ESD.204J Outline Sign-up Sheet Introductions Carrier

### The Transportation and Assignment Problems. Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course

The Transportation and Assignment Problems Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Sources Destinations Supply Demand The Requirements

### Introduction to Analytics Tools Data Models Problem solving with analytics

Introduction to Analytics Tools Data Models Problem solving with analytics Analytics is the use of: data, information technology, statistical analysis, quantitative methods, and mathematical or computer-based

### Analyze different types of non zero sum games. Hawk vs. Dove game. Advertising problem. Problem of companies polluting the environment.

Unit 3 GME THEORY Lesson 31 Learning Objective: nalyze different types of non zero sum games Hawk vs. game. dvertising problem. Problem of companies polluting the environment. Rationalizability or Iterative

### Ch.01 Introduction to Modeling. Management Science / Instructor: Bonghyun Ahn

Ch.01 Introduction to Modeling Management Science / Instructor: Bonghyun Ahn Chapter Topics The Management Science Approach to Problem Solving Model Building: Break-Even Analysis Computer Solution Management

### Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 24 Sequencing and Scheduling - Assumptions, Objectives and Shop

### THE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS

THE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS Foundations of Computer Aided Process Operations Conference Ricki G. Ingalls, PhD Texas State University Diamond Head Associates,

### Optimal Solution of Transportation Problem Based on Revised Distribution Method

Optimal Solution of Transportation Problem Based on Revised Distribution Method Bindu Choudhary Department of Mathematics & Statistics, Christian Eminent College, Indore, India ABSTRACT: Transportation

### Chapter C Waiting Lines

Supplement C Waiting Lines Chapter C Waiting Lines TRUE/FALSE 1. Waiting lines cannot develop if the time to process a customer is constant. Answer: False Reference: Why Waiting Lines Form Keywords: waiting,

### LECTURE 41: SCHEDULING

LECTURE 41: SCHEDULING Learning Objectives After completing the introductory discussion on Scheduling, the students would be able to understand what scheduling is and how important it is to high volume

### Modeling Linear Programming Problem Using Microsoft Excel Solver

Modeling Linear Programming Problem Using Microsoft Excel Solver ADEKUNLE Simon Ayo* & TAFAMEL Andrew Ehiabhi (Ph.D) Department of Business Administration, Faculty of Management Sciences, University of

### CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER

For more important questions visit : www.4ono.com CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER Linear programming is the process used to obtain minimum or maximum value of the linear objective function

### A Genetic Algorithm on Inventory Routing Problem

A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract

### The Efficient Allocation of Individuals to Positions

The Efficient Allocation of Individuals to Positions by Aanund Hylland and Richard Zeckhauser Presented by Debreu Team: Justina Adamanti, Liz Malm, Yuqing Hu, Krish Ray Hylland and Zeckhauser consider

### Chapter 11. Decision Making and Relevant Information Linear Programming as a Decision Facilitating Tool

Chapter 11 Decision Making and Relevant Information Linear Programming as a Decision Facilitating Tool 1 Introduction This chapter explores cost accounting for decision facilitating purposes It focuses

### A Minimum Spanning Tree Approach of Solving a Transportation Problem

International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 Volume 5 Issue 3 March. 2017 PP-09-18 A Minimum Spanning Tree Approach of Solving a Transportation

### MGSC 1205 Quantitative Methods I

MGSC 1205 Quantitative Methods I Class Seven Sensitivity Analysis Ammar Sarhan 1 How can we handle changes? We have solved LP problems under deterministic assumptions. find an optimum solution given certain

### Textbook: pp Chapter 12: Waiting Lines and Queuing Theory Models

1 Textbook: pp. 445-478 Chapter 12: Waiting Lines and Queuing Theory Models 2 Learning Objectives (1 of 2) After completing this chapter, students will be able to: Describe the trade-off curves for cost-of-waiting

### ^ Springer. The Logic of Logistics. Theory, Algorithms, and Applications. for Logistics Management. David Simchi-Levi Xin Chen Julien Bramel

David Simchi-Levi Xin Chen Julien Bramel The Logic of Logistics Theory, Algorithms, and Applications for Logistics Management Third Edition ^ Springer Contents 1 Introduction 1 1.1 What Is Logistics Management?

### Chapter 14. Waiting Lines and Queuing Theory Models

Chapter 4 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl 2008 Prentice-Hall,

### ECN 3103 INDUSTRIAL ORGANISATION

ECN 3103 INDUSTRIAL ORGANISATION 5. Game Theory Mr. Sydney Armstrong Lecturer 1 The University of Guyana 1 Semester 1, 2016 OUR PLAN Analyze Strategic price and Quantity Competition (Noncooperative Oligopolies)

### CHAPTER - 1 RELIABILITY ENGINEERING BASICS AND OPTIMIZATION TECHNIQUES

1 CHAPTER - 1 RELIABILITY ENGINEERING BASICS AND OPTIMIZATION TECHNIQUES Table of Contents S. No. Description Page No. 1.1 Introduction 2 1.2 Reliability 5 1.3 Reliability analysis 8 1.4 Design for higher

### Scheduling and Coordination of Distributed Design Projects

Scheduling and Coordination of Distributed Design Projects F. Liu, P.B. Luh University of Connecticut, Storrs, CT 06269-2157, USA B. Moser United Technologies Research Center, E. Hartford, CT 06108, USA

### Axiomatic Design of Manufacturing Systems

Axiomatic Design of Manufacturing Systems Introduction to Manufacturing System "What is a manufacturing system?" "What is an ideal manufacturing system?" "How should we design a manufacturing system?"

### A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life

Dhaka Univ. J. Sci. 64(1): 45-50, 2016 (January) A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life Sajal Chakroborty and M. Babul

### Getting Started with OptQuest

Getting Started with OptQuest What OptQuest does Futura Apartments model example Portfolio Allocation model example Defining decision variables in Crystal Ball Running OptQuest Specifying decision variable

### Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization

Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support

### This is a refereed journal and all articles are professionally screened and reviewed

Advances in Environmental Biology, 6(4): 1400-1411, 2012 ISSN 1995-0756 1400 This is a refereed journal and all articles are professionally screened and reviewed ORIGINAL ARTICLE Joint Production and Economic

### Mileage savings from optimization of coordinated trucking 1

Mileage savings from optimization of coordinated trucking 1 T.P. McDonald Associate Professor Biosystems Engineering Auburn University, Auburn, AL K. Haridass Former Graduate Research Assistant Industrial

### CHAPTER 1 INTRODUCTION

1 CHAPTER 1 INTRODUCTION 1.1 MANUFACTURING SYSTEM Manufacturing, a branch of industry, is the application of tools and processes for the transformation of raw materials into finished products. The manufacturing

### 4 BUILDING YOUR FIRST MODEL. L4.1 Building Your First Simulation Model. Knowing is not enough; we must apply. Willing is not enough; we must do.

Pro, Second Edition L A B 4 BUILDING YOUR FIRST MODEL Knowing is not enough; we must apply. Willing is not enough; we must do. Johann von Goethe In this lab we build our first simulation model using Pro.

### Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization

Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization Transportation logistics problems and many analogous problems are usually too complicated and difficult for standard Linear

### QUEUING THEORY 4.1 INTRODUCTION

C h a p t e r QUEUING THEORY 4.1 INTRODUCTION Queuing theory, which deals with the study of queues or waiting lines, is one of the most important areas of operation management. In organizations or in personal

### ISE480 Sequencing and Scheduling

ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for

### There are several other pages on this site where simulation models are described. Simulation of Random Variables Simulation of Discrete Time Markov

Simulation Often systems operate in an iterative manner. Say the manager of a store maintains an inventory holding an expensive product. The manager looks at the inventory at the end of each day to see

### PRODUCT-MIX ANALYSIS WITH DISCRETE EVENT SIMULATION. Raid Al-Aomar. Classic Advanced Development Systems, Inc. Troy, MI 48083, U.S.A.

Proceedings of the 2000 Winter Simulation Conference J. A. Joines, R. R. Barton, K. Kang, and P. A. Fishwick, eds. PRODUCT-MIX ANALYSIS WITH DISCRETE EVENT SIMULATION Raid Al-Aomar Classic Advanced Development

### Mathematical Programming Models for Revenue Management under Customer Choice

Mathematical Programming Models for Revenue Management under Customer Choice Lijian Chen Department of Industrial Engineering J.B. Speed School of Engineering University of Louisville Louisville, KY 40292

### SCHOOL OF DISTANCE EDUCATION :: ANDHRA UNIVERSITY 2-YEAR MBA II YEAR ASSIGNMENTS FOR THE ACADEMIC YEAR

BUSINESS POLICY AND STRATEGIC MANAGEMENT 1. a) Objectives of Business Policy b) Business Ethics 2. a) SWOT Analysis b) The 7 S Framework in Strategic Management 3. a) Value Chain Analysis b) Turnaround

### Managerial Decision Modeling w/ Spreadsheets

Managerial Decision Modeling w/ Spreadsheets, 3e (Balakrishnan/Render/Stair) Chapter 3 Linear Programming Modeling Applications with Computer Analyses in Excel 3.1 Chapter Questions 1) In a multi-period

### Chapter 4. Models for Known Demand

Chapter 4 Models for Known Demand Introduction EOQ analysis is based on a number of assumptions. In the next two chapters we describe some models where these assumptions are removed. This chapter keeps

### Business Decisions. Spreadsheet Modeling. John F. Kros. Vfor\ B Third Edition Revised for Excel 2010

1 Spreadsheet Modeling Vfor\ Business Decisions Third Edition Revised for Excel 2010 Featuring Risk Solver Platform for Decision Analysis, Simulation, and Optimization B12-1399 John F. Kros OffllEHS Preface

### S Due March PM 10 percent of Final

MGMT 2012- Introduction to Quantitative Methods- Graded Assignment One Grade S2-2014-15- Due March 22 11.55 PM 10 percent of Final Question 1 A CWD Investments, is a brokerage firm that specializes in

### Unit 1. Linear Programming. Lesson 2: Introduction to linear programming And Problem formulation. Definition And Characteristics Of Linear Programming

Unit Linear Programming Lesson : Introduction to linear programming And Problem formulation Definition And Characteristics Of Linear Programming Linear Programming is that branch of mathematical programming

### Procedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)

Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)

### B.1 Transportation Review Questions

Lesson Topics Network Models are nodes, arcs, and functions (costs, supplies, demands, etc.) associated with the arcs and nodes, as in transportation, assignment, transshipment, and shortest-route problems.

### a) Measures are unambiguous quantities, whereas indicators are devised from common sense understandings

Chapter-1: QUANTITATIVE TECHNIQUES Self Assessment Questions 1. An operational definition is: a) One that bears no relation to the underlying concept b) An abstract, theoretical definition of a concept

### Distributed Algorithms for Resource Allocation Problems. Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012

Distributed Algorithms for Resource Allocation Problems Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012 Outline Survey of Literature Nature of resource allocation problem

### AUTOMATED GUIDED VEHICLES (AGV) IN PRODUCTION ENTERPRISES

AUTOMATED GUIDED VEHICLES (AGV) IN PRODUCTION ENTERPRISES Lucjan Kurzak Faculty of Civil Engineering Czestochowa University of Technology, Poland E-mail: lumar@interia.pl tel/fax +48 34 3250936 Abstract

### COMPUTATIONAL ANALYSIS OF A MULTI-SERVER BULK ARRIVAL WITH TWO MODES SERVER BREAKDOWN

Mathematical and Computational Applications, Vol. 1, No. 2, pp. 249-259, 25. Association for cientific Research COMPUTATIONAL ANALYI OF A MULTI-ERVER BULK ARRIVAL ITH TO MODE ERVER BREAKDON A. M. ultan,

### A Multi-Objective Approach to Simultaneous Strategic and Operational Planning in Supply Chain Design

A Multi-Objective Approach to Simultaneous Strategic and Operational Planning in Supply Chain Design Ehap H. Sabri i2 Technologies 909 E. Las Colinas Blvd. Irving, TX 75039 Benita M. Beamon Industrial

### Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or

### one Introduction chapter Overview Chapter

one Introduction Chapter chapter Overview 1.1 Introduction to Decision Support Systems 1.2 Defining a Decision Support System 1.3 Decision Support Systems Applications 1.4 Textbook Overview 1.5 Summary

### Workload balancing in identical parallel machine scheduling using a mathematical programming method

International Journal of Computational Intelligence Systems, Vol. 7, Supplement 1 (2014), 58-67 Workload balancing in identical parallel machine scheduling using a mathematical programming method Yassine

### OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03

OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves

### Enhancing Pendulum Nusantara Model in Indonesian Maritime Logistics Network

Enhancing Pendulum Nusantara Model in Indonesian Maritime Logistics Network Komarudin System Engineering, Modeling Simulation (SEMS) Laboratory, Department of Industrial Engineering, Universitas Indonesia,

### Chapter 2 Simulation Examples. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 2 Simulation Examples Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose To present several examples of simulations that can be performed by devising a simulation table either

### Banks, Carson, Nelson & Nicol

Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose To present several examples of simulations that can be performed by devising a simulation table either manually or with a spreadsheet.

### Excel Solver Tutorial: Wilmington Wood Products (Originally developed by Barry Wray)

Gebauer/Matthews: MIS 213 Hands-on Tutorials and Cases, Spring 2015 111 Excel Solver Tutorial: Wilmington Wood Products (Originally developed by Barry Wray) Purpose: Using Excel Solver as a Decision Support

### Transportation Optimization: Is This the Next Step?

Transportation Optimization: Is This the Next Step? By Irista, An HK Systems Company Cost reduction through effective transportation management remains a high priority for most organizations. The challenges

### OPTIMIZATION AND OPERATIONS RESEARCH Vol. IV - Inventory Models - Waldmann K.-H

INVENTORY MODELS Waldmann K.-H. Universität Karlsruhe, Germany Keywords: inventory control, periodic review, continuous review, economic order quantity, (s, S) policy, multi-level inventory systems, Markov

### Principles of Inventory Management

John A. Muckstadt Amar Sapra Principles of Inventory Management When You Are Down to Four, Order More fya Springer Inventories Are Everywhere 1 1.1 The Roles of Inventory 2 1.2 Fundamental Questions 5

### We consider a distribution problem in which a set of products has to be shipped from

in an Inventory Routing Problem Luca Bertazzi Giuseppe Paletta M. Grazia Speranza Dip. di Metodi Quantitativi, Università di Brescia, Italy Dip. di Economia Politica, Università della Calabria, Italy Dip.

### Cost Oriented Assembly Line Balancing Problem with Sequence Dependent Setup Times

Australian Journal of Basic and Applied Sciences, 5(9): 878-884, 2011 ISSN 1991-8178 Cost Oriented Assembly Line Balancing Problem with Sequence Dependent Setup Times 1 Vahid Yazdanparast, 2 Hamid Hajihosseini,

### A Decision Support System for Performance Evaluation

A Decision Support System for Performance Evaluation Ramadan AbdelHamid ZeinEldin Associate Professor Operations Research Department Institute of Statistical Studies and Research Cairo University ABSTRACT

### An Insight into Operations Research

Solomon Mengistu An Insight into Operations Research Applications in Logistics and Supply Chain Management Helsinki Metropolia University of Applied Sciences Bachelor of Business Adminstration International

### A comparative study of ASM and NWCR method in transportation problem

Malaya J. Mat. 5(2)(2017) 321 327 A comparative study of ASM and NWCR method in transportation problem B. Satheesh Kumar a, *, R. Nandhini b and T. Nanthini c a,b,c Department of Mathematics, Dr. N. G.