Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

Linear Programming

Linear Programming: Apportionment and Voting

Uploaded by

Clariza Villar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Linear Programming

Linear Programming: Apportionment and Voting

Uploaded by

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

Section 7.3.

Linear
Programming
Linear Programming
 was invented by a mathematician named George Dantzig. His
idea about linear programming was to consider any business
variable (e.g. manufacturing, scheduling, or distribution) and
formulate a mathematical linear model that would optimize the
business objective. Essentially, optimizing the business objective
means to find the maximum profit or minimum cost considering
various constraints.
Terminologies in Linear
Programming
1. An objective function is an equation which is minimized or
maximized. This illustrates the relationship between variables of
interest with a goal.
2. Structural constraints refer to the restrictions in terms of the
available resources.
3. Non-negativity refers to the decision variable that subjects the
linear programming model to zero or positive values.
4. An optimal solution refers to the set of values that yields the
maximum profit or minimum cost.
5. The feasible region is the common region determined by all
constraints (i.e. structural and non-negativity constraints).
Linear Programming:
Maximization
Examples:
1. A shop sells two kinds of dolls, A and B. The shop owner pays
Php45 and Php50 for each piece of doll A and B respectively. One
piece of toy A earns a profit of Php50 while doll B yields a profit of
Php75. The shop owner approximates that no more than 2,000
dolls will be sold every month and she does not want to exceed
the cost of Php20,000. How many units of each type of doll should
be produced in order to maximize profit?
Solution:
a. Express the given values through a table. We begin by
understanding the constraints of the problem through a table.
Let x- quantity of Doll A; y- quantity of Doll B.

Variables x y Available

Quantity 1 1 2,000

Price 50 75 20,000

Profit 45 50
b. Define the constraints and the objective function.
Objective function: P= 45x+50y
Subject to the following constraints:

x+y≤2000
50x+75y≤20,000➡️Structural Constraints

x20;y200➡️Non-negativity Constraints

Note: Use P if the problem is maximization and C if it is


minimization.
c. Graph each constraint in a Cartesian coordinate system and
determine the feasible region (solution set).

d. After finding the feasible solution, determine the coordinates of


the extreme points (i.e., vertices of the triangle). Notice that the
vertices have coordinates (0, 266.28) and (400,0).
e. Calculate the profit by substituting the extreme points in the
objective function.
Extreme Points Profit (P=45x+50y)

(0,266.28) 45(0)+50(0,266.28)=13,314

(400,0) 45(400)+50(0)=18,000

f. Formulate the decision.


Observe that the highest value of 18,000 was obtained from the
coordinate, (400,0) - optimal solution. Hence, there should be 400
pieces of Doll A to be produced in order to maximize the profit of
Php18,000.
2.Maximize: P = 10x + 20y

Subject to:
2x + 6y <= 24
6x + 3y <18
x+y<4
X,y>0

Solution:
a. In this problem, we are already given the linear programming
model. So, we graph each constraint in a Cartesian coordinate
system and determine the feasible region (solution set) and
extreme points.
b. Observe that in the graph, we need to find for the intersection
of x + y = 4 and 6x + 3y = 18 (we'll leave it as your exercise!).
The point of intersection is (2,2).
So,
Extreme Points Profit
(P=10x+20y)
(0,4) 10(0)+20(4)=80

(2,2) 10(2)+20(2)=60

(3,0) 10(3)+20(0)=30

c. Formulate the decision.


Notice that the highest value of 80 was obtained from the
coordinate, (0,4), hence the optimal solution. Therefore, there
should be 0 unit of x and 4 units of y to be produced in order to
maximize the profit of Php80.
Linear Programming:
Minimization
Examples:
1. A purchasing manager of a food manufacturing company wants
to determine the supply mix that would minimize the cost. A
gallon of milk product A can produce 5 cases of cheese, 7 cases
of butter, and 9 cases of cream. A gallon of milk product B can
produce 11 cases of cheese, 8 cases of butter, and 4 cases of
cream. He must produce 110 cases of cheese, 112 cases of
butter, and 72 cases of cream per day. Milk product A costs
Php350 per gallon while milk product B costs Php400 per gallon.
How many gallons of each milk product should he purchase per
day to minimize the cost?
Solution:
a. Express the given values in a table.
Let x- milk product A; y- milk product B.

Product x y Requirement

Cheese 5 11 110

Butter 7 8 112

Cream 9 4 72

Cost 350 400

b. Define the constraints and the objective function.


Objective function: C = 350x + 400y
Subject to the following constraints:
5x + 11y >= 110
7x + 8y >= 112
9x + 4y >= 72
x >= 0; y >= 0
c. Graph each constraint in a Cartesian coordinate system and
determine the feasible region (solution set) and extreme points.
d. Compute the cost by substituting the extreme points to the
objective function.

Extreme Points Cost (C=350x+400y)

(0, 18) 350(0)+400(18)=7200

(2.91, 11.45) 350(2.91)+400(11.45)=559


8.5
(9.51, 5.56) 350(9.51)+400(5.56)=5552.
5
(22, 0) 350(22)+400(0)=7700

You might also like