Scribd
Upload
45 views16 pages

Operations Research: Dr. A V Prajeesh

Operations research is used to optimally allocate scarce resources. Linear programming is a widely used operations research technique used to maximize profits or minimize costs by optimizing decision variables subject to constraints. It was innovated by George Dantzig to solve logistics problems and has since spread to many management applications. A linear programming problem involves optimizing a linear objective function subject to linear constraints and non-negativity restrictions on variables.

Uploaded by

ADLURI SRIKAR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views16 pages

Operations Research: Dr. A V Prajeesh

Operations research is used to optimally allocate scarce resources. Linear programming is a widely used operations research technique used to maximize profits or minimize costs by optimizing decision variables subject to constraints. It was innovated by George Dantzig to solve logistics problems and has since spread to many management applications. A linear programming problem involves optimizing a linear objective function subject to linear constraints and non-negativity restrictions on variables.

Uploaded by

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

Operations Research

Dr. A V Prajeesh

December 12, 2021

Dr. A V Prajeesh December 12, 2021 1 / 16


Each and every organization aspires for optimal utilization of its limited scarce resources
like men, money, materials, machines, methods and time to reach the targets.

The results are generally measured in terms of profits, losses, return on money invested,
etc.

To achieve these results, the decision-maker has to have thorough knowledge about the
tasks or jobs and the relationships among them.

Among the popular techniques of Operations Research, Linear Programming deserves


mention because it is one of the widely used techniques. And it is a deterministic model.

In other words, Linear Programming is one of the important Operations Research tools
used to allocate scarce resources in an optimal way so that the allocator can optimize the
results either by maximizing the profits or minimizing the costs.

Dr. A V Prajeesh December 12, 2021 2 / 16


The credit of innovating this technique goes to George B. Dantzig. He innovated this
technique while he was working for U.S. Air force during World War II, 1947.

Initially, this technique was used to solve tough logistic problems like assignment and
transportation but instantly the application of this technique has spread to almost every
functional area of management, production planning and control, personnel management,
advertising and promotion.

Dr. A V Prajeesh December 12, 2021 3 / 16


The general Linear Programming Problem calls for optimizing (maximizing/minimizing) a
linear function for variables called the objective function subject to a set of linear equations
and/or inequalities called the constraints or restrictions.

Dr. A V Prajeesh December 12, 2021 4 / 16


Major terminologies:

Decision Variables and their Relationships: The decision variable refers to any candidate
(person, service, projects, jobs, tasks) competing with other decision variables for limited
resources. These variables are usually interrelated in terms of utilization of resources and
need simultaneous solutions, i.e., the relationship among these variables should be linear.

Objective Function: The Linear Programming Problem must have a well defined objective
function to optimize the results. For instance, minimization of cost or maximization of
profits. It should be expressed as linear function of decision variables (Z = X1 + X2 ,
where Z represents the objective, i.e., minimization/maximization, X1 and X2 are the
decision variables directly affecting the Z value).

Dr. A V Prajeesh December 12, 2021 5 / 16


Constraints: There would be limitations on resources which are to be allocated among
various competing activities. These must be capable of being expressed as linear
inequalities or inequalities in terms of decision variables.

Alternative Courses of Action: There must be presence of alternative solutions for the
purpose of choosing the best or optimum one.

Non-Negativity Restrictions: All variables must assume non-negative values. If any of the
variable is unrestricted in sign, a tool can be employed which will enforce the negativity
without changing the original information of a problem.

Linearity and Divisibility: All relationships (objective function and constraints) must
exhibit linearity.

Dr. A V Prajeesh December 12, 2021 6 / 16


Deterministic: In Linear Programming it is assumed that all model coefficients are
completely known. For example: profit per unit.

Dr. A V Prajeesh December 12, 2021 7 / 16


A firm manufactures 2 types of products A and B and sells them at a profit or Rs 2 on type A
and Rs 3 on type B. Each product is processed on 2 machines G and H. Type A requires 1
minute of processing time on G and 2 minutes on H. Type B requires one minute on G and 1
minute on H. The machine G is available for not more than 6 hrs. 40 mins. while machine H
is available for 10 hrs. during any working day. Formulate the problem as LPP with an aim to
have maximum profit.

Dr. A V Prajeesh December 12, 2021 8 / 16


Let x1 be the no. of products of type A and x2 be the no. of products of type B

Since the profit on type A is Rs 2 per product, 2x1 - will be the profit on selling x1 units of
type A.
Similarly 3x2 will be the profit on selling x2 units of type B.
Hence the objective function will be, Maximize Z = 2x1 + 3x2 is subject to constraints.
Since machine G takes one minute on A and one minute on B, the total number of minutes
required is given by x1 + x2 . Similarly, on machine H 2x1 + x2 .
But G is not available for more than 400 minutes.
Therefore, x1 + x2≤ 400 and H is not available for more than 600 minutes, therefore,
2x1 + x2≤ 600 and x1 , x2, ≥ 0,

Dr. A V Prajeesh December 12, 2021 9 / 16


Maximize Z = 2x1 + 3x2
x1 + x2 ≤ 400 (time availability constraints)
2x1 + x2 ≤ 600
x1 ,x2 ≥ 0 (Non-negativity constraints)

Dr. A V Prajeesh December 12, 2021 10 / 16


2. At a university, Professor Symons wishes to employ two people, John and Mary, to grade
papers for his classes. John is a graduate student and can grade 20 papers per hour; John
earns Rs 15 per hour for grading papers. Mary is an post-doctoral associate and can grade 30
papers per hour; Mary earns Rs 25 per hour for grading papers. Each must be employed at
least one hour a week to justify their employment. If Prof. Symons has at least 110 papers to
be graded each week, how many hours per week should he employ each person to minimize
the cost?
Solution
We choose the variables as follows:
Let x = The number of hours per week John is employed.
and y = The number of hours per week Mary is employed.
The objective function is
Dr. A V Prajeesh December 12, 2021 11 / 16
Minimize Z=15x+25y
The fact that each must work at least one hour each week results in the following two
constraints:
x ≥ 1, y ≥ 1
Since John can grade 20 papers per hour and Mary 30 papers per hour, and there are at least
110 papers to be graded per week, we get
20x+30y ≥ 110
The fact that x and y are non-negative, we get
x ≥ 0, and y ≥ 0.

Dr. A V Prajeesh December 12, 2021 12 / 16


Minimize Z=15x+25y
x ≥ 1, y ≥ 1
20x+30y ≥ 110
x ≥ 0, and y ≥ 0.

Dr. A V Prajeesh December 12, 2021 13 / 16


3. A firm manufactures 3 types of products A, B and C . The profits are 3, 2 and 4
respectively. The firm has 2 machines and below is the required processing time in minutes for
each machine from product.
Machine Product
A B C
C 4 3 5
D 3 2 4
Machine C and D have 2,000 and 2,500 machine minutes respectively. The firm must
manufacture 100 A′ s, 200 B′ s and 50C′ s but not more than 150 A′ s. Formulate an LPP to
maximize the profit.

Dr. A V Prajeesh December 12, 2021 14 / 16


Solution: Let x1 be the type of product A x2 be the type of product B x3 be the type of
product C Therefore the objective function will be, Maximize

Z = 3x1 + 2x2 + 4x3

(Subject to constraints)

4x1 + 3x2 + 5x3 ≤ 2, 000


(Machine hour constraints)
3x1 + 2x2 + 4x3 ≤ 2, 500
x1 ≤ 150 or 0 ≤ x1 ≤ 150

0 ≤ x2 ≤ 200 (Production constraint)

0 ≤ x3 ≤ 50
x1 , x2 , x3 ≤ 0 (Non-negativity constraints)
Dr. A V Prajeesh December 12, 2021 15 / 16
Solution by graphical method.

Dr. A V Prajeesh December 12, 2021 16 / 16

You might also like