Scribd
Upload
8 views

Graphical Method Linear Programming Model

Graphical Method Linear Programming Model

Uploaded by

ABHISHEK
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views

Graphical Method Linear Programming Model

Graphical Method Linear Programming Model

Uploaded by

ABHISHEK
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Operations Research

(OPRM 521)
Operations Research is “a scientific approach
to decision making , which seeks to
determine how best to design and operate a
system, under conditions requiring the
allocation of scare
Lectures Tutorials
resources.”
Recommended Books:
 Operations Research by R.
2 1 PANNEERSELVAM
 Operations Research by P.K
Gupta and D.S Hira
 Operations Research by V.K
WEIGHTAGES
Kapoor
 Operations Research by J K
CA MTE ETE ABHISHEK ABROL
Sharma, Trinity Publishing House
Attnd AT P P Th P Th Block-14 Room No. 307
N
5 2 NA
A
NA Cabin No.-10
What is Operations
Research?
Operations
The activities carried out in an organization for making
an end product.
Research
The process of observation and testing characterized
by the scientific method. It involves
• Observe the Situation/problem environment,
• Analyze and define the problem,
• Develop a mathematical model,
• Select appropriate data input,
• experimentation, and validation of results,
• Implement the solution.
Operations Research is a quantitative approach to
decision making based on the scientific method of problem
solving to execute decision making.
2
Operations Research Models
Deterministic Models (assume all data are known with certainty for
optimization)
• Linear Programming Models - (Graphical Method & Simplex Method)
• Assignment problem : Hungarian Assignment Model (HAM)
• Transportation problem : NWCM, LCM and VAM Method for finding
Initial Basic Feasible Solution (IBFS), optimization using MODI method
• Network theory : network diagram, critical path, concept of floats,
difference between PERT and CPM, PERT problem with three time
estimates and concept of probability
• Game theory : basics, saddle point, mixed strategies including odds,
dominance, sub games and graphical method
• Queuing theory / waiting lines theory : basic concepts and
parameters of a queuing model, m/m/1 model characteristics
•3 Contemporary issues in operations research : Use of
software for optimization, operations research and machine learning
Example
Imagine LPU is planning to produce two types of student projects:
X1 (Type 1 Project) and X2 (Type 2 Project). The university wants to
maximize its overall profit from these projects, where the profit for each
Type 1 Project is 6, and for each Type 2 Project, it is 8.

Objective Function: The objective is to maximize the overall profit:


Maximize Z = 6X1+8X2
where:
•X1​= Number of Type 1 Projects
•X2​= Number of Type 2 Projects
•6 and 8 are the profits assigned to Type 1 and Type 2 projects resp.

Subject to Constraints: Let's assume LPU has the following constraints:


1. Faculty Time Constraint:
Each Type 1 Project requires 5 units of faculty time.
Each Type 2 Project requires 10 units of faculty time.
Total available faculty time is 48 units.
Constraint: 5X1+10X2 ≤ 48
2. Budget Constraint:
Each Type 1 Project costs 4 units of the budget.
Each Type 2 Project costs 4 units of the budget.
Total available budget is 40 units.
Constraint: 4X1 + 4X2 ≤ 40
3. Laboratory or Workshop Time: If the projects require lab or workshop
access, there may be limited time available.
e.g., 3X1​+5X2 ​≤ 50 (Total available lab time is 50 units)

4. Material Availability: The university might have limited materials or


supplies required for these projects.
e.g., 2X1​+ 4X2 ​≤ 30 (Total available material units is 30)

5. Student Capacity: There might be a limited number of students available to


work on these projects.
e.g., 2X1​+3X2​≤ 45 (Total available students is 45)

6. Quality Constraints: Minimum Quality Standards


•: The university may require that a minimum number of high-quality
projects (e.g., Type 2) be completed.
Example
Let's assume some hypothetical values for the variables involved in
the linear programming model for the Tata Motors car dealer.
Assumed Values:
Profit per Unit (in INR):
Harrier = 50,000 Tiago = 20,000
Altroz = 30,000 Tigor = 25,000
Nexon = 35,000 Punch =
28,000
Safari = 60,000
Key Terms
1. Objective Function: is a linear function of the decision
variables representing the objective of the manager/decision
maker.
2. Constraints: are the linear equations or inequalities arising out
of practical limitations.
3. Decision Variables: are some physical quantities whose values
indicate the solution.
4. Feasible Solution: is a solution which satisfies all the
constraints (including the non-negative) presents in the problem.
5. Feasible Region: is the collection of feasible solutions.
Multiple Solutions: are solutions each of which maximize or
minimize the objective function.
6. Unbounded Solution: is a solution whose objective function is
infinite.
7. Infeasible Solution: means no feasible solution.
Limitations of Operations Research
1. Magnitude of computation: OR tries to find out the optimal soln. taking all
the factors into consideration. These factors are very complicated which
can be only handled by computer.
2. Absence of Quantification: OR provides soln. only when all the elements
related to a problem can be quantified. The tangible factors such as price
product can be expressed in terms of quantity but intangible factors such as
human relations cannot be quantified and are excluded from the study.
3. Conventional thinking: improvements in profits. Executives felt that they are
doing well in the business with their conventional approaches & hence there
is no necessity to switch over to new approaches suggested by OR expert.
4. Distance between managers and operations research : The executives
working in orgn. don't possess basic knowledge required to apply OR
techniques. So there is a gap arises between those who provides the soln
and the one who uses the soln due to which a negative attitude of decision
makers towards the use of OR techniques is developed.
5. Money and Time costs: When the basic data are subjected to frequent
changes, incorporating them into the OR models is a costly affair.
6. Implementation of decision is a difficult task. It must take into account the
complexities of human relations and behaviour.
Graphical Method of Linear Programming Model
Q1.

Q2.
Q3.

Q4.
Q5. An animal feed company must produce 200 kg of a
mixture consisting of ingredients x1 & x2. The ingredient
x1 costs Rs 3 per kg and x2 costs Rs 5 per kg. Not more
than 80 kg of x1 can be used and at least 60 kg of x2
must be used. Find the minimum cost mixture?
Q6.

Q7.
The standard weight of a special purpose brick is 5 kg and it contains two basic
ingredients B1 and B2. B1 costs Rs 5 per kg and B2 costs Rs 8 per kg. Strength
considerations dictate that the brick should contain not more than 4 kg of B1 and a
minimum of 2 kg of B2. Since the demand for the product is likely to be related to
the price of the brick, graphically find out the minimum cost of the brick satisfying
the above conditions.

You might also like