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

Solving LP Problems by Graphical Solution

1) Linear programming is a mathematical technique for solving optimization problems with linear objective functions and constraints. It involves defining variables, constraints, and an objective function to either maximize or minimize. 2) The document provides two examples of using linear programming to solve optimization problems - one involving maximizing profit for a tailor and the other minimizing cost for a drug company. 3) Both examples involve defining variables, constraints on resources, an objective function to optimize, plotting the feasible region, finding corner point solutions, and checking that the optimal solution satisfies all constraints. The tailor example maximizes profit while the drug company example minimizes cost.

Uploaded by

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

Solving LP Problems by Graphical Solution

1) Linear programming is a mathematical technique for solving optimization problems with linear objective functions and constraints. It involves defining variables, constraints, and an objective function to either maximize or minimize. 2) The document provides two examples of using linear programming to solve optimization problems - one involving maximizing profit for a tailor and the other minimizing cost for a drug company. 3) Both examples involve defining variables, constraints on resources, an objective function to optimize, plotting the feasible region, finding corner point solutions, and checking that the optimal solution satisfies all constraints. The tailor example maximizes profit while the drug company example minimizes cost.

Uploaded by

Hazel Pacheco
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

SOLVING LINEAR PROGRAMMING PROBLEMS

BY GRAPHICAL SOLUTIONS

In this section, the following essential terms are relevant to establish a common frame of
reference as to how the text works:

1. Linear Programming
Linear programming is a mathematical method of solving problems (such as the
allocation of resources) by means of linear functions where the variables involved
are subject to constraints.

2. Objective Function
Objective function is an expression, which shows the relationship between the
variables in the problem and the firm’s goal. The goal of linear programming is to
find the values of the variables that maximize or minimize the objective function.

3. Constraint
A constraint is an inequality that defines how the values of the variables in a
problem are limited. In order for linear programming techniques to work, all
constraints should be linear inequalities. There are two types of constraints:
Explicit Constraints are the limited availability of resources.
Implicit Constraints are constraints that restrict all the variables to zero or positive.
These constraints are also written: x ≥ 0 and y ≥ 0.

4. Feasible Region
Feasible region is the set of combinations of values for the decision variables that
satisfy the conditions and all the constraints.

5. Extreme Points
Extreme points are the corners of the feasible region. If a linear programming
problem has a solution, there is always at least one extreme point solution.

6. Optimal Solution
Optimal Solutions is a combination of the decision variables amounts that yields the
best possible value at the objective function and satisfies all constraints.

1
7. Corner Point Rule
Corner Point Rule says that the corners in the feasible region usually the values of
the variables that maximize or minimize the objective function.

ESSENTIAL LANGUAGE

Linear programming is also an optimization technique for a system of linear constraints and
a linear objective function. A linear programming problem involves constraints that contain
inequalities. Due to difficulties with strict inequalities < and >, we will only focus on ≤ and ≥.

Example 1: A tailor has the 18 sq. meter cotton, 20 sq. meter silk, and 5 sq. meter wool. A
wedding gown requires 3 sq. meters cotton, 2 sq. meters silk and 1 sq. meter wool. A groom’s
suit requires 2 sq. meter cotton and 4 sq. meter silk. If a gown sells for P 1 200.00 and a suit sells
for P 1 600.00, how many of each garment should the tailor make to obtain the maximum
amount of money?

Solution:
a. Represent the unknown:
Let x be the unit for the gown. Let y be the unit for the suit.

b. Tabulate the data about the facts.


Products Resources
Cotton (sq m) Silk (sq m) Wool (sq m)
Gown 3 2 1
Suit 2 4 0
Availability 18 20 5
c. Formulate the objective function and constraints by restating the information in
mathematical form.

Objective: Maximization
Objective Function: Z = P 1200x + P 1 600y

Constraints:
Explicit Constraints: 3x + 2y ≤ 18 sq m Cotton
2x + 4y ≤ 20 sq m Silk
x ≤ 5 sq m wool
Implicit Constraints: x ≥ 0 , y ≥ 0

2
d. Plot the constraints in the problem on a graph.

Identify the area that satisfies the constraints which is the feasible region.

B (0,5)
2x + 4y ≤ 20

D (4, 3)

E (5, 1.5)

A (0,0)
C(5,0)

e. Identify the extreme points and substitute to the Objective Function.

Extreme Points Z = P 1200x + P 1 600y Z


A (0,0) P1200 (0) + P1600 (0) P0.00
B (0,5) P1200(0) + P1600(5) P8000.00
C (5,0) P1200(5) + P1600(0) P6000.00
D (4, 3) P1200(4) + P1600(3) P9600.00
E (5, 1.5) P1200(5) + P1600(1.5) P8400.00
Use the corner point rule to identify possible answers.

f. Formulate the decision. State the conclusion.

The combination that gives the greatest revenue is D(4,3).

3
Therefore, the tailor must make 4 gowns and 3 suits to achieve the maximized revenue
at P 9600.00.

g. Checking
Check if there are constraints that were not satisfied.

Let x = 4 and y = 3
Explicit Constraints: 3x + 2y ≤ 18 sq m Cotton 3(4) + 2(3) ≤ 18
2x + 4y ≤ 20 sq m Silk 2(4) + 4(3) ≤ 20
x ≤ 5 sq m wool 4≤5
Implicit Constraints: x ≥ 0 , y ≥ 0 4 ≥ 0, 3 ≥ 0

All constraints are satisfied.

Example 2: A Drug Company produces a drug from two ingredients. Each ingredient contains
the three antibiotics in different proportions. Each ingredient 1 produced results P 80.00 in cost
while each ingredient 2 results in P 50.00 cost. The production of antibiotics depends on the
availability of the following limited resources.

Antibiotic Resources Requirement Minimum


Requirement
Ingredient 1 Ingredient 2
Antibiotic 1 3 units 1 unit 6
Antibiotic 2 1 unit 1 unit 4
Antibiotic 3 2 units 6 units 12

The company wants to determine the number of grams of each ingredient 1 and 2 that must go
in to drug in order to meet the antibiotic’s minimum requirements at the minimum cost.

Solution:
a. Represent the unknown:
Let x be the number of grams of ingredient 1. Let y be the number of grams of
ingredient 2.

4
b. Tabulate the data about the facts.
Antibiotic Resources Requirement Minimum
Requirement
Ingredient 1 Ingredient 2
Antibiotic 1 3 units 1 unit 6
Antibiotic 2 1 unit 1 unit 4
Antibiotic 3 2 units 6 units 12

c. Formulate the objective function and constraints by restating the information in


mathematical form.

Objective: Minimization
Objective Function: Z = P80x + P50y
Constraints:
Explicit Constraints: 3x + y ≥ 6 units Antibiotic 1
x + y ≥ 4 units Antibiotic 2
2x + 6y ≥ 12 units Antibiotic 3

Implicit Constraints: x ≥ 0 , y ≥ 0

d. Plot the constraints in the problem on a graph.

5
A (0,6)

C (1, 3)

B(3,1)

D (6,0)

Identify the area that satisfies the constraints which is the feasible region.

The feasible region is an unbounded region because the sign used is ≥.

e. Identify the extreme points and substitute to the Objective Function.

Extreme Points Z = P 80x + P 50y Z


A (0,6) P80 (0) + P50(6) P300.00
B (1,3) P80 (1) + P50(3) P230.00
C (3,1) P80 (3) + P50(1) P290.00
D (6, 0) P80(6) + P50(0) P480.00
Use the corner point rule to identify possible answers.

6
f. Formulate the decision. State the conclusion.
The combination that gives the least cost is B(1,3).

Therefore, to meet the requirement at minimum cost at P230.00, there must be 1 unit of
Ingredient 1 and 3 units of Ingredient 2.

g. Checking

Check if there are constraints that were not satisfied.

Let x = 1 and y = 3

Explicit Constraints: 3x + y ≥ 6 units Antibiotic 1 3(1) + (3) ≥ 6


x + y ≥ 4 units Antibiotic 2 1+3≥4
2x + 6y ≥ 12 units Antibiotic 3 2(1) + 6(3) ≥ 12
Implicit Constraints: x ≥ 0 , y ≥ 0 1 ≥ 0, 3 ≥ 0
All constraints are satisfied.

Self-Help

You can also refer to the following references to further understand the lesson:
1) Kolluri, B., Panik, M. J., & Singamsetti, R. N. (2016). Introduction to quantitative methods in business: With
applications using microsoft office excel. Retrieved from https://ebookcentral.proquest.com

2) Baker, K. R. (2015). Optimization modeling with spreadsheets. Retrieved from


https://ebookcentral.proquest.com

3) Ramamurthy,P. (2000). Operations research. Retrieved from https://ebookcentral.proquest.com

4) Guiasu, S. (2009). Probablistic models in operations research. Retrieved from


https://ebookcentral.proquest.com

You may refer to the following in solving LP problems using Excel:

1) https://www.msubillings.edu/asc/writingcenter/resources/math/tutorials/finitemathhelps/Lin%20Prog
%20with%20Excel.pdf

2) https://math-faq.com/wp/wp-content/uploads/simplex_excel.pdf

7
Let’s Check

Activity 1. Find the Maximum or the Minimum Value for the Objective Function for each
set of constraints.

1.

2.

3.

8
4.

9
Activity 2. Translate the following word problems into its equivalent system of equations. And
solve using Excel. Refer to the given source for solving using Excel.

1. The sum of two numbers is 79, and their difference is 23. What are the two numbers?

2. A minor league ballpark attracts 88 fans and draws in ₱553 in revenue from ticket sales. A
child's ticket costs ₱4 and an adult's ticket is ₱7. How many of each type of ticket were sold?

3. A woman owns 21 pets. Each of her pets is either a cat or a bird. If the pets have a total of
76 legs, and assuming that none of the bird's legs are protruding from any of the cats' jaws,
how many cats and how many birds does the woman own?

4. The Lopez family had a rectangular garden with a 20-foot perimeter. They enlarged their
garden to be twice as long and three feet wider than it was originally. They had to, since
their cherry tomato plants were getting out of control. The enlarged garden has a 40-foot
perimeter. What were the dimensions of the original garden?

5. Sarah buys 2 pounds of jellybeans and 4 pounds of chocolates for ₱4.00. She then buys 1
pound of jellybeans and 4 pounds of caramels for ₱3.00. She also buys 1 pound of jellybeans,
3 pounds of licorice and 1 pound of caramels for ₱1.50. How much will it cost to buy 1 pound
of each of the four candies?

Let’s Analyze

Answer the following items.

1. Explain in your own words the concept of linear programming.


_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

2. Explain in your own words the procedure of linear programming


_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

10
3. Explain in your own words the concept of maximization
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

4. Explain in your own words the concept of minimization.


_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

In A Nutshell

Write two significant ideas that you learned about the following concepts.

1. Linear Programming ______________________________________________________________

2. Maximization _____________________________________________________________________

3. Minimization _____________________________________________________________________

4. Corner Point Rule _________________________________________________________________

5. Feasible Region __________________________________________________________________

6. Explicit Constraints ________________________________________________________________

7. Implicit Constraints________________________________________________________________

Q and A

Do you have any question for clarification? Write them below.

11
QUESTIONS/ISSUES ANSWERS

1.

2.

3.
Keywords Index
4.

5.

Objective Function Linear Programming Constraints

Explicit Constraints Implicit Constraints Extreme Points

Optimal Solutions Corner-Point Rule

12

You might also like