Graphical Solutions for Linear Programming
Translated by
ScribdTranslationsGraphical Solutions for Linear Programming
Translated by
ScribdTranslationsProblem formulation and solution by graphical method
Evaluative Activity Axis 1
Teacher
OSWALDO RODRIGUEZ LAVERDE
NRC 5706
Andean Area University Foundation
Faculty of Engineering and Basic Sciences
Industrial Engineering
October 2022
Introduction
Mathematical models are fundamental for decision-making in an organization.
and achieve the set objectives, so by developing these cases we achieved a high degree
of understanding all the topics addressed in the reference of axis 1 thinking, also
we will show through the graphical method as a solution to one of these exercises and the step
the corresponding step to provide the graphical explanation of them.
General Objective:
Provide solutions to cases using mathematical models based on the
Linear programming and solving linear problems through the graphical method.
Specific Objectives
• Solve linear problems including the definition of the variable.
Present the objective function and the inherent constraints of linear problems.
Solve problems posed using the graphic method.
1. Pose and formulate the mathematical model based on linear programming of the
following cases:
Exercise No. 1
A factory manufactures two different products P1 and P2 and uses three different machines: M1,
M2, M3. Both products require the use, regardless of the order, of the three machines. Each
Product unit P1 requires one hour on each of the machines. Each unit of
Product P2 requires one hour on machine M1 and two hours on machine M2.
disponibilidades mensuales de las máquinas M1, M2, M3 son 400, 580 y 300 horas,
respectively. The raw material needed for the manufacturing of the products is very easy
to obtain and is achieved in such large quantities that it can be assumed to be unlimited
(Bazaraa, 1999).
After calculating all the necessary expenses for manufacturing, advertising,
distribution, marketing and taking into account the selling price, it is obtained that the
The profit for each unit of product P1 is $1000. For product P2, the unit profit
is $1400. By studying the current demand for the products, the company thinks it can
sell all of its production. The manager wants to organize its production to make it optimal.
(Bazaraa, 1999)
Solution:
1. Definition of variables
X1 = P 1
X2= P 2
2. Objective function
MinZ=1000X1 +1400X2
3. Restrictions
P
Knowing that each unit of the product1requires 1 hour in which the machine 1. - M
P
Each unit2It requires two hours on this machine.
Each month there are 580 hours available on the machine.M 2
This restriction occurs:
X 1 +2X2≤580
For the machine 2M
it is had
X 1≤300
So we have
X 1g r e a t e r t h a n o r e q u a l t o 0
X 2≥ 0
Exercise No. 2
A steel manufacturer produces four sizes of I-beams: small, medium, long and
extra long. These beams can be produced on any of three types of machines: A, B, and C.
Below are the lengths (in feet) of the I beams that can be produced:
machines per hour.
Assume that each machine can be used for up to 50 hours per week and that the costs of
the hourly operation costs of these three machines are: $30, $50, and $80 respectively. In addition,
suppose that a total of 10,000, 8,000, 6,000, and 6,000 feet of the different are required
sizes of I beams. Formulate the machine programming problem as a
linear program.
Solution
1. Definition of variables
X1 = ℎ .
I = small, medium, large and extra large on machine j (j = A, B, C).
2. Maximize utility
Production cost given as objective function:
MinZ=30( X 11 X
, 21X
, 31 ,X41)+50(X 12,X22X
, 32X 42)+80(X 13X
, 23 X
, 33X 43 )
3. Restrictions
• Production hours of the machines for each type of beam:
Machine A=X 11 + X 21 +X 31 + X 41≤50
Machine B= X 12+ X 22+ X 32+ X 42≤ 5 0
Machine B= X 13+ X 23 + X 33+ X 43≤ 5 0
4. Nature of variables.
Weekly production by type of beam:
Small=300X11 +600X12+ 800X13≥10000
Median=250X21+ 400X22+700X23≥8000
Long=200X31 +350X32+ 600X33 ≥6000
Extralarge=100X41+200X42 +300X43≥6000
X 11X
, 12 X
, 13X
, 21,X22X
, 23 ,X31X
, 32X
, 33X
, 41,X42 ,X43g r e a t e r t h a n o r e q u a l t o 0
Exercise No. 3
A woman bought three different types of stocks for $20,000. One of them pays 6%
annual interest, one pays 7%, and the other 8% annually. At the end of the first year, the sum of
The interest from the shares at 6% and 7% is $940, and the sum of the interests from the
The investment in stocks at 6% and 8% is $720. How much did he invest in each of the stocks?
(Bazaraa, 1999).
Solution:
0.07x+0.0g y=340
0.06x+0.08y=720
0.07x+0.06y=340x(−0.08)
0.06x+0.08y=720x(0.06)
−0.0056x−0.0048y=−27.2
0.0036+ 0.0048y=43.2
−0.0020x=16
16
X= =8000 shares of 7%
0.0020
0.07(8000)+ 0.06y=340
560+0.06y=340
200
y= =3,333 shares of 6%
0.06
2. Solve by the graphical method:
Exercise No. 4
Max:5x1+5x2
s . a : 4 x 1 +2 x 2≤16
8x1+ 12x2 ≤16
x 1 ,x2 g r e a t e r t h a n o r e q u a l t o 0
Step 1: Convert inequalities into equalities:
4x1 +2x2=16
8x1+ 12x2=48
Step 2: Find the points of the line from step 1.
4x1 +2x2=16
x1= 0 x14
x2= 8 x2= 0
P=(0.8) P=( 4.0)
8x1+ 12x2=48
x1= 0 x1= 6
x2= 4 x2= 0
P=(0.4) P=(6.0)
Step 3: Graph all the constraints and identify the feasible solution.
Source: Mendez, A. (2021, April 9). Graphic Method Linear Programming Calculator
Step 4: Evaluate the feasible solutions with the function.
Max:5x1+5x2
A : (3 . 2 )⇒5(3)+ 5(2)=25
(4.0)⇒ 5 ( 4)+5(0)=20
C : (0.4)=>5(0)+5(4)=20
D:(0,0)⇒ 5 (0)+5(0)=0
R/ The optimal solution is Z= 25
Exercise No. 5
Max:300x1+100x2
s . a : 4 0 x 1+ 8 x 2≤800
10x1+5x2 ≤320
x2≤ 6 0
x 1 ,x2 g r e a t e r t h a n o r e q u a l t o 0
Step 1: Convert the inequalities into equalities:
40x1 +8x2=800
10x1+5x2=320
x 2=60
Step 2: Find the points of the line from step 1.
4 0x1 +8x2=800
x1= 0 x1=20
x2= 100 x2= 0
P=(0,100)P=(20.0)
10x1+5x2=3 2 0
x1= 0 x 1=32
x2= 64 x2= 0
P=(0.64) P=(32.0)
x 2=60
x 2=60
Step 3: Graph all the constraints and identify the feasible solution.
Mendez, A. (2021, April 9). Graphical Method Linear Programming Calculator
Step 4: Evaluate the feasible solutions with the function.
MAXz:300x1+100x2
A : (12.40) ⇒300(12)+100(40)=7600
(20.0) =>300(20)+ 100(0)=6000
C : (2.60)⇒300(2)+100( 60)=6600
D:(0.60)⇒300(0)+100(60)=6000
E : (0,0)⇒300(0)+100(0)=0
R/ The most optimal solution is Z= 7600
Exercise No. 6
Min z:100x1 +60x2
1
s . a : − x1 + x2 g r e a t e r t h a n o r e q u a l t o 0
4
x 1+ x2greater than or equal to 100
−x 1+ x2≤150
10x1+ 12 times2 ≤3300
30x1+6x2<=6000
x 1 ,x2 g r e a t e r t h a n o r e q u a l t o 0
Step 1: Convert the inequalities into equalities:
−1
x + x =0
4 1 2
x 1+ x2=100
−x 1+ x2 =150
10x1+12x2=3300
30x1+6x2=6000
Step 2: Find the points of the line from step 1.
−1
x + x =0
4 1 2
x1= 0 x1=0
x 2=0 x2= 0
P=(0,0) P=(0,0)
x 1+ x2=100
x1= 0 x 1=100
x2= 100 x2= 0
P=(0,100)P=(100.0)
Statement and solutions by graphic method
x 1+ x2=150
x1= 0 x 1=−150
x2= 150 x2= 0
P=(0.150)P=(−150.0)
10x1+12x2=3300
x1= 0 x 1=330
x2= 275 x2= 0
P=(0.275)P=(330.0)
30x1+6x2=6000
x1= 0 x 1=200
x2= 1000 x2= 0
P=(0,1000) P=(200.0)
Step 3: Graph all the constraints and identify the feasible solution.
Source: Mendez, A. (2021, April 9). Graphical Method Calculator for Linear Programming
Step 4: Evaluate the feasible solutions with the function.
Min z:100x1 +60x2
A : (80.20) ⇒100(80)+60(20)=9200
B:(400021⁄ ,100021⁄)⇒100(4000/21)+60(1000/21)=460000/21
C : (0,100)⇒100(0)+ 60(100)=6000
D:(75011, 240011)⇒100(750/ 11)+60(2400/11)=219000/11
(0.150)⇒100( 0)+60(150)=9000
F : (174,130)⇒100(174)+60(130)=2520
R/ The most optimal solution is Z= 2520
Conclusions
We can conclude that the objective of linear programming is to optimize either
minimizing or maximizing expected results, but it is essential to evaluate each one
of the functions, variables, and constraints that take place in each case.
It is important to highlight that for the development of the activity it was extremely important the
knowledge of the characteristics of linear programming, as well as the procedures and
steps that must be taken to reach the optimal solution.
Linear programming allows for the identification and evaluation of different factors when it comes to