Scribd
Upload
13 views23 pages

Quantitative Methods Project

The document discusses solving linear programming problems using graphical and transportation methods. It provides tips for using these methods and works through examples, including finding the optimal production plan to maximize profits given constraints, and solving a transportation problem using Vogel's approximation method.

Uploaded by

22-0136c
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
13 views23 pages

Quantitative Methods Project

The document discusses solving linear programming problems using graphical and transportation methods. It provides tips for using these methods and works through examples, including finding the optimal production plan to maximize profits given constraints, and solving a transportation problem using Vogel's approximation method.

Uploaded by

22-0136c
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/ 23

QM PROJECT

Antonia Dalglish
BSIT - 2A
Graphing
Method
Linear programming is the simplest way of optimizing a problem. Through this
method, we can formulate a real-world problem into a mathematical model.
There are various methods for solving Linear Programming Problems and one of
the easiest and most important methods for solving LPP is the graphical method.
In Graphical Solution of Linear Programming, we use graphs to solve LPP.
We can solve a wide variety of problems using Linear programming in different
sectors, but it is generally used for problems in which we have to maximize
profit, minimize cost, or minimize the use of resources. In this article, we will
learn about Solutions of Graphical solutions of linear programming problems,
their types, examples, and others in detail.
HELPFUL TIPS

In linear programming graphing method word problems, start by identifying


decision variables and formulating an objective function, expressing what you
want to maximize or minimize. Translate constraints into mathematical
inequalities, graph them, find the feasible region, and locate corner points
where constraints intersect. Evaluate the objective function at these corners to
determine the optimal solution. Consider real-world practicalities and practice
regularly to improve problem-solving skills.
Word Problem 1
A beverage manufacturer is looking to maximize profits by producing two types
of soft drinks: Cola and Beer. The manufacturer has limited resources and wants
to determine the optimal daily production plan to maximize profit. Each gallon
of cola yields a profit of $4, and each gallon of Beer yields a profit of $5.
There's a requirement to produce at least 120 gallons daily. However, the
manufacturer has constraints on the number of gallons that can be produced
and wants to ensure a minimum production cost of $300. The cost of producing
a gallon of Cola is $3, and the cost of producing a gallon of Beer is $2. Find the
optimal daily production plan that maximizes profit.
Step 1: identify variables and constraints

Product Profit Cost

X 4 3

Y 3 2

x+y>=120 4x+5y 3x+2y<=300


Let X represent the number of
Cola.
Step 2: turn the constraints into points

x + y >= 120 x=0 y = 120


y=0 x = 120

3x + 2y <= 300 x=0 y = 150


y=0 x = 100
Step 3: graph the points

(120 , 0) (0 , 120) (100 , 0) (0 , 150)


Step 4: perform substitution method

x + y >= 120 3x + 2y <= 300


x >= 120 - y 3(120 - y) + 2y <= 300
x = 120 - (60) 360 - 3y + 2y <= 300
-3y + 2y <= 300 - 360
x = 60 -y = -60

y = 60

Points: (60, 60)


Step 5: identify the vertices

y = 120 y = 150
x + y >= 120 3x + 2y <= 300
x + (120)>= 120 3x + 2(150) <= 300
x + 120>= 120 3x + 300 <= 300
x = 120-120 3x <=300-300
x=0 3y <= 0
y=0
(0,120)
(0,150)
Step 6: solve for the profit

(0,120) (0,150) (60,60)

4(0) + 5(120) = $600


4(0) + 5(150) = $750
4(60) + 5(60) = $540

Maximize: P = 4x + 5y
0 unit of X
150 units of Y
Maximum Profit = $750
Transportation
Method using vogel’s
approximation
method
HELPFUL TIPS
Vogel's Approximation Method (VAM) is a valuable tool for solving
transportation problems. To effectively use VAM, begin by identifying the cells
with the smallest and next smallest transportation costs, and calculate the cost
differences for each row and column. Prioritize selecting the row or column with
the largest difference as it helps in making more efficient allocations. VAM
promotes cost-effective distribution by considering not only the minimum costs
but also the penalties for unfulfilled supply or demand. Regularly update the
cost differences, and continue the process until a balanced solution is achieved.
Keep in mind that Vogel's Approximation Method can lead to optimal solutions
and is a valuable asset for logistics and supply chain management.
Solve the given transportation problem using
Vogel’s approximation method.
Step 1: Identify the least and second least cost in each row and column and
then write the corresponding absolute differences of these values. For
example, in the first row, 2 and 3 are the least and second least values,
their absolute difference is 1.
Step 2: Now, identify the maximum penalty and choose the least value in that
corresponding row or column. Then, assign the min(supply, demand)

Here, the maximum penalty is 3 and the least value in the corresponding
column is 2. For this cell, min(supply, demand) = min(50, 40) = 40

Allocate 40 in that cell and strike the corresponding column since in this
case demand will be satisfied, i.e., 40 – 40 = 0.
3. Now, find the absolute row and column differences for the remaining rows
and columns. Then repeat step 2.
Step 4: Repeat the above step, i.e., step 3. This will give the below result.
Step 5: Again repeat step 3, as we did for the previous step.
Step 6: Now, again repeat step 3 by calculating the absolute differences for
the remaining rows and columns.
Step 7: In the previous step, except for one cell, every row and column
vanishes. Now, allocate the remaining supply or demand value for that
corresponding cell.
Total cost = (10 × 3) + (25 × 7) + (25 × 2) + (40 × 2) + (20 × 2) + (15 × 3)
= 30 + 175 + 50 + 80 + 40 + 45
= 420
Thank you!

You might also like