0% found this document useful (0 votes)
27 views

Operations Research Introduction

Operations research is the application of analytical methods to help make better decisions. It deals with determining optimal solutions to problems involving scheduling, assignment, facility location, and other real-world decisions. Linear programming is an important OR technique that uses mathematical models with an objective function and constraints to optimize outcomes like profit or resource usage.

Uploaded by

atif
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views

Operations Research Introduction

Operations research is the application of analytical methods to help make better decisions. It deals with determining optimal solutions to problems involving scheduling, assignment, facility location, and other real-world decisions. Linear programming is an important OR technique that uses mathematical models with an objective function and constraints to optimize outcomes like profit or resource usage.

Uploaded by

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

Operations Research (OR)

What is Operations Research?


• It is a discipline that deals with the application
of advanced analytical methods to help make
better decisions.
• Concerned with determining the maximum
(profit, performance, or yield) or minimum
(loss, risk, or cost) of some real world
objective.
Applications
• Manufacturing (determining the product mix)
• Scheduling (airlines, buses)
• Assignment (assigning crew to flights,
employees to projects)
• Facility location (deciding most appropriate
location for factory ware house)
• Health services (information and supply chain
management)
Mathematical Operations Research
Models
Identification of three main components:
1. Decision alternatives (decision variables)
2. Restrictions/constraints
3. Objective function
Operations Research Techniques
• Linear programming
• Dynamic programming
• Integer programming
• Non-linear programming
• Goal programming
• Network programming
Simulation Modeling
• An alternative approach to modeling complex
systems
• Imitates the actual behavior of the real system
• Flexible as compared to mathematical
modeling
Principal Phases for Implementing OR
1. Definition of the problem
2. Construction of the model
3. Solution of the model
4. Validation of the model
5. Implementation of the solution
Linear Programming (LP)

• A mathematical modeling technique designed


to optimize the usage of limited resources.
• Maximizing or minimizing the linear objective
function subjected to linear constraints
Construction of LP Model
• Decision variables that we seek to determine
• Objective that we want to optimize
• Constraints that we need to satisfy
Linear Programming Problem 1
Consider a chocolate manufacturing company which
produces only two types of chocolate – A and B. Both the
chocolates require Milk and Choco only. To manufacture
each unit of A and B, following quantities are required:
• Each unit of A requires 1 unit of Milk and 3 units of Choco
• Each unit of B requires 1 unit of Milk and 2 units of Choco
The company kitchen has a total of 5 units of Milk and 12
units of Choco. On each sale, the company makes a profit
of
• Rs 6 per unit A sold
• Rs 5 per unit B sold.
Now, the company wishes to maximize its profit. How
many units of A and B should it produce respectively?
Linear Programming Problem 2

• A firm uses lathes, milling machines and grinding


machines to produces two parts. The following
table represents the machining time required for
each part, the machining time available on
different machines, and the profit for each part.
Type of Machine Machining time required for Max. time
machined parts (minutes) available per
week (minutes)
Part I Part II
Lathe machine 12 6 3000
Milling Machine 4 10 2000
Grinding machine 2 3 900
Profit per unit Rs. 40 Rs. 100

Formulate the linear programming problem to find


the number of parts I and II to be manufactured in
order to maximize profit.
Linear Programming Problem 3
• Food X contains 6 units of vitamin A per gram
and 7 units of vitamin B per gram and costs
Rs. 12 per gram. Food Y contains 8 units of
vitamin A per gram and 12 units of vitamin B
per gram and costs Rs. 20 per gram. The daily
minimum requirement of vitamin A and
vitamin B is 100 units and 120 units
respectively. Find the minimum cost of
product mix

You might also like