TECHNICAL UNIVERSITY OF AMBATO

FACULTY OF ACCOUNTING AND AUDITING

Economics Degree

Operations Research

ESTUDIANTE: FERNANDA CRIOLLO

DOCENTE: DARWIN ORTIZ

COURSE: SECOND SEMESTER PARALLEL 'B'

 SIMPLEX EXERCISES

1.- Un empresario pretende fabricar dos tipos de congeladores denominados A y B. Cada

one of them must undergo three operations before its commercialization: Assembly,

painting and quality control. Freezers require, respectively, 2.5 and 3 hours of

assembly, 3 and 6 Kg. of enamel for painting and 14 and 10 hours of quality control. The

total manufacturing costs per unit are, respectively, 30 and 28, and the prices of

sales 52 and 48, all of them in thousands of pesos.

The entrepreneur has 4,500 hours available weekly for assembly.

8.400 Kg. of enamel and 20,000 hours for quality control. The market studies

shows that the weekly demand for freezers does not exceed 1,700 units and that, in

In particular, type A is at least 600 units. It is desired:

a) Formulate a linear programming model that indicates how many freezers

they must be manufactured of each type so that the benefit is maximized, taking into account

the demand study.

b) Solve it using the simplex method. Interpret the optimal solution including
the slack variables.

Assembly kg Paint Control of

do quality
2.5 3 14

3 6 10
 X1= Congelador tipo A
Variables X2= Congelador tipo B
F. O Zmax: 22X1+ 20X2
2.5X1 + 3X2 <= 4500
14X1 + 10X2 <= 8400
R 3X1 + 6X2 <= 20000
X1 + X2 <= 1700
X1>=600
C.N X1; X2>=0

1. Convert inequalities into equations

2,5X1+3X2=4500

14X1+10X2=8400

3X1+6X2=20000 X1+X2=1700 X1=600

2. Increase of slack and artificial variables

2,5X1+3X2+S1=4500

14X1 + 10X2 + S2 = 8400

3X1 + 6X2 + S3 = 20000 X1 + X2 + S4 = 1700X1 -

S5+T1=600

Set the objective function to zero '0'.

Z–22X1–20X2 + MT1 = 0

4. Simplex Board.

Base Board:
 Variable Variable
Base Slack variable Solution Operation
of Artificial
decision
X1 X2 S S2 S3 S S T1
1 4 5
Z -22 -20 0 0 0 0 0 M 0
S1 5/2 -3 1 0 0 0 0 0 4500
S2 3 6 0 1 0 0 0 0 8400
S3 14 10 0 0 1 0 0 0 20000
S4 1 1 0 0 0 1 0 0 1700
T1 1 0 0 0 0 0 - 1 600
1

Iteration 1

Iteration 1
X1 X2 S S2 S3 S4 S5 T1
1
Z - -20 0 0 0 0 M 0 0
22
M
S1 5/2 3 1 0 0 0 0 0 4500

S2 3 6 0 1 0 0 0 0 8400

S3 14 10 0 0 1 0 0 0 20000

S4 1 1 0 0 0 1 0 0 1700
T1 1 0 0 0 0 0 -1 1 600

Iteration 2

Iteration 2
X1 X2 S1 S2 S3 S4 S5 T1
Z 0 -20 0 0 0 0 -22 0 0 Z+X1(22+M)
S1 0 3 1 0 0 0 5/2 0 3000 S1-5/2X1
S2 0 6 0 1 0 0 3 0 6600 S2-3X1
S3 0 10 0 0 1 0 14 0 11600 S3-14X1
S4 0 1 0 0 0 1 1 0 1100 S4-X1
X1 1 0 0 0 0 0 -1 0 600

Iteration 3
 Iteration 3
X1 X2 S1 S2 S3 S4 S5 T1
Z 0 -30/7 0 0 November 07 0 31428.571428571428
Z+22S5
S1 0 17/14 1 0 -5/28 0 0 6500/7 S1-5/2S5
S2 0 27/7 0 1 -3/14 0 0 28800/7 S2-3S5
S5 0 5/7 0 0 1/14 0 1 5800/7 S5/14
S4 0 2/7 0 0 -1/14 1 0 1900/7 S4-S5
X1 1 5/7 0 0 11/7 0 0 10000 divided byT1+S5
7

Final Matrix

Final matrix
X1 X2 S1 S2 S3 S4 S5 T1
Z 0 0 60/17 0 16/17 0 0 590000 dividedZ+30/7X2
by 17
X2 0 1 14/17 0 -5/34 0 0 13000/17 X2*14/17

S2 0 0 -54/17 1 June 17 0 0 19800/17 S2-27/7X2

S5 0 0 -10/17 0 March 17 0 1 4800/17 S5-5/7X2

S4 0 0 -4/17 0 -1/34 1 0 900/17 S4-2/7X2

X1 1 0 -10/17 0 3/17 0 0 15000/17 X1-5/7X2

Response:

Z= 590000/17X1=15000/17 Zmax= 22(15000/17) + 20(13000/17)Zmax=590000/17

Exercise 2

A company manufactures 4 products having available for their manufacture and

storage: 180 pounds and a total available storage space of 230

m3 respectively. To complete each product, it is required:

What is the linear programming model to maximize profits associated with

this practical case?

What is the optimal solution?

X1= Producto 1
Variables
X2 = Product 2
X3 = Product 3
X4= Producto 4
F. O Zmáx=5X1+6.5X2+5X3+5.5X4
2X1 + 2X2 + 1.5X3 + 4X4 ≤ 180
2X1+2.5X2+2X3+1.5X4≤230
R 2X1+2X2+1.5X3+4X4 ≤180
2X1+2.5X2+2X3+1.5X4≤230
2X1+2X2+1.5X3+4X4 ≤180
C.N X1;X2≥0

1. Convert inequalities to equations

2X1+2X2+1.5X3+4X4=180

2X1+2.5X2+2X3+1.5X4= 230

2. Increase of slack variables

2X1+2X2+1.5X3+4X4+S1= 180

2X1+2.5X2+2X3+1.5X4+S2= 230

3. Set the objective function to zero '0'.

Z - 5X1 - 6.5X2 - 5X3 - 5.5X4 = 0

4. Simplex Board

Base Board
Base Decision variable V. Holgura Solution
X1 X2 X3 X4 S1 S2
S1 2 2 1.5 4 1 0 180
S2 2 2.5 2 1.5 0 1 230
Z -5 -6.5 -5 -5.5 0 0 0

Iteration 1

INTERACTION Formulas
1
X2 1 1 3/4 2 1/2 0 90 S1/2=X2

S2 1/2 0 1/8 -3 1/2 -1 1/4 1 5 S2-2.5*X2

Z 1 1/2 0 1/8 7 1/2 3 1/4 0 585 Z + 6.5 * X2

Iteration 2

INTERACTION Formulas
2
X2 4 1 0 23 8 -6 60 X2 - 3/4 * X3

S2*8=X3
X3 -4 0 1 -28 -10 8 40

Z 1 0 0 4 2 1 590 Z + 1/8 * X3

Answers:
X2=60
X3=40
Z=590
X1=0
X4=0
Zmáx =5(0) +6,5(60) +5(40) +5,5(0)
590=590
Exercise 3
Carrocería S.A. is a company in the city of Machala that specializes in manufacturing.
of truck, automobile, and van bodies. In type A, to manufacture a
the body of a truck takes 5 days-man hours to manufacture, while for that of a car it takes
they need 3
days-worker and to manufacture a van 2 days-worker. In type B, 4 days are invested -
worker in truck, automobile, and van bodies. Due to limitations of
machinery in the workshops and labor, type A has 300 operating days, and type
B of 287 days - worker. If the benefits obtained from each truck are
$4250 dollars and $5000 dollars for each car.
How many units of each type should be manufactured to maximize profits?

Truck quantity
Variables to manufacture (units) X2:
Number of cars to
manufacture(units) X3:
Number of vans to
manufacture(units)
F. O Zmax: 4250X1 + 5000X2 + 5000X3
5X1 + 3X2 + 2X3 <= 300
4X1 + 4X2 + 4X3 <= 287
R 5X1 + 3X2 + 2X3 <= 300
4X1 + 4X2 + 4X3 <= 287
5X1 + 3X2 + 2X3 <= 300
C.N X1; X2 <= 0

1. Convert inequalities to equations

5X1 + 3X2 + 2X3 = 300
4X1+4X2+4X3=287
[Link] de variables de holgura
5X1 + 3X2 + 2X3 + S1 = 300
4X1 + 4X2 + 4X3 + S2 = 287
3. Set the objective function to zero '0'.
Z - 4250X1 - 5000X2 - 5000X3 = 0
4. Simplex Board
Base Board:
Base Decision variable Slack Variable Solution

X1 X2 X3 S1 S2

S1 5 3 2 1 0 300

S2 4 4 4 0 1 287

Z -4250 -5000 -5000 0 0 0

Iteration 1

Final matrix
X1 X2 X3 S1 S2
S1 2 0 0 -1 -3/4 339/4 S1-3X2
X2 1 1 1 0 1/4 287/4 X2/4
Z 750 0 0 0 125 358750 Z+5000X
0 2

Answers:

Z=358750 X2= 287/4

Zmax = 4250(0) + 5000(287/4) + 5000(0)

Zmax= 0 + 358750 + 0

Zmax= 358750

Exercise 4
In a workshop, 3 types of tables are manufactured: A, B, and C. Each table requires a certain
time to cut the parts that compose it, to assemble and paint the piece
finished. The total production of tables is sold. Furthermore, model C can
selling without painting, for the development of the work various people are employed who
they work in partial environments because the time available to carry out each of these
activities is variable. Based on the following data, formulate a programming model.
linear that allows maximizing profits, if the cutting department presents a
capacity of 150 hours,
the assembly of 200 hours and the painting department of 300 hours, if the
ganancia por la mesa A es de 1500 por la mesa B 20000 y por la mesa C35000 y por la C sin
to paint 30000.

Type of table A
X2: Type of table B
Variables
X3: Type of table C
X4: Untreated type C table
Zmax:
F. O
1500X1+20000X2+35000X3+30000X4
3X1 + X2 + 4X3 + 4X4 <= 150
R 4X1 + 2X2 + 5X3 + 5X4 <= 200
5X1 + 5X2 + 4X3 <= 300
C.N X1; X2 >= 0

1. Convert inequalities to equations

3X1+X2+4X3+4X4=150

4X1+2X2+5X3+5X4=200

5X1+5X2+4X3=300

2. Increase of slack variables

3X1+X2+4X3+4X4+S1=150

4X1+2X2+5X3+5X4+S2=200

5X1 + 5X2 + 4X3 + S3 = 300

3. Set the objective function to zero '0'.

 Z - 1500X1 - 20000X2 - 35000X3 - 30000X4 = 0

4. Simplex Board

Base Board:

Base Decision variable Slack Variable Solution

X1 X2 X3 X4 S1 S2 S3
S1 3 1 4 4 1 0 0 150
S2 4 2 5 5 0 1 0 200
S3 5 5 4 0 0 0 1 300
Z -15 -200 -350 -30 0 0 0 0

Iteration 1

INTERACTION Formulas
1
S1/4=X3
X3 3/4 1/4 1 1 1/4 0 0 37.5
S2-5*X3
S2 1/4 3/4 0 0 -1 1/4 1 0 12.5
S3-4*X3
S3 2 4 0 -4 -1 0 1 150
Z+350*X3
Z 247 1/2 -112.5 0 320 87 1/2 0 0 13125

iteration 2

INTERACTION Formulas
2
X3 2/3 0 1 1 2/3 1/3 0 33 and a third X3-1/4*X2

X2 1/3 1 0 0 -1 2/3 1 1/3 0 16 2/3 S2*4/3=X2

S3 2/3 0 0 -4 5 2/3 -5 1/3 1 83 and 1/3 S3-4*X2

Z 285 0 0 320 -100 150 0 15000 Z + 112 1/4 * X2

iteration 3
 Iteration 3

X1 X2 X3 X4 S1 S2 S3

X3 10/17 0 1 25/17 0 5/17 -2/17 400/17 X3-2/3S1

X2 9/17 1 0 -20/17 0 -4/17 5/17 700/17 X2 + 5/3S1

S1 2/17 0 0 -12/17 1 -16/17 3/17 250/17 S1*3/17

Z 504500/17 0 0 -2058.8235294117645
0 95000/17 30000/17 28000000/17 Z+10000S1

Final matrix

Matrix
final
X1 X2 X3 X4 S1 S2 S3

X4 2/5 0 17/25 1 0 1/5 -2/25 16 X4*17/25

X2 1 1 4/5 0 0 0 1/5 60 X2+20/17X4

S1 2/5 0 12/25 0 1 -4/5 3/25 26 S1+12/17X4

Z 30500 0 1400 0 0 6000 1600 1680000 Z+35000/17X4

Response:

Z=1680000 X2= 60 X4= 16

Zmax= 1500(0) + 20000(60) + 35000(0) + 30000(16)

Zmax= 0 + 1200000 + 480000

Zmax= 1680000

Exercise 5

5.- In a linear economy to produce 3 units of wheat, 6 units are required:

land, $8 in seed and 3 workers. For

To produce 4 units of rye, 5 units of land, $10 of seeds, and 6 are required.

workers. The price per unit of wheat and rye is $15 and $20.5 respectively, being

the available quantities of land and labor of 100 and 130 units. If the entrepreneur wants

optimize the result of your exploitation, formulate a linear programming model. As

they give us the price of wheat and rye per unit and the production needs that are

for every 3 units then the price value of wheat and rye we multiply by 3

and we subtract the value of each seed.

Units U. Earth Seed price Quantity

workers
Wheat 3 6 8 3
Centeno 4 5 10 6
Available 100 130

X1= Wheat units x3

Variables
X2 = Units of rye x4
Zmax= (15*3)–8 + (4*20.5)–10
F. O
Zmax= 37X1 + 72X2
6X1 + 5X2 <= 100
R 3X1 + 6X2 <= 200
C.N X1; X2 >= 0

1. Convert inequalities into equations

6X1 + 5X2 = 100

3X1 + 6X2 = 200

2. Increase of slack variables

6X1 + 5X2 + S1 = 100

3X1 + 6X2 + S2 = 130

3. Set the objective function to zero '0'.

Z - 37X1 - 72X2 = 0

[Link] Board

Base Board

Base Decision variable Slack Variable Solution

X1 X2 S1 S2

S1 6 5 1 0 100

S2 3 6 0 1 130

Z -37 -72 0 0 0

Iteration 1

ITERATION Formulas
1
S1/5=X2

S2+6*X2
S2 -4 1/5 0 -1 1/5 1 10
Z+72*X2
Z 49.4 0 14 2/5 0 1440

Answers:

Zmax = 37(0) + 72(20)

1440 = 1440

X2=20Z=1440

Exercise 6

A food supplying company wants to manufacture balanced food for dogs,

according to the specifications given by the veterinarian, a must be produced

composed of at least 100 grams of fiber, 300 grams of protein and 70

grams of minerals per animal. If you want to feed 100 dogs with the following products

that are found in the market and have the following composition. How many kilos of

each product should be purchased if you want to meet the nutritional quota at the lowest cost

possible?

X1= kilos de productos 1

Variables X2 = kilos of product 2
X3 = kilos of products 3
F. O Minimize = 10000X1 + 11000X2 + 9500X3
0.2X1 + 0.3X2 + 0.05X3 >= 100
R 0.6X1 + 0.5X2 + 0.38X3 >= 300
0.09X1 + 0.08X2 + 0.08X3 >= 70
C.N X1; X2 >=0
 Base Board

Board
Initial
Variable
Base Decision variable Slack variable Artificial Operation Solution
X1 X2 X3 S1 S2 S3 T1 T2 T3
Z -10+89/100M -11+22/25M -19/2 + 51/100M -M -M -M 0 0 0 47M
T1 1/5 3/10 1/20 -1 0 0 1 0 0 10
T2 3/5 1/2 19/50 0 -1 0 0 1 0 30
T3 9/100 2/25 2/25 0 0 -1 0 0 1 7 T1 + T2 + T3 in Z

Iteration 1

Iteration 1

X1 X2 X3 S1 S2 S3 T1 T2 T3

Z 0 4-91/200M -7+23/80M -50+69/20M -M -M 500+5/2M Z+X1(+10-

89/100M
X1 1 3/2 1/4 -5 0 0 50 X1*5

T2 0 -2/5 23/100 3 -1 0 0 T2-3/5X1

T3 0 -11/200 23/400 9/20 0 -1 2.5 T3-9/100X1

Iteration 2

X1 X2 X3 S1 S2 S3 T1 T2 T3

Z 0 -8/3 + 1/200M - 19/623/1000M

0 -50/3 + 3/20M - M 5/2 Z+S1(50-
69/20M
X11 5/6 19/30 0 -5/3 0 50 X1+5S1
S10 -2/15 23/300 1 -1/3 0 0 S1/3
T30 1/200 23/1000 0 3/20 -1 5/2 T3-9/20S1

Matriz Final
 Final matrix
X1 X2 X3 S1 S2 S3 T1 T2 T3

Z 0 -19000/9 -5500/9 0 0 -111111.1111111111 7000000/9 Z+S2(50/3-3/20)

X1 1 8/9 8/9 0 0 -100/9 700/9 X1+5/3S2
S1 0 -11/90 23/180 1 0 -20/9 50/9 S1 + 1/3 S2
S2 0 1/30 23/150 0 1 -20/3 50/3 S2*20/3

Answers:

Z= 7000000/9 X1= 700/9 X2= 0

Zmax= 10000(700/9) + 11000(0) + 9500(0) Zmax=

10000(7000/9) + 0 + 0 Zmax= 7000000/9

Exercise 7

7.-To invest a certain amount of money, one can choose from five instruments.

different, classified with a risk level of 1, 2, and 3, where 1 is the lowest level and 3 the highest

high. The level of risk, unit cost, and utility of each instrument is shown in the following

table:

Due to the risk level of each instrument, the company has the following:
The sum of all the percentages of each investment must equal 100%.

b) The investment percentage in instrument A should not exceed 40%.

The sum of the percentages of instruments C, D, and E must be less than 50%.

The sum of the percentages of instruments D and E must be less than 30%.

The unit cost of each instrument is not known.

The available capital is $100,000.00.

Use the simplex method to determine the amount of money to invest in each

instrument aimed at maximizing combined utility per percentage point

inverted.

X1= instrumento A
X2= instrument B
Variables X3= instrument C
X4= instrument D
X5= instrument E
F. O Zmax=8X1+7X2+6X3+10X4+12X5
8X1+7X2+6X3+10X4+12X5>=100
8X1 <= 040
R 6X3 + 10X4 + 12X5 <= 50
10X4 + 12X5 <= 30
X1 + X2 + X3 + X4 + X5 <= 100000
C.N X1; X2 >= 0

1. Convert inequalities to equations

8X1 + 7X2 + 6X3 + 10X4 + 12X5 = 100

8X1 = 040

6X3 + 10X4 + 12X5 = 50

10X4 + 12X5 = 30

X1 + X2 + X3 + X4 + X5 = 100000

2. Increase of slack and artificial variable

8X1 + 7X2 + 6X3 + 10X4 + 12X5 - S1 + MT1 = 100

8X1 + S2 = 040

6X3 + 10X4 + 12X5 + S3 = 50

10X4 + 12X5 + S4 = 30

X1 + X2 + X3 + X4 + X5 + S5 = 100000

3. Set the objective function to zero "0".

Z - 8X1 - 7X2 - 6X3 - 10X4 - 12X5 + MT1 = 0

[Link] Board

Base Board:
 Variable
Base Decision variable Slack variable artificial Solution Operation
n
X1 X2 X3 X4 X5 S1 S S3 S S T1
2 4 5
Z -8-8M -7-7M -6-6M -10-10M -12-12M 0 0 0 0 0 0 0
T1 8 7 6 10 12 -1 0 0 0 0 1 100 T1 in Z
S2 8 0 0 0 0 0 1 0 0 0 0 40
S3 0 0 6 10 12 0 0 1 0 0 0 50
S4 0 0 0 10 12 0 0 0 1 0 0 30
S5 1 1 1 1 1 0 0 0 0 1 0 100000

Iteration 1

Iteration 1
X1 X2 X3 X4 X5 S1 S2 S3 S4 S5 T1
Z 8-8M 7-7M 6-6M 0 0 0 0 0 0 0 0 Z+X5(12+12M)
T1 8 7 6 0 0 -1 0 0 -1 0 70 T1-12X5
S2 8 0 0 0 0 0 1 0 0 0 40

Iteration 2

Iteration 2
X1 X2 X3 X4 X5 S1 S2 S3 S4 S5 T1
Z 0 7-7M 6-6M 0 0 0 0 0 0 0 0 Z+X1(-
8+8M)
T1 0 7 6 0 0 -1 -1 0 -1 0 30 T1-8X1
X1 1 0 0 0 0 0 1/8 0 0 0 5 X1/8
S3 0 0 6 0 0 0 0 1 -1 0 20
X5 0 0 0 5/6 1 0 0 0 1/12 0 5/2
S5 0 1 1 1/6 0 0 -1/8 0 -1/12 1 99992.5 S5-X1

Iteration 3

Iteration 3
X1 X2 X3 X4 X5 S1 S2 S3 S4 S5 T1
Z 0 0 0 0 0 -1 0 0 0 0 100 Z+X2(-7+7M)
X2 0 1 6/7 0 0 -1/7 -1/7 0 -1/7 1/7 30/7 X2/7
X1 1 0 0 0 0 0 1/8 0 0 0 5
S3 0 0 6 0 0 0 0 1 -1 0 20
X5 0 0 0 5/6 1 0 0 0 1/12 0 5/2
S5 0 0 1/7 1/6 0 1/7 1/56 0 5/84 1 S5-X2
99988.21428571429

Final Matrix

Iteration4
X1 X2 X3 X4 X5 S1 S2 S3 S4 S5 T1
Z 0 0 1 7/6 0 0 1/8 0 5/12 7 1400035/2 Z+S1
X2 0 1 1 1/6 0 0 -1/8 0 -1/12 1 199985/2 X2 + 1/7 S1
X1 1 0 0 0 0 0 1/8 0 0 0 5
S3 0 0 6 0 0 0 0 1 -1 0 20
X5 0 0 0 5/6 1 0 0 0 1/12 0 5/2
S1 0 0 1 7/6 0 1 1/8 0 5/12 7 699917.5 S1*7

Answers:

Z= 1400035/2 X1= 5

X2 = 199985/2 Zmax = 8(5) + 7(199985/2) + 6(0) + 10(0) + 12(5/2) Zmax = 40 + 1399895/2 + 0 +

0 + 30

Zmax= 1400035/