UNIVERSITY OF PERUVIAN WINGS

FACULTY OF BUSINESS AND EDUCATIONAL SCIENCES

PROFESSIONAL SCHOOLS ADMINISTRATION AND BUSINESS

INTERNATIONAL AND ACCOUNTING AND FINANCIAL SCIENCES

OPERATIONS RESEARCH

MSC. MARIO GAUNA CHINO

THEME:Exercises and problems of the graphic method

MEMBERS:

Diana Guerrero

Paola Sarchi

SEVENTH "B"

Tulcán – Ecuador
TOPIC: Exercises and problems of the graphic method
OBJECTIVES

GENERAL OBJECTIVE

Solving problems using the graphical method.

SPECIFIC OBJECTIVES

Determine the steps to develop the problems using the method

graphic.
Analyze the possible solutions that can be presented through the
application of the graphic method in linear programming problems.
Develop foreign trade problems using the graphic method.

JUSTIFICATION

This research was conducted with the aim of optimizing our

knowledge related to problems of the graphical method, which allows us to
having a broader vision allowing to take into account all aspects more
relevant to this topic such as its characteristics, what contributes to the good
academic training through the knowledge acquired. That is why it is
very important the study of this subject.

THEORETICAL FRAMEWORK

GRAPHIC METHOD EXERCISES

 GRAPHIC METHOD FORMULATION PROBLEMS

DIET FORMULATION

A diet must contain at least 16 units of carbohydrates and 20 of

proteins. Food A contains 2 units of carbohydrates and 4 of proteins.
Food B contains 2 units of carbohydrates and 1 of proteins. If the food
A costs 1.20 dollars per unit and B costs 0.80 dollars per unit, how many
How many units of each food should be purchased to minimize costs? What is the
minimum cost?

Alimento A Alimento B Disponibilida

d
Carbohydrate 2 2 16
s
Proteins 4 1 20
Price 1.20 24

Z =1.20x+0.80y Objective Function

2 x +2y ≥ 16

4x+ y ≥ 20 Restrictions

X ;y≥0

X Y 2 x +2y ≥ 16
0 4
2y ≥ 16−2x
8 0
y ≥ 1 6 −2 x/2
 y ≥ 8 −x

4x+ y ≥ 20
X Y
0 20 y ≥ 2 0 −4x
5 0

A
ZBF
B
-30 -20 -10
C

-10

-20

-30

REPLACEMENT

20 - 4x = 8 - x Y=8-X
-4x+x= -20+8 Y = 8-4
-3x = -12 Y=4
x = -12 / -3
X=4

Z =1.20 times+0.80y OBJECTIVE FUNCTION

PA = (0; 20) ZA = 1.20 (0) + 0.80 (20) = 16

PB = (4; 4) ZB = 1.20 (4) + 0.80 (4) = 8//
PC = (8; 0) ZB = 1.20 (8)+0.80 (0) =9.60

DECISION MAKING:

You must buy 4 units of carbohydrates and a units of proteins for

have a minimum cost of $8

Nutrients in fertilizers

A farmer buys fertilizers that contain three nutrients: A, B, and C. The

minimum weekly requirements for these are 80 units of A, 120 units of
Buy 240 units of C. There are two fertilizer mixes with great acceptance in
the market, THE MIX 1 costs 8 soles per bag and contains two units of A
6 units of B and 4 units of C. The mix costs 10 soles per bag.
2 units of A, 2 of B and twelve of C.

How many bags should the farmer buy to minimize costs and meet his needs?
nutrient requirements?

Nutrient Nutrient Nutrient Price

A B C
Mix I 2 6 4 8
Mix II 2 2 12 10
Availability 80 120 240
d

Z =8x+10y Objective Function

2 x +2y ≥ 80
6x+ 2y ≥ 120
4x+12y ≥ 240 Restrictions
X ;y≥0
 X Y 2 x +2y ≥ 80
0 40
2y ≥ 80−2 x
40 0
y ≥ 8 0 −2 x/2
40−
≥yx

6x+ 2y ≥ 120
X Y
2y ≥ 120−6x 0 60
y ≥ 120−6x/2 20 0

y ≥ 6 0 −3x

4x+12y ≥ 240
X Y
0 20 12y ≥ 240 -4x
60 0 y≥240 -4x/12
y ≥ 2 0 −4 /12x

BZBF
20

C
D
-60 -40 -20 20

-20

-40

-60

REPLACEMENT 40 - x = 60 - 3x Y = 40 - X
-x + 3x = 60 - 40 Y = 40 - 10 40 - x = 20 - 4/12x Y = 40 - X
2x = 20 Y = 30 -x + 4/12x = 20 - 40 Y = 40-30
x = 10 -12x + 4x = 240 - 480 Y = 10
-8x = -240
X =-240/-8 x = 30
REPLACEMENT

Z =8x+10y OBJECTIVE FUNCTION

PA = (0; 60) ZA = 8 (0) + 10 (60) = 600

PB = (10; 30) ZB = 8 (10) + 10 (30) = 1100
PC = (30; 10) ZC = 8(30) + 10(10) = 340 //
PD = (60; 0) ZD = 8(60) + 10(0) = 480

DECISION MAKING:

The farmer should buy 3 bags of mix I and 10 bags of mix II to

to have a minimum cost of $340

MINERAL EXTRACTION

A company extracts minerals from a mine, the number of pounds of the minerals
The amounts that can be extracted from each ton of mines 1 and 2 are given in the table.
next, along with the costs per ton of the mines:

MINA 1 MINA 2
MINERAL A 100 lb 200 lb
MINERAL B 200 pounds 50 Lb
COST PER 50 dollars 60 dollars
TON

If the company must produce at least 300 lb of A and 2500 lb of B, how many
Tons from each mine must be processed with the aim of minimizing the cost?
What is the minimum cost?
If the company must produce at least 3000 lb of A and 2500 lb of B, how many
Tons from each mine must be processed with the aim of minimizing costs?
What is the minimum cost?

Mine I Mina II Availability

d
Mineral A 100lb 200 lb 3000lb
Mineral B 200lb 50 lb 2500lb
Cost 50 60

Z =50x+60 years Objective Function

100x+200y ≥ 300 0
200x+50y ≥ 2500 Restrictions
X ;y≥0

X Y 100x+200y ≥ 3000
0 15
200y ≥ 3000−100x
30 0
y ≥ 3000−100x /200
y ≥ 1 5 −0.5x

200x+50y ≥ 2500
X Y
0 50 50y ≥ 2500−200x

y ≥ 5 0 −4x 12.5 0

REPLACEMENT

15-0.5x = 50-4x Y = 50 - 4X
4x = 60 - 40 Y = 50-4(10)
2x = 20 Y = 50 - 40
x = 10 Y = 10

Z =50x+60y OBJECTIVE FUNCTION

PA = (0; 50) ZA = 50(0) + 60(50) = 3000

PB = (10; 10) ZB = 50(10) + 60(10) = 1100

ZBF

B
-60 -40 -20 C
-20

-40

-60

DECISION MAKING:

10 tons from mine I and 10 tons from mine II must be processed for
having a minimum cost of $1100

COST OF CONSTRUCTION

A chemical company is designing a plant to produce two types of

polymers, P1 and P2. The plant must have a production capacity of
At least 100 units of P1 and 420 units of P2 each day. There are two possible
designs for the main reaction chambers that will be included in the plant.
Each type A camera costs 600,000 dollars and is capable of producing 10.
P1 units and 20 units of P2 per day, type B is a more design.
economical, costs 300,000 dollars and is capable of producing 4 units of P1 and 30
P2 units per day.

Due to operating costs, it is necessary to have at least 4 cameras of

each type in the plant. How many cameras of each type should be included for
minimize the construction cost and satisfy the production schedule
required? (assume there is a minimum cost).

Camera A Camera B Availability

d
Polymer P1 10 4 100
Polymer P2 20 30 420
Utility 600000 300000

Z =600000x+300000y Objective Function

10x+ 4y is greater than

0 or equal to 10
20x+30y ≥ 420 Restrictions
X; y ≥ 0

X Y 10x+ 4y ≥ 100
0 25
4y ≥ 100−10x
10 0
y≥100−10x /4
y ≥ 2 5 −5/ 2 x

20 times+30y ≥ 420
X Y
0 14 30y ≥ 420−20x
23.3 0
y≥420−20x /30
 y ≥ 1 4 −2/ 3x

ZBF
10 B

-30 -20 -10 10 C

-10

-20

-30

REPLACEMENT

25 - 5/2x = 14 - 2/3x Y = 25 - 5/2X

150 - 15X = 84 - 4X Y = 25 - 5/2 (6)
-15x + 4x = 84 - 150 Y = 25-15
11x = -66 Y = 10
x=6

Z =600000x+300000y OBJECTIVE FUNCTION

PA = (0; 25) ZA = 600000(0) + 300000(25) = 7500000

PB = (6; 10) ZB = 600000(6) + 300000(10) = 6600000//
PC = (23.3; 0) ZC = 600000(23.3)+300000 (0) = 13980000
DECISION MAKING:

It is necessary to include 6 type A cameras and 10 type B cameras to have a cost

minimum of $6,600,000

A freight company handles shipments for two companies A and B, located in the
same city. Company A sends boxes that weigh 3 Kg and have a volume of
2 feet3Company B sends 1-foot boxes 3weighing 5kg each. Both A
Like B, they send to the same destination. The transportation cost per box of A is
$0.75 and B's is $0.50. The freight company has a truck with 2400
pies3of space for cargo and a maximum capacity of 9200 kg. On a journey,
develop a program to find out how many boxes of each company need to be transported
this truck so that the freight company receives maximum income.

Kg Feet
Table Volume Utility
Company A 3 2 0.75
Company B 5 1 0.50
Availability 9200 2400

Maximize

Z =0.75x+0.50y

Subject to:

1) 3x+5y ≤ 9200

2) 2 x + y≤2400

1) 3x+5y ≤ 9200 10)

5y ≤ 9200−3 x
2)
11) 2 x + y≤2400
3
3) y=1840− x 12) y ≤ 2400−2 x
5
13) y=2400−2 x
6)
4) 5)
30
X 0

8)
7) 9)
1
Y 0
 16)
14) 15)
12
X 0
 18)
17) 19)
24
Y 0

Zone
Factibl
e

20)

21)

Point C 26) x=400

3
23) 2400−2x=1840− x 5 27)
28)
3 29) Replace
24) −2x+ x=1840−2400
5 30)
31) y=2400−2 x
−7
x=−560
25) 5 32) y=2400−2 ( 400 )
33) y=1600
34)
35)
36)
37) Z ( A)=0.75 ( 0 )+ 0.50(0)

38) Z ( A )=¿ 0
39)
40) Z ( B ) =0.75 ( 0 ) +0.50 ( 1840 )

41) Z ( B )=920
42)
 43) Z ( C ) =0.75 ( 400 ) +0.50 ( 1600 )

44) Z ( C ) =1100

45) Z ( D )=0.75 ( 1200 ) +0.50 ( 0 )

46) z ( D ) =900
47)
48)
49) Decision Making: Company A must transport 400 boxes for the
Company A receives an income of $300 and company B owes.
transport 1600 boxes in order to receive an income of 800 and in this way
the company can achieve a maximum profit of 1100 USD.
50) The company Producto Natural is considering developing a new snack.
low in fat. It will be a mixture of two types of cereals, each of the
which has different characteristics of fiber, fat, and proteins. The
The following table shows these nutrition characteristics for one ounce of
each type of cereal.
51)
52)
53) FIBER FAT 58)PROTEIN
DIETETICS 57)(GRAMS) S
55 (GRAMS) 59)(GRAMS)
60)A 61)2 62)2 63)4
64)B 65) 1.5 66)3 67)3
68

69) The nutritional requirements of Natural Product demand that each ounce
the new food contains at least 1.7g of protein. The cost of the
Cereal A is $0.020 per ounce and the cost of Cereal B is $0.025 per ounce.
Natural Product wishes to determine how much of each cereal is needed for
to produce 1 ounce of the new food product at the lowest possible cost.
Formulate a linear programming model for this situation.

70)

Minimize
 72) FIBER FAT PROTEIN 79) COS
DIET 76)(GRAM NAS TOS
ICA OS 78)(GRAM
74)(GRAM OS
OS)
A 81)2 82)2 83)4 84)0.02
0
85)B 86)1.5 87)3 88)3 89)0.02
8
Available 91)1.7 92)2.8 93)3.6 94)
reality
95)

96) Z =0.020x+0.025y

Subject to:

1) 2 x +1.5y ≥ 1.7

2) 2 x +3y ≤ 2.8

98) 4x+3y ≤ 3.6

99)

1) 2 x +1.5y ≥ 1.7 0.
Y 0 18)
2) 17) 19)
1.5y ≥ 1.7−2 x 10) 1.
Y 0
3)
y=1.13−1.33x 11) 2 x +3y ≤ 2.8 20)
3y ≤ 2.8−2 x
12)
6) 21) 4x+3y ≤ 3.6
4) 5) 13)
y=0.93−0.66x 3y ≤ 3.6−4x
1. 22)
X 0
23)
7) 8) 9) 14) 15) 16) y=1.2−1.33x
X 0 0.
 24)

There is no optimal solution

26)

27) The company P & T manufactures and sells products. This company obtains
a profit of $120 for each unit sold of its product1, and
$40 for each unit of your product 2. The requirements in terms of
working hours for the manufacturing of these products in the three
production departments are listed in summary in the
next table. The supervisors of these departments have estimated
What will the following work hour availabilities be during the
next month: 800 hours in department 1, 600 hours in the
department 2 and 2000 hours in department 3. Assuming that the
company you are interested in maximizing profits, you develop the
corresponding linear programming model.

28) 29) DEPART 30)DEPART DEPART 32)U

AMENDMENT AMENDMENT AMENDMENT TI
1 2 3 LI
D
A
D
33) Produce 34) 1 hour 1 hour 36)2 hours 37)$
cto 1 12
0
38) Product 39) 2 hours 40)3 hours 41) 3 hours 42)$
cto 2 40
43) Dispo 800 hours 600 hours 2000 47)
nibilid hours
ad
48)

49) Z =120x+ 40 years

Subject to:

1) x+ 2y ≤ 800

2) x+ 3y ≤ 600

3) 2 x +3y ≤ 2000

1) x+ 2y ≤ 800 2) x+3y ≤ 600 3) 2 x +3y ≤ 2000

2y ≤ 800−x 3y ≤ 600−x 69)
51) 60)
3y ≤ 2000−2 x
x x
52) y=400− 2 61) y=200− 3 70)
2
y=666.66− x
3
55) 64)
53) 54) 62) 63)
80 60
X 0 X 0 73)
71) 72)
57) 66) 99
56) 58) 65) 67) X 0
40 20
Y 0 Y 0 75)
74) 76)
59) 68) 66
Y 0
77)
 78)
79)
80)
81)
82) Zone
A = (0 ; 0) Feasible
84)B = (0 ; 200)
85)C = (800; 0)
86)
87)
88) Z ( )=120 ( 0 )+ 40(0)
A

89) Z ( A )=¿ 0
90)
91) Z ( B ) =120 ( 0 ) +40 ( 200 )

92) Z ( B )=8000
93)
94) Z ( C ) =120 ( 800 ) +40 ( 0 )

95) Z ( C ) =96000
96)
97)
Decision Making: To maximize profits, the company must
To produce 800 products results in a profit of 96,000.
dollars.
99)
100) As part of a quality improvement initiative, the
T & P employees complete a three training program.
days in team work and a two-day training program in
problem solving. The quality improvement manager has
It is requested that this year, at least 8 training programs be offered.
in teamwork and at least 10 in training in solution of
problems. Additionally, the executive level management has specified
At least 25 training programs should be offered in this.
period. T & P employs an advisor to deliver the programs of
Training. M During the following year, the advisor has 84 days of time.
training available. Each job training program in
The equipment costs $1000 and each training program on solution of
problems cost $800. Formulate a linear programming model that
can be used to determine the number of training programs
about teamwork and the number of training programs on
problem-solving solutions that must be offered to minimize total cost.
101)
102) 103) ASE 104) ADM 105) COS
SOR INISTRAD TO
OR
106) Work 107) 8 108) 12.5 109) 1000
garlic in
Team
110) Solution 111) 10 112) 12.5 113) 800
tion of
problems
114) Disp 115) 84 116) 1 117)
availability
118)
119)
120) Z =1000x+800y

121)

122) Subject to:

1) 8x+10y ≥ 84

2) 12.5x+12.5y ≥1
123)
1) 8x+10y ≥ 84
10y ≥ 84−8x
2)
3) y=8.4−0.8x
4)

7)
5) 6)
10
X 0
9)
8) 10)
8.
Y 0

11) 12.5x+12.y≥1
12.5y ≥ 1−12.5x
12)
1
y= –x
13) 12.5
 16)
14) 15)
0.
X 0
18)
17) 19)
0.
Y 0
20)
21)
22)
23)

Zone
Factibl
e

24)
25)

26) Z =1000x+800y

27) Z ( A)=1000 ( 0 )+ 800(8.36)

28) Z ( A)=6688
29) Z (B) = 1000(0) + 800(5)
30) Z ( B )=4000
31)
Decision making: To minimize the total cost, 0 must be given.
training programs for teamwork and 5 programs of
problem-solving training. Giving us a total cost of 4000
dollars.
33)

34)
 35) GRAPHICAL METHOD PROBLEMS APPLIED TO TRADE
EXTERIOR

36)
We have 210,000 euros to invest in the stock market. They recommend us
two types of shares. Type A, which yield 10%, and type B, which
they yield 8%. We decided to invest a maximum of 130,000 euros in those of the type
And at least 60,000 in type B. We also want the
Investment in type A should be less than double the investment in B.
What should be the distribution of the investment to achieve the maximum
annual interest?
Solution
It's a linear programming problem.
We call the amount we invested in type A stocks.
We are now calling the amount we invested in type B shares.
40)
41) Inversion 43) Render
on lie
Type A 45)X 46)0.1x
Type B 48) Y 49) 0.08y
50)
51)210000 0.1x + 0.08y
52)
53) Conditions that must be met (restrictions):
54)

55)

56)

57) R1

58) R2

59) R3

60) R4
61)
62) We draw the auxiliary lines associated with the constraints to achieve
the feasible region (set of points that meet those conditions).
63)
64) r1 r2 (parallel to OY ) r3 (parallel to OX) r4
65)X 66)y 67) 68)x 69) 70) 71) 72)y 73) 74)x 75)y
y x
76)0 77)2 78) 79)1 80) 81) 82) 83)6 84) 85)0 86)0
1 3 0 0 0
0 0 0
0 0 0
0 0 0
0 0
87)2 88)0 89) 90) 91) 92) 93) 94) 95) 96)13 97)6
1 00 5
0 00 0
0 0
0 0
0
98)
99) The feasible region is the one shaded in yellow, with vertices A, B, C, D, and E.

100)
101
102) A (0, 60000), B (120000, 60000), C(130000, 65000), D(130000,
80000) and E(0, 210000)
103) The objective function is;
104 F(x, y) = 0.1x + 0.08y
105) If we draw the curve F(x, y) = 0 (in red) and shift it, we can
graphically check that the furthest vertex is D, and therefore it is
the optimal solution.
106) Check it analytically (that is, to verify that the value
The maximum of the objective function, F, is reached at vertex D.
107)
108)
109) In a bakery, two types of cakes are made for
market them in Colombia: Viennese and Real. Each Viennese tart needs
a quarter of filling for every kg of cake and produces a profit of
250 pts, while a Royal cake needs half a kg. of filling for
Each kg of cake produces 400 pesetas of profit. In the pastry shop,
They can make up to 150 kg of cake and 50 kg of filling daily.
although due to machinery problems they cannot make more than 125 cakes
of each type. How many Viennese cakes and how many Royal cakes should they sell at

day for maximum benefit?

110) Solution
111) First, we create a table to organize the data:

112) T 113) 114) 115) 116)

ipo No. Bizcoc Filling Benefits
ho o
117 T 118) 119) 120) 121)
. x 1.x 0.250x 250x
You come
a
122) T 123) 124) 125) 126)
Real y 1.y 0.500y 400y
127) 128) 129) 130) 131)
150 50
132)
Objective function (to be maximized): f(x, y) = 250x + 400y
Subject to the following conditions (problem constraints):

133) We consider the auxiliary lines to the constraints and draw the
feasible region
134) For 0.25x + 0.50y = 50, or x + 2y = 200

135) 136)
X Y
137) 138)
0 1

139) 140)
2 0

141)
142) For x + y = 150
143)
144) 145)
x Y
146) 147)
0 1

148) 149)
1 0
150)
151) The other two are parallel to the axes.
152) On the OY axis x=125

153) On the axis Ox y = 125

154) And the other constraints (x and y greater than or equal to zero) indicate that
The solutions must be in the first quadrant.
155) We have colored the feasible region yellow:

156)
157)
158) Let's find the vertices:
159)
160) The O(0,0), the A(125, 0) and the D(0, 100) are located directly
(they are the intersections with the coordinate axes)

161) It is observed that the restriction and it is redundant (that is, 'unnecessary')

162) Solving the system:

163) By reduction we obtain y=50, x=100

164) Another vertex is the point C(100, 50)
165) And the last vertex that we need is obtained by solving the system:
166) X + y = 150
167) X=125
168 Cuya solución es: X=125, Y=25 B(125, 25)
169)
170) The vertices of the region are O(0,0), A(125,0), B(125,25) and C(100,50)
and D(0,100),
171) If we draw the direction vector of the objective function f(x,
y = 250x + 400 yards
Doing 250x + 400y = 0, y = -(250/400)x = -125x/200
172)
[]
X Y
175) 176)
0 0
177) 178)
2 -
1
2
5
179)

180)
181) It is graphically evident that the solution is the point (100, 50), since it is

the farthest vertex

 182) (The last one we encountered when moving the lines 250x + 400y =
0)
183) We verify it with the analytical method, that is, using the theorem.
it says that if there is a unique solution, it must be found at one of the vertices
The objective function was: f(x, y) = 250x + 400y, substituting in the
we obtain vertices
f(125,0)=31.250
f(125,25)=31.250+10.000=41.250
f(100,50)=25.000+20.000=45.000
f(0,100)=40.000
185)
186) The maximum benefit is 45,000 and is obtained at the point (100, 50)
187) Conclusion: 100 Viennese cakes and 50 cakes must be sold.
real.
188)
189) ABSTRACT
190)
191) It is an algebraic method and is used to solve linear problems.
programming to maximize and minimize the objective function.
192) This algebraic method is very efficient; it is used for general operations.
like the multiplication, addition, and subtraction of applied lines to the basic arithmetic
what allows several restrictions with different variables to be solved and
different equations, sometimes taking into account that there exists an i number
total of incognito similar to the i number of variables but it is but effective
when it is to solve problems that have only unknowns that equations
193) The steps to build the main simplex are:
194)
We build the objective function
We build the restrictions that can be determined
We build the charts simple

195) If there are negative indicators, the column it is located in is the one that
Value appears but negative in this column you pivot.

196) Divide each positive entrance above it lines her among dotted of the
column, choose the value but small that you call pivoting.

197) Mark the entrance column pivot that corresponds to the quotient
but small of the previous step, this is the pivot entry of the variable that
Alone it is that this to the left of the line pivots.

198) It uses the operations of pivoting where the pivoting should be a

value of 1 and the other of this column will be made zero.

199 On the left side of this chart, the variable that it replaces is the
variable that comes out.
200)
201)
202)
203) CONCLUSIONS

The graphical method is used for solving LP problems,

geometrically representing the constraints, technical conditions and
the objective.
The necessary steps to carry out the method are nine, the same as
they allow determining the development and the way to structure the method
graphic.
Through the graphic method, feasible and non-feasible regions can be found.
feasible solutions that aid in decision-making for problems
raised whether related to foreign trade.
204)

205) RECOMMENDATIONS

The model can be solved graphically if it only has two variables.

For models with three or more variables, the graphical method is impractical or
impossible.

If the feasible region is unbounded, this method may be incorrect:

Optimal solutions always exist when the feasible region is bounded,
but they may not exist in the unbounded case. If the feasible region is not
bounded, we are minimizing an objective function whose coefficients are
no negatives, then there is a solution given by this method.

It is important for students to know the steps that must be taken.

continue to solve the problems using the graphic method in order to
avoid possible mistakes when obtaining the desired solution.

206
 207)

208)

209) LINKOGRAPHY

[Link]/[Link]
[Link]/~ricardo/io/[Link]
[Link]

210)
211)