[go: up one dir, main page]
Scribd
Upload
372 views12 pages

Management Science Lecture 2 Graphical Method

Linear programming was developed by George Dantzig in the 1940s to help the US Air Force efficiently distribute resources across different fronts in World War 2. It is a mathematical technique that models decision problems as linear objective functions and constraints to find the optimal solution. The graphical method represents problems with two decision variables on a graph to identify the feasible region where all constraints are satisfied. The optimal solution will occur at an extreme or corner point of this region, maximizing profits or minimizing costs.

Uploaded by

Anne Maerick Jersey Otero
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
372 views12 pages

Management Science Lecture 2 Graphical Method

Linear programming was developed by George Dantzig in the 1940s to help the US Air Force efficiently distribute resources across different fronts in World War 2. It is a mathematical technique that models decision problems as linear objective functions and constraints to find the optimal solution. The graphical method represents problems with two decision variables on a graph to identify the feasible region where all constraints are satisfied. The optimal solution will occur at an extreme or corner point of this region, maximizing profits or minimizing costs.

Uploaded by

Anne Maerick Jersey Otero
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/ 12

Linear Programming –

Graphical method
Linear Programming

 was developed by George Dantzig in the 1940’s.


 Air Force research project concerned with computing the most
efficient an economic way to distribute men, weapons & supply
from different fronts during World War 2.

Programming
 producing a plan or procedure that determined the solution to a
problem.
 Air Force research project concerned with computing the most
efficient an economic way to distribute men, weapons & supply
from different fronts during World War 2.
Linear Programming

❖ is a method of dealing decision problems that can be expressed as


constrained linear models. The primary objective of all linear
programming models are certainty of the parameters and linearity
of the objectives function and all constraints.
❖ Is a mathematical technique for finding the best uses of an
organization’s resources.
❖ is initially referred as “programming in a linear structure”
Graphical Solution Method

 is a two-dimensional geometric analysis of Linear Programming


problems with two decision variables.
 the theory of linear programming states that the optimal solution will
lie at a corner point of the feasible region.
Solving Linear Programming
Problem Graphically
A. Linear Programming Problems
in two unknowns X and Y is one in which we are to determine the maximum
and minimum value of a linear expression.
P = 𝒂𝟏 𝑿 + 𝒃𝟏 𝐘 (𝐟𝐨𝐫 𝐦𝐚𝐱𝐢𝐦𝐢𝐳𝐚𝐭𝐢𝐨𝐧)

C = 𝒂𝟏 𝑿 + 𝒃𝟏 𝐘 (𝐟𝐨𝐫 𝐦𝐢𝐧𝐢𝐦𝐢𝐳𝐚𝐭𝐢𝐨𝐧)

 Objective function
is an expression, which shows the relationship between the variables in the
problem and the firm’s goal.
Solving Linear Programming
Problem Graphically cont.
 Constraints
Structural constraint – a limit on the availability of resources.
Non-negativity constraint - is the constraint that restricts all the variables to zero
and positive solution.
 Optimal Value – highest value (for maximization problem) and lowest value (for
minimization problem).
 Optimal Solution – combination of decision variable amount that yields the best
possible value of the objective function and satisfies all the constraints.
 Feasible Region – is the set of combinations of values for the decision variables
that satisfy the non-negativity conditions and all constraints simultaneously that is
the allowable decisions.
Solving Linear Programming
Problem Graphically cont.
B. Extreme Point Theorem
The linear objective function will have its optimal solutions as the
extreme points (corner points) of the feasible region whenever the
feasible region is bounded. If the feasible region is unbounded there is
no optimal solution.
C. Fundamental Theorem of Linear Programming Problem
 If a linear programming problem has optimal solution, there is
always at least one extreme point (corner point) solution of the
feasible region.
 A linear programming problem with bounded, nonempty feasible
region always contain optimal solutions.
Solving Linear Programming
Problem Graphically cont.
D. Solving Linear Programming: Maximization Problem
This section will present the solution in maximizing a Linear Programming
model using graphical method.
Steps in Linear Programming
Graphical Method
1. Represent the unknown in the problem.
2. Tabulate the data about the facts if necessary.
3. Formulate the objective function and constraints by restating the information in the
mathematical form (LP model).
4. Plot the constraints of the LP problem on a graph.
5. Identify the feasible region of the linear programming and trace the extreme points of
the graph.
6. Solve the intersection of the lines, which satisfies the feasible solution simultaneously.
Find the possible vertices in the feasible region.
7. Substitute the coordinates at the extreme points on the feasible region to the
objective function.
8. Formulate the decision.
Maximization Problem

 A local boutique produced two designs of gowns A and B and


has the following materials available. 18 square meters of
cotton, 20 square meters of silk, and 5 square meters of wool.
Design A requires the following: 3 square meters of cotton, 2
square meters of silk and 1 square meter of wool. Design B
requires the following 2 square meters of cotton, and 4 square
meters of silk. If design A sells for P1,200 and Design B sell for
P1,600, how many of each garment should the boutique
produce to obtain the maximum amount of money.
Minimization Problem

 A pharmacist produces a drug from two ingredients. Each


ingredient contains the same three antibiotics in different
proportions: 6 units of Antibiotic 1, 4 units of Antibiotic 2 and, 12 units
of Antibiotic 3. Each ingredient A produced results P80 in cost and
each ingredient B results P50 in cost. The production of the
antibiotics is dependent on the availability of limited resources. The
resource requirements for the production are as follows. Ingredient
A requires the following: 3 units of antibiotic 1, 1 unit of antibiotic 2
and, 2 units of antibiotic 3. Ingredient B requires the following: 1 unit
of antibiotic 1, 1 unit of antibiotic 2 and, 6 units of antibiotic 3.
Thank you ☺
PROF. IRAH DIANNE NICOLAS
SEPT. 28, 2021

You might also like