OR 6205 Deterministic Operations Research: Module 1: Introduction To Operations Research and Linear Programming
OR 6205 Deterministic Operations Research: Module 1: Introduction To Operations Research and Linear Programming
Deterministic Operations
Research
Module 1: Introduction to
Operations Research and Linear
Programming
Himlona Palikhe, Ph.D.
Northeastern University
Lesson 1: Introduction to
OR and LP
Objectives
Describe OR & LP as they relate to
decision making in organizations
Use the Gauss-Jordan method to solve a
system of simultaneous linear equations
in algebraic and matrix form
Formulate small-size LP models
Solve two-variable LP problems with the
graphical method manually and in the
computer using lOR Tutorial
4
Operations Research
(OR)
Operations Research
Cont.
Organization
Application
Year
Yearly savings
Dutch Ministry of Infrastructure
and the Environment
National Water management policy development, adding new facilities, operating and costs procedures 1985 $15 millions
(Netherlands Rijkswaterstaat)
Monsanto Corp.
1985 $2 millions
Weyerhaeuser Co.
Electrobras/CEPAL Brasil
Optimal allocation of hydraulic and thermic resources in the national energy generation system
United Airlines
Shifts at book offices and airports scheduling to accomplish with the customer needs at minimal cost
1986 $6 millions
1987 $3 millions
Administration of oil and coal inventories for the electric service with the intention of balancing inventory
1989 $59 millions
costs and risks of remaining
Texaco Inc.
Optimizing the mixing of ingredients available in order to obtain fuels which met with the quality
requirements and sales
IBM
1990
Rapidity in the airplanes, crew, load and passengers coordination to drive the evacuation by air in the
"Desert Storm" project in the Middle Orient
1992 Victory
American Airlines
Design of a pricing, overbooking and flight coordination structure system to enhance benefits
Optimizing the design of the national transport network and the scheduling of shipping routes in the U.S. 1992 $17.3 millions
AT&T
Delta Airlines
Maximizing profits from the allocation of aircraft types in 2.500 national flights in the U.S.
Restructuring of the whole supply chain among suppliers, plants, distribution centers, potential sites and
1995 $800 millions
market areas
China
Selection and optimum programming of mass projects to obey with future energy needs of the country
South African National Defence Optimal restructuring of the size and form of the South African National Defence Force and his weapons
1997 $1.100 millions
Force (SANDF)
system
Procter & Gamble
Redesign of the North American production and distribution system to reduce costs and to improve the
incoming rapidity to the market
Taco Bell
Optimum employees programming to provide the service to desired clients with a minimum cost
Hewlett-Packard
Redesign of security inventories' size and location at printer production line to obey the production goals 1998 $280 millions of additional revenue
Source: http://www.phpsimplex.com/en/real_cases.htm
Operations Research
Cont.
Samuelson Model
It is an input/output optimization model.
It maximizes the GNP of a country- think of a
country as a big organization.
Inputs of a country: Its resources (labor
force, raw materials, minerals, capital, etc.).
Processes and technology are used to
convert the materials to final products.
The goal is to utilize the resources of the
country in the best possible way, to
maximize its GNP (output).
10
Markowitz Model
It is an optimization model for portfolio selection. A
portfolio is the collection of securities one invests
in using capital. Given the amount of capital
available, the portfolio selection model selects the
securities from a given set one should invest.
An intuitive objective is to maximize the ROI after
a year or ten years. Markowitz was the first who
disagreed: ROI is not enough; one has to look at
the risk. He introduced the concept of
diversification of investments. He quantified the
risk using the variance of the return.
11
Merton Model
Merton won a Nobel Prize in the 1990s for
option pricing.
Option is not a stock or bond, but the right
to buy or sell a particular stock or bond at
a particular price at a particular time.
The price of that option is very important,
and Merton developed differential
equations and other mathematical models
for pricing options.
13
Brief History of OR
Research on military Operations
problems by the British government
during world war II led to the
development of OR
OR led to the development of methods
for effectively utilizing new defense
technologies, such as the radar
The air chief marshal directed the
project for the Royal Air Force, 1938
14
OR Professional
Organizations
OR Application Areas
Manufacturing
Transportation
Communication
Construction
Health Care
Banking
17
18
Game theory
Integer and nonlinear programming
Scheduling
Simulation
Multiple criteria decision making
19
Network analysis
It refers to some interesting LP
problems that have network structure.
Examples:
Transportation problem,
Assignment problem,
Shortest path problem,
Maximum flow problem and
Generalized network flow problem.
20
Dynamic programming
Different from LP
Method that is used to make a sequence of
interrelated decisions.
Example, the multi-period production planning
problem: we know the customer demand each
month and we want to determine the
production level each month that will minimize
total cost, including production setup cost,
variable production costs, and inventory
carrying costs. The decisions are interrelated.
21
Types of Decisions
Example of Operating
Decisions
LP Applications
Allocating production facilities to products
o Activities: Products to be produced this week
o Resources: Labor, machines & raw materials
o Activity Levels: No. of units of each product to make
LP Applications Cont.
Allocating limited funds to investment
opportunities
o Activities: Possible securities to buy
o Resources: Capital to be invested
o Activity Levels: Money to invest in each of the
securities
Lesson 2: Mathematical
Foundations of OR and LP
Gauss-Jordan Method
LP problems are converted to systems
of simultaneous linear equations and
then solved by the simplex algorithm.
At each iteration, simplex solves for a
new variable, a system of n
simultaneous linear equations in n
unknowns (variables), using the Gauss
Jordan method.
29
Gauss-Jordan Method
Example
Gaussian Elimination
There are cases, however, where a system
of equations has no solution (inconsistent
system of equations), or it may have an
infinite no. of solutions. The no. of
solutions depends on the rank of the
matrices.
In LP, the resulting systems of equations
most often have an infinite number of
solutions and we try to identify the optimal
solution.
31
Matrix Form
Example
Lesson 3: LP Formulation
34
35
IOR Tutorial
www.mhhe.com/hillier
Steps:
1.Click Area and select General Linear
Programming
2.Click Procedure and select Graphical
Method and Sensitivity Analysis
36
Homework 1
To practice the Gauss-Jordan method, solve the
following system of three simultaneous linear
equations in three unknowns.
2x1 + 3x2 + x3 = 11
-3x2 + 2x3 = 5
x1 + x2 + x3 = 7
a) Solve in algebraic form and specify in each iteration
the pivot column, pivot row and pivot element
b) Solve in matrix form, by inverting manually the
appropriate matrix and postmultiply by the RHS vector.
37
Homework 1 Cont.
38
Module 2 Reading:
Chapter 3.2-3.6 and
Appendix 1