MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research

Linear Programming – Graphical Method

1. A chemical company produces two types of fertilizers. Its NORMAL brand contains Phosphorus and Potassium, at a rate of 6 and 1 units by
weight, respectively. The SPECIAL brand contains the same ingredients at a rate of 3 and 3 units of weight respectively. Each month the
company can rely on a supply of 135 tons of phosphorus and 60 tons of potassium. If the company obtains a profit of Q.300 for each ton of
Normal fertilizer and Q.480 for each ton of Special fertilizer, what quantity of each type of fertilizer should be produced and sold in order to
obtain the maximum profit? Solve by the graphical method and conclude.
SOLUTION
Board
Intermediate Variables
Decision Variables Cost
Match Potassium
X ₁ : Normal Fertilizer 6 1 Q 300.00
X ₂ : Special Fertilizer 3 3 Q 480.00
Restrictions <= 135 Tons <= 60 Tons

FO = Max X₀ = 300X₁ + 480 X₂

SA:
1) 6 X₁ + 3 X₂<= 135
2) X₁ + 3X₂ <= 60
3) X₁, X₂ >= 0 Non-negativity

Convert inequalities into equalities, restrictions.

I. 6X₁+3 X₂= 135

II. X₁+3X₂ = 60

We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the first restriction .
YO. 6X₁+3 X₂= 135

We are going to find the value of X₁, when, X₂ takes a value of We are going to find the value of X₂, when X₁ takes a
“0”. value of “0”.
Substituting values: Substituting values:
X₁=?; X₂=0 X₁=0 ; X₂= ?

6X₁+3 X₂= 135 6X₁+3 X₂= 135

6X₁+3 (0)= 135 6(0)+3 X₂= 135
6X₁+0= 135 0+3 X₂= 135
6X₁= 135 3X₂= 135
X₁= 135/6 X₂= 135/3
X₁= 22.5 X₂= 45
Coordinates of the 1 point of the first constraint: (22.5,0) Coordinates of the 2nd point of the first restriction:
(0.45)
We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the second restriction

YO. X₁+3X₂ = 60

Let's find the value of X₁, when, Let's find the value of X₂, when
X₂ takes a value of “0”. X₁ takes a value of “0”.
Substituting values: Substituting values:
X₁=?; X₂=0 X₁=0 ; X₂= ?

X₁+3X₂ = 60 X₁+3X₂ = 60
X₁+3(0) = 60 (0)+3X₂ = 60
X₁+ 0 = 60 0+3X₂ = 60
X₁ = 60 3X₂ = 60
X₁ = 60/1 X₂ = 60/3
X₁ = 60 X₂ = 20
Coordinates of the 1 point of the second restriction: (60.0) Coordinates of the 1 point of the second restriction:
(0.20)
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA
SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT WEEKEND PLAN
Operations research

Constraint 2
Constraint 1 D) (60,0)
E) (0,20)
A) (22.5,0)
We find the value of Point C. by any method of solution of 2 Equations with 2 Unknowns. I will use the Substitution
B) (0.45)
method.

With the equations of the constraints we find Point C.

I. 6X₁+3 X₂= 135
II. X₁+3X₂ = 60

Solving Equation 2 for the easiest X.

X₁+3 X₂= 60
X₁ = 60 - 3X₂

I substitute the cleared X₁ into Equation 1 and operate. I substitute the cleared X₂ into Equation 2 and operate.
6X₁+3X₂ = 135 X₁+3 X₂= 60
6( 60 – 3X₂) +3 X₂= 135 X₁+3 (15) =60
360 - 18 X₂ + 3 X₂= 135 X₁+45= 60
360 - 135 = 18 X₂ - 3 X₂ X₁ = 60-45
225 = 15 X₂ X₁ = 15
X₂= 225/15
X₂ = 15

Coordinates of point C: (15,15)

We value the feasible solution points in the function Objective FO = Max X₀ = 300X₁ + 480 X₂
Point A (22.5,0)
X₀ = 300X₁ + 480 X₂
X₀ = 300(22.5) + 480 (0)
X₀ = 6,750
Point C (15,15)
X₀ = 300X₁ + 480 X₂
X₀ = 300(15) + 480 (15)
X₀ = 11,700
Point E (0.20)
X₀ = 300X₁ + 480 X₂
X₀ = 300(0) + 480 (20)
X₀ = 9,600

We conclude
As the case is Maximization, we choose the highest result.
15 Tons of NORMAL AND SPECIAL Fertilizer must be produced to obtain a maximum profit of Q 11,700.00.
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research
years
1966 - 2016
2. A company dedicated to the purification of minerals, has two mines A and B. Each ton of ore from the first mine
produces 4 pounds of zinc and 1 pound of molybdenum . Each ton of ore from B produces 8 pounds of zinc and 3 pounds of molybdenum .
The company must produce at least; 16,000 and 5,000 pounds a week of these 2 metals , respectively. If it costs $50 per ton to obtain ore
from A and $60 per ton to extract it from mine B , HOW MUCH ORE MUST BE OBTAINED FROM EACH MINE IN ORDER TO MEET
PRODUCTION REQUIREMENTS AT A MINIMUM COST ? Solve by the graphical method and conclude
IT WILL BE WORKED AS MAXIMIZATION.
SOLUTION
Board
Intermediate Variables
Decision Variables Cost
Zinc Molybdenum
X ₁ : Quantity of Mineral Mine A in Pounds 4lb 1 lb Q50.00
X ₂ : Quantity of Mineral Mine B in Pounds 8lb 3lb Q 60.00
Restrictions <= 16,000 Pounds <= 5,000 Pounds

FO = Max X₀ = 50X₁ + 60 X₂
SA:
1) 4X₁+8 X₂<= 16,000
2) X₁ + 3X₂ <= 5,000
3) X₁, X₂ >= 0 Non-negativity

Convert inequalities into equalities, restrictions.

III. 4X₁+8 X₂= 16,000

IV. X₁ + 3X₂ = 5,000
We find the Intercepts (Point where the line cuts or touches the Cartesian at its points “X” and “Y”) of the first constraint .
plane
YO. 4X₁+8 X₂= 16,000
Let's find the value of X₁, when
Let's find the value of X₂ when, X₂ takes a value of “0”.
X₁ takes a value of “0”. Substituting values:
Substituting values: X₁=? ; X₂= 0
X₁= 0; X₂=?
4X₁+8 X₂= 16,000
4X₁+8 X₂= 16,000 4X₁+8 (0)= 16,000
4(0)+ 8X₂= 16,000 4X₁+0= 16,000
0+ 8X₂= 16,000 4X₁= 16,000
8X₂= 16,000 X₁= 16,000/4
X₂= 16,000/8 X₁= 4000
X₂= 2,000 Coordinates of the 1 point of the first constraint: (4000.0)
Coordinates of the 2nd point of the first restriction: (0.2000)
We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the second restriction

YO. X₁ + 3X₂ = 5,000

Let's find the value of X₂ when We are going to find the value of X₁,
X₁, takes a value of “0”. when X₂ takes a value of “0”.
Substituting values: Substituting values:
X₁= 0 ; X₂= ? X₁= ? ; X₂= 0

X₁ + 3X₂ = 5,000 X₁ + 3X₂ = 5,000

(0) + 3X₂ = 5,000 X₁ + 3(0) = 5,000
3X₂ = 5,000 X₁ + (0) = 5,000
X₂ = 5,000/3 X₁ = 5,000
X₂ = 1,666.67
Coordinates of the 2nd point of the second restriction: ( 0.1667.67 ) Coordinates of the 1st point of the second restriction: ( 5000.0 )

We make the graph with each of the Intercepts

Constraint 1 Constraint 2 D) (0.1667.67)
A) (0.2000) E) (5000.0)
B) (4000.0)
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research

We find the value of Point C. by any method of solution of 2 Equations with 2 Unknowns. I will use the Substitution method.
With the equations of the constraints we find Point C.
I. 4X₁+8 X₂= 16,000
II. X₁ + 3X₂ = 5,000
Solving Equation 2 for the easiest X.
X₁ + 3X₂ = 5,000
X₁ = 5,000 - 3X₂

I substitute the cleared X₁ into Equation 1 and I substitute the cleared X₂ into Equation 2 and
operate. operate.
4X₁+8 X₂= 16,000 X₁ + 3X₂ = 5,000
4( 5,000 - 3X₂) +8 X₂= 16,000 X₁ + 3( 1000) = 5,000
20,000 - 12X₂ +8 X₂= 16,000 X₁ + 3000 = 5,000
20,000 - 4X₂= 16,000 X₁ = 5,000 - 3000
4X₂ =20,000 – 16,000 X₁ = 2000
4X₂ =4,000
X₂ =4,000/4
X₂ = 1000

Coordinates of point C: (2000,1000)

We value the feasible solution points in the function Objective FO = Max X₀ = 50X₁ + 60 X₂

Point D (0.1667.67)
X₀ = 50(0) + 60 (1667.67)
X₀ = 0 + 100,060.20
X₀ = 100,060.20
Point C (2000,1000)
X₀ = 50(2000) + 60 (1000)
X₀ = 100,000 + 60,000
X₀ = 160,000
Point B (4000.0)
X₀ = 50(4,000) + 60 (0)
X₀ = 200,000 + 0
X₀ = 200,000

We conclude
As the case is Maximization, we choose the highest result.
4,000 pounds of Mineral must be obtained from Mine A, to obtain a maximum profit of Q 200,000.00 and meet the minimum production
requirements.
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research
years
1966 - 2016
3. Farm manager V wants to determine the least expensive feed mix for his dairy cows. Studies indicate that each cow should
be provided at least 40 units of nutrient A and 30 units of nutrient B daily. Two commercial foods are available. Each pound of food 1 contains
two units of nutrient A and one unit of nutrient B. Each pound of food two contains one unit of nutrient A and one unit of nutrient B. Food 1
costs Q.5.00 per pound and food 2 costs Q.3.00 per pound. Determine the proportions of feed that go into an optimal mix and calculate the
minimum total cost of feeding a cow. Solve by graphical method.
SOLUTION
Board
Intermediate Variables
Decision Variables Cost
Nutritious A Nutrient B
X ₁ : Food 1 2 1 Q 5.00
X ₂ : Food 2 1 1 Q 3.00
Restrictions >= 40 Units >= 30 Units

FO = Min X₀ = 5X₁ + 3 X₂
SA:
1) 2 X₁ + X₂ >= 40
2) X₁ + X₂ >= 30
3) X₁, X₂ >= 0 Non-negativity

Convert inequalities into equalities, restrictions.

v. 2 X₁ + X₂= 40
SA X₁ + X₂ = 30
W.
We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the first restriction .
II. 2 X₁ + X₂= 40
Let's find the value of X₁, when, Let's find the value of X₂, when
X₂ takes a value of “0”. X₁ takes a value of “0”.
Substituting values: Substituting values:
X₁=? ; X₂=0 X₁=0 ; X₂= ?

2 X₁ + X₂= 40 2 X₁ + X₂= 40
2 X₁ + (0)= 40 2 (0) + X₂= 40
2 X₁ = 40 0 + X₂= 40
X₁ = 40/2 X₂= 40
X₁= 20
Coordinates of the 1 point of the first constraint: (20.0) Coordinates of the 2nd point of the first restriction:
(0.40)
We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the second restriction

II. X₁ + X₂ = 30
We are going to find the value of X₁, when, We are going to find the value of X₂,
X₂ takes a value of “0”. when X₁ takes a value of “0”.
Substituting values: Substituting values:
X₁=?; X₂=0 X₁=0 ; X₂= ?

X₁ + X₂ = 30 X₁ + X₂ = 30
X₁ + (0) = 30 (0)+ X₂ = 30
X₁ + 0 = 30 0+ X₂ = 30
X₁ = 30 X₂ = 30
Coordinates of the 1 point of the second restriction: Coordinates of the 1 point of the second restriction:
(30.0) (0.30)
Constraint 1 Constraint 2
A) (20.0) D) (30.0)
B) (0.40) E) (0.30)
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research

We find the value of Point C. by any method of solution of 2 Equations with 2 Unknowns. I will use the Substitution method. With the
equations of the constraints we find Point C.
I. 2 X₁ + X₂= 40
II. X₁ + X₂ = 30
Solving Equation 2 for the easiest X.
X₁ + X₂ = 30
X₁ = 30 - X₂

I substitute the cleared X₁ into Equation 1 and I substitute the cleared X₂ into Equation 2 and
operate. operate.
2 X₁ + X₂= 40 X₁ + X₂ = 30
2 ( 30 - X₂ )+ X₂= 40 X₁ + ( 20 ) = 30
60 - 2 X₂ + X₂= 40 X₁ + 20 = 30
60 - 40 = 2 X₂ - X₂ X₁ = 30 - 20
20 = X₂ X₁ = 10
X₂= 20 X₁ = 10
X₂ = 20

Coordinates of point C: (10,20)

We value the feasible solution points in the function Objective FO = Min X₀ = 5X₁ + 3 X₂
Point B (0.40)
X₀ = 5X₁ + 3 X₂
X₀ = 5(0) + 3 (40)
X₀ = 120
Point C (10,20)
X₀ = 5X₁ + 3 X₂
X₀ = 5(10) + 3 (20)
X₀ = 110
Point D (30.0)
X₀ = 5X₁ + 3 X₂
X₀ = 5(30) + 3 (0)
X₀ = 150

We conclude
Since the case is Minimization, we choose the lowest result.
10 units of food A and 20 units of food B must be provided, for a minimum food cost of Q 110.00
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research
years
1966 - 2016
4. A diet must contain at least 16 units of carbohydrates and 20 of proteins. Food A contains 2 units of carbohydrates and 4
units of protein, food B contains 2 units of carbohydrates and 1 unit of protein. If food A costs 1.20 quetzales per unit and food B costs
0.80 per unit, how many units of each food should be purchased to minimize costs? Please solve by graphical method.
SOLUTION
Board
Intermediate Variables
Decision Variables Cost
Carbohydrates Proteins
X ₁ : Food A 2 4 Q 1.20
X ₂ : Food B 2 1 Q 0.80
Restrictions >= 16 Units >= 20 Units

FO = Min X₀ = 1.2 X₁ + 0.8 X₂

SA:
1) 2 X₁ + 2 X₂ >= 16
2) 4 X₁ + X₂ >= 20
3) X₁, X₂ >= 0 Non-negativity

Convert inequalities into equalities, restrictions.

VII. 2 X₁ + 2 X₂= 16
VIII. 4 X₁ + X₂ = 20

We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the first restriction .
III. 2 X₁ + 2 X₂= 16

We are going to find the value of X₁, when, X₂ takes a value of We are going to find the value of X₂, when X₁ takes a
“0”. value of “0”.
Substituting values: Substituting values:
X₁=? ; X₂=0 X₁=0 ; X₂= ?
2 X₁ + 2 X₂= 16
2 X₁ + 2 X₂= 16 2 (0) + 2 X₂= 16
2 X₁ + 2 (0)= 16 0 + 2 X₂= 16
2 X₁ + 0 = 16 2 X₂= 16
2 X₁ = 16 X₂= 16/2
X₁ = 16/2 X₂= 8
X₁= 8 Coordinates of the 2nd point of the first restriction:
Coordinates of the 1 point of the first constraint: (8.0) (0.8)
We find the Intercepts (Point where the line cuts or touches the Cartesian plane at its points “X” and “Y”) of the second restriction

III. 4 X₁ + X₂ = 20
We are going to find the value of X₁, when, We are going to find the value of X₂,
X₂ takes a value of “0”. when X₁ takes a value of “0”.
Substituting values: Substituting values:
X₁=?; X₂=0 X₁=0 ; X₂= ?

4 X₁ + X₂ = 20 4 X₁ + X₂ = 20
4 X₁ + (0) = 20 4 (0) + X₂ = 20
4 X₁ = 20 0 + X₂ = 20
X₁ = 20/4 X₂ = 20
X₁ = 5
Coordinates of the 1 point of the second restriction: Coordinates of the 1 point of the second restriction:
(5.0) (0.20)
Constraint 1 Constraint 2
A) (8.0) D) (5.0)
E) (0.20)
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

B) (0.8)
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research

We find the value of Point C. by any method of solution of 2 Equations with 2 Unknowns. I will use the Substitution method. With the
equations of the constraints we find Point C.
I. 2 X₁ + 2 X₂= 16
II. 4 X₁ + X₂ = 20
Solving Equation 2 for the easiest X. X₁= 24/6
4 X₁ + X₂ = 20 X₁ = 4
X₂ = 20 – 4 X₁
Coordinates of point C: (4,4)
I substitute the cleared X₂ into Equation 1 and operate. I substitute the cleared X₁ into Equation 2 and operate.
2 X₁ + 2 X₂= 16 4 X₁ + X₂ = 20
2 X₁ + 2 ( 20 – 4 X₁ )= 16 4 ( 4 ) + X₂ = 20
2 X₁ + 40 – 8 X₁ = 16 16 + X₂ = 20
8 X₁ - 2 x₁ = 40 - 16 X₂ = 20 -16
6 X₁ = 24 X₂ = 4

We value the feasible solution points in the function Objective FO = Min X₀ = 1.2 X₁ + 0.8 X₂

Point A (8.0)
X₀ = 1.2 X₁ + 0.8 X₂
X₀ = 1.2 (8) + 0.8 (0)
X₀ = 9.60
Point C (4,4)
X₀ = 1.2 X₁ + 0.8 X₂
X₀ = 1.2 (4) + 0.8 (4)
X₀ = 8
Point E (0.20)
X₀ = 1.2 X₁ + 0.8 X₂
X₀ = 1.2 (0) + 0.8 (20)
X₀ = 16

We conclude
Since the case is Minimization, we choose the lowest result.
You must purchase 4 units of food A and 4 units of food B, for a minimum food cost of Q 8.00
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research

Linear Programming – Simplex Method

1. A company dedicated to the sale of furniture for commercial use, recently introduced 2 types of furniture to the market,
type 1 is a computer furniture and type 2 is a television furniture. The General Manager asks the workshop administrator to
present a report on how many of these two types of furniture must be produced for the next month if the maximum profit is
to be obtained from them. The production details are as follows: 2 machine hours and 1 labor hour are needed to produce 1
computer cabinet. Each television cabinet requires 6 machine hours and 4 labor hours. For technical reasons, the machine has
a maximum available time of 12 hours per day and labor, 7 hours/day. The profit obtained for each computer furniture is
Q.150.00 and for each television furniture is Q.275.00. Solve by Simplex method.

Intermediate Variables
Decision Variables Cost
Machine Hours Hours, man
X ₁ : Computer Furniture 2 hours 1 Hours Q 150.00
X₂: Television Furniture 6 hours 4 hours Q 275.00
Restrictions <= 12 Hours Daily <= 7 Hours Daily

FO = Max X₀ = 150X₁ + 275 X₂ FO = Max X₀ - 150X₁ - 275 X₂ = 0

SA: SA:
1) 2 X₁ + 6 X₂<= 12 1) 2 X₁ + 6 X₂ + S1 = 12
2) X₁ + 4X₂ <= 7 2) X₁ + 4 X₂ + S2 = 7
3) X₁, X₂ >= 0 Non-negativity 3) X₁, X₂, S1, S2 >= 0 No negativity

Simplex
X0 x1 x2 S1 S2 Solution Output Element
X0 1 -150 -275 0 0 0
S1 0 2 6 1 0 12
S2 0 1 4 0 1 7

Initial Board Entrance

X0 x1 x2 S1 S2 Solution Output Element
X0 1 -150 -275 0 0 0
S1 0 2 6 1 0 12 2
4 7
Exit S2 0 1 • 0 1 M1 1.75

1 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output Element
X0 1 -81.25 5 0 0 68.75 481.25 5
Exit S1 0 0.5 0 1 -1.5 1.5 3m
x2 0 0.25 1 0 0.25 1.75 7

2 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output Element
X0 1 0 0 162.5 -175 725
x1 0 1 0 2 -3 3 -1
1M 1
Exit x2 0 0 1 -0.5 Yo _ 1
•

THEY MAY HAVE COME THIS FAR BECAUSE THERE ARE NO LONGER NEGATIVES IN X₁ OR X₂
IN ENGINEERING WE CONTINUED UNTIL THERE WERE NO NEGATIVES IN ROW X₀
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA
SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT
WEEKEND PLAN
Operations research
years
1966 - 2016
2. A well-known footwear industry launches two new styles of industrial safety shoes, the metallic style and the safety style.
Final Iteration Entrance
Know that the metallic style contributes Q55.00 per unit to the company's profits and the security style contributes Q45.00 per unit, the
general process of elaborationx1of the two stylesx2
X0 S1 within the company;
involves 2 phases S2 the sewingSolution
and the packaging. Output Element
The metallic style
X0 requires 0.30
1 hours in the first
0 department, 0.80175in the second.75The security style 0requires 0.75 and
9000.30 hours of production in each
x1 department0respectively. The hours
1 available per 3month are 1,8000.5
in sewing and 900 hours
0 in packaging.6 Determine the optimal production
S2 volume of each
0 product in order 0 to maximize total1profit. Solve by -0.5
Simplex method. 1 1

The Optimal Solution is Z=900 X1: 6, x2=0

Intermediate Variables
Decision Variables Cost
2294.1 Sew Packing
3000.0 X ₁ : Metallic Style Shoe 0.30 0.80 Q55.00
Safety Style Shoe 0.75 0.30 Q 45.00
Restrictions <= 1,800 Hours <= 900 Hours

MAXIMIZE: X₀= 55 X1 + 45 X2 MAXIMIZE: X₀ - 55 X₁ - 45 X₂

0.30 X1 + 0.75 X2 ≤ 1800 0.3 X₁ + 0.75 X₂ + 1 S₁ = 1800
0.80 X1 + 0.30 X2 ≤ 900 0.8 X₁ + 0.3 X₂ + 1 S₂ = 900
X1, X2 ≥ 0 X₁ , X₂ , S₁ , S₂ ≥
Simplex Entrance
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 -55 -45 0 0 0
S1 0 0.3 0.75 1 0 1800
S2 0 0.8 0.3 0 1 900
1 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 -55 -45 0 0 0
6000
S1 0 0.3 0.75 1 0 1800
1125
S2 0 0.8 0.3 0 1 900
2 Iteration
Output
X0 x1 x2 S1 S2 Solution
X0 Element
1 0 -24.375 0 68.75 61875
S1 0 0 0.6375 1 1 -0.375 1462.5
x2 0 1 0.375 0 1.25 1125
Final Iteration
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 0 0 38.23529412 54.41176471 117794.1176
x1 0 0 1 1.568627451 -0.588235294 2294.117647
x2 0 1 0 -0.588235294 1.470588235 264.7058824

Simplex Entrance
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 -55 -45 0 0 0
S1 0 3/10 3/4 1 0 1800
S2 0 4/5 3/10 0 1 900
1 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 -55 -45 0 0 0
S1 0 3/10 3/4 1 0 1800
S2 0 4/5 3/10 0 1 900
2 Iteration
X0 x1 x2 S1 S2 Solution
X0 1 0 -195/8 0 275/4 61875
S1 0 0 51/80 1 1 -3/8 2925/2
x2 0 1 3/8 0 5/4 1125
Final Iteration
X0 x1 x2 S1 S2 Solution Output
Element
X0 1 0 0 650/17 925/17 2002500/17
x1 0 0 1 80/51 -10/17 39000/17
x2 0 1 0 -10/17 25/17 4500/17
MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research
years
1966 - 2016
3. A blacksmith who has 80 kg of steel and 120 kg of aluminum wants to make touring and mountain bikes to sell.
respectively at 20 and 15 quetzals each to get the maximum benefit. For the walk you will use 1 kg of steel and 3kg of aluminum, and for the mountain 2
kg of both metals. A) How many touring and mountain bikes must be sold to make a profit. Solve it by Simplex method?

Intermediate Variables
Decision Variables Benefit
Steel Aluminum
X ₁ : Touring Bikes 1kg 3kg Q20.00
X₂: Mountain Bikes 2kg 2kg Q 15.00
Restrictions <= 80 Kg <= 120 Kg

FO = Max X₀ = 20X₁ + 15 X₂ FO = Max X₀ - 20X₁ - 15 X₂ = 0

SA: SA:
1) X₁ + 2 X₂<= 80 1) X₁ + 2 X₂ + S1 = 80
2) 3X₁ + 2X₂ <= 120 2) 3 X₁ + 2 X₂ + S2 = 120
3) X₁, X₂ >= 0 Non-negativity 3) X₁, X₂, S1, S2 >= 0 No negativity

Simplex
X0 x1 x2 S1 S2 Solution
X0 1 -20 -15 0 0 0
S1 0 1 2 1 0 80
S2 0 3 2 0 1 120

Initial Board Entrance

X0 x1 x2 S1 S2 Solution
X0 1 -20 -15 0 0 0
S1 0 1 2 1 0 80
Exit S2 0 3 2 0 1 120

1 Iteration Entrance
X0 x1 x2 S1 S2 Solution
X0 1 0 -1.666666667 0 6.666666667 800
Exit S1 0 0 1.333333333 1 -0.333333333 40
x1 0 1 0.666666667 0 0.333333333 40

2 Iteration
X0 x1 x2 S1 S2 Solution
X0 1.00 0.00 0.00 1.25 6.25 850.00
x2 0 0 1 0.75 -0.25 30.00
x1 0.00 1.00 0.00 -0.50 0.50 20.00

In Fractions
1 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output Element
X0 1 -20 -15 0 0 0
S1 0 1 2 1 0 80 80
S2 0 3 2 0 1 120 40

2 Iteration Entrance
X0 x1 x2 S1 S2 Solution Output Element
X0 1 0 -5/3 0 20/3 800
S1 0 0 4/3 1 -1/3 40 30
x1 0 1 2/3 0 1/3 40 60
Final Iteration
X0 x1 x2 S1 S2 Solution
X0 1.00 0.00 0.00 5/4 25/4 850.00
x2 0 0 1 3/4 -1/4 30.00
x1 0.00 1.00 0.00 -1/2 1/2 20.00
 MARIANO GÁLVEZ UNIVERSITY OF GUATEMALA

SCHOOL OF BUSINESS ADMINISTRATION, MARKETING AND MEDICAL VISIT

WEEKEND PLAN
Operations research
years
1966 - 2016
4. On a pig and rabbit breeding farm there is space for concentrate storage of up to 2,300 kg. If each
pork needs 30 kg. of concentrate per month and each rabbit 18 Kg. and it is known that the hours of care required for a pig are 30 and for a rabbit 60,
with 3,500 hours budgeted per month.
Determine the number of animals that should be raised if the sale of each one represents a profit of 525 quetzales per head of pig and 375 quetzales
per head of rabbit, thus optimizing the profit. Solve by simplex method.

Intermediate Variables
Decision Variables Benefit
Concentrated Careful
X ₁ : Pigs 30kg 30 hours Q 525.00
X₂: Rabbits 18kg 60 hours Q 375.00
Restrictions <= 2300 Kg <= 3500 Hours

FO = Max X₀ = 525X₁ + 375 X₂ FO = Max X₀ - 525X₁ - 375 X₂ = 0

SA: SA:
1) 30 X₁ + 18 X₂<= 2300 1) 30 X₁ + 18 X₂ + S1 = 2300
2) 30 X₁ + 60 X₂ <= 3500 2) 30 X₁ + 60 X₂ + S2 = 3500
3) X₁, X₂ >= 0 Non-negativity 3) X₁, X₂, S1, S2 >= 0 No negativity

Simplex
X0 x1 x2 S1 S2 Solution
X0 1 -525 -375 0 0 0
S1 0 30 18 1 0 2300
S2 0 30 60 0 1 3500

1 Iteration Entrance
X0 x1 x2 S1 S2 Solution
X0 1 -525 -375 0 0 0
Exit S1 0 30 18 1 0 2300
S2 0 30 60 0 1 3500

2 Iteration Entrance
X0 x1 x2 S1 S2 Solution
X0 1 0 -60 17.5 0 40250
x1 0 1 0.6 0.033333333 0 76.66666667
Exit s2 0 0 42 -1 1 1200

Final Iteration
X0 x1 x2 S1 S2 Solution
X0 1 0 0 16.07142857 1.428571429 41964.28571
x1 0 1 0 0.047619048 -0.014285714 59.52380952
x2 0 0 1 -0.023809524 0.023809524 28.57142857

In Fractions
1 Iteration

Entrance X0 x1 x2 S1 S2 Solution
X0 1 -525 -375 0 0 0
Exit
S1 0 30 18 1 0 2300
S2 0 30 60 0 1 3500
2 Iteration Entrance
X0 x1 x2 S1 S2 Solution
X0 1 0 -60 35/2 0 40250
x1 0 1 3/5 1/30 0 230/3
Exit
s2 0 0 42 -1 1 1200
Final Iteration
X0 x1 x2 S1 S2 Solution
X0 1 0 0 225/14 10/7 293,750/7
x1 0 1 0 1/21 -1/70 1250/21
x2 0 0 1 -1/42 1/42 200/7