Scribd
Upload
47 views19 pages

Operations Research Graphical

This document provides an introduction to operations research, including its basic concepts, methodology, history, and applications. It specifically discusses linear programming problems, including their formulation, graphical solution methods, and the simplex method for solving them. As an example, it provides a linear programming problem involving maximizing the profits from manufacturing two products with limited resources. It formulates the problem as a linear program and shows how to derive the feasible region and optimal solution graphically.

Uploaded by

shweta padwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
47 views19 pages

Operations Research Graphical

This document provides an introduction to operations research, including its basic concepts, methodology, history, and applications. It specifically discusses linear programming problems, including their formulation, graphical solution methods, and the simplex method for solving them. As an example, it provides a linear programming problem involving maximizing the profits from manufacturing two products with limited resources. It formulates the problem as a linear program and shows how to derive the feasible region and optimal solution graphically.

Uploaded by

shweta padwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Introduction to Operations Research- Basics definition, scope, objectives, phases,

models and limitations of Operations Research.


Linear Programming Problem- Formulation of LPP, Graphical solution of LPP.
Simplex Method, Artificial variables, Two-phase method, Duality
• 1. INTRODUCTION TO OR
• A system is an organization of interdependent components that work together to
accomplish the goal of the system.
• THE METHODOLOGY OF OR
• Step 1. Formulate the Problem
• Step 2. Observe the System
• Step 3. Formulate a Mathematical Model of the Problem
• Step 4. Verify the Model and Use the Model for Prediction
• Step 5. Select a Suitable Alternative
• Step 6. Present the Results and Conclusions of the Study
• Step 7. Implement and Evaluate Recommendation
HISTORY OF OR
• OR is a relatively new discipline. Whereas 70 years ago it would have
been possible to study mathematics, physics or engineering (for
example) at university it would not have been possible to study OR,
indeed the term OR did not exist then
• In 1941 an Operational Research Section (ORS) was established in
Coastal Command which was to carry out some of the most well-
known OR work in World War II.
BASIC OR CONCEPTS
• "OR is the representation of real-world systems by mathematical models
together with the use of quantitative methods (algorithms) for solving such
models, with a view to optimizing."
• We can also define a mathematical model as consisting of:
• Decision variables, which are the unknowns to be determined by the solution to
the model.
• Constraints to represent the physical limitations of the system
• An objective function
• An optimal solution to the model is the identification of a set of variable values
which are feasible (satisfy all the constraints) and which lead to the optimal
value of the objective function.
LINEAR PROGRAMMING
• Mathematical model to be a linear program (LP) were:
• all variables continuous (i.e. can take fractional values)
• a single objective (minimize or maximize)
• the objective and constraints are linear i.e. any term is either a
constant or a constant multiplied by an unknown.
Applications
• Some of the major application areas to which LP can be applied are:
• Work scheduling
• Production planning & Production process
• Capital budgeting
• Financial planning
• Blending (e.g. Oil refinery management)
• Farm planning
• Distribution
• Multi-period decision problems
Inventory model
Financial models
Work scheduling
SOLVING LP
Graphical Solution
• The axes can be divided in four quadrants. Any point (x,y) lies in one
of the quadrants. The origin O is the point having (0,0) coordinates.
Any point in four quadrants will be (x,y), (-x,y),(-x,-y) and (x,-y) in first,
second, third and fourth quadrant respectively.

•
Example 1.
• Monto wooden soldiers and trains. Each soldier sells for $27, uses $10
of raw materials and takes $14 of labor & overhead costs. Each train
sells for $21, uses $9 of raw materials, and takes $10 of overhead
costs. Each soldier needs 2 hours finishing and 1 hour carpentry; each
train needs 1 hour finishing and 1 hour carpentry. Raw materials are
unlimited, but only 100 hours of finishing and 80 hours of carpentry
are available each week. Demand for trains is unlimited; but at most
40 soldiers can be sold each week. How many of each toy should be
made each week to maximize profits
Solution:-
• Decision variables :-Monto must decide how many soldiers and trains
should be manufactured each week. With this in mind,
• we define:
x1 = the number of soldiers produced per week
x2 = the number of trains produced per week
Objective function -is the function of the decision variables that the
decision maker wants to maximize (revenue or profit) or minimize (costs).
Monto can concentrate on maximizing the total weekly profit (z).
Maximize z = 3x1 + 2x2
• Constraints :-three constraints:
• Finishing time per week
• Carpentry time per week
• Weekly demand for soldiers
• The feasible region is the set of all points satisfying the constraints.
max z = 3x1 + 2x2
2x1 + x2 ≤ 100 (Finishing constraint)
x1 + x2 ≤ 80 (Carpentry constraint)
x1 ≤ 40 (Demand constraint)
x1, x2 ≥ 0 (Sign restrictions)
EX. 1. A company manufactures two products, X and Y by
using three machines A, B, and C. Machine A has 4 hours of
capacity available during the coming week. Similarly, the
available capacity of machines B and C during the coming
week is 24 hours and 35 hours respectively. One unit
ofproduct X requires one hour of Machine A, 3 hours of
machine B and 10 hours of machine C. Similarly
one unit of product Y requires 1 hour, 8 hour and 7 hours of
machine A, B and C respectively. When
one unit of X is sold in the market, it yields a profit of Rs. 5/-
per product and that of Y is Rs. 7/- per
unit. Solve the problem by using graphical method to find the
optimal product mix.
Write in tabular form
• Let the company manufactures the xunits of X &Y and then the linear programming
model is
Maximise 5x+7y
subject to x+y =4,
3x+8y=24
10x+7y=35
Both x & y is greaterthan or equals to zero
Lets take machine A,B&C and we will find boundary
condition if x=0 and y=0 we get
for A machine x+y=4 ,
if x=0,then y=4
if y=0 then x=4 then coordinate will be form for
A machine is (0,4)&(4,0)
similarly sove machine B &C we get
(0,3),(8,0) for B machine
(0,5) &(0,3.5)For C machine

You might also like