PrOgPeññEGjÓUU Lü)

LINEAR PROGRAMMING EXERCISES. MODELING

 LINEAR PROGRAMMING EXERCISES. MODELING
Problem 1

A company makes two types of hats. To balance production, use type 1 and type 2
hats, having a total of up to 500 units per day. daily of the first and second type at 150
and 200 units respectively. Suppose you get per product is $8 for type 1 and $5 for
type 2. Determine the number that must be drawn to maximize profit. TO
MODEL:

1: quantity of type 1type

hats, produced and sold
2: quantity of hats 2, produced and sold

Max z= 8^ 1 + 5

Subject to
2^1+^2≤ 5 working
^ ≤
2
uct 2
^1 uct 1
^1,^
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 1

A company makes two types of hats. To balance current production, twice as many type 1 hats are made as type 2,
with a total of up to 500 units per day. The market limits daily sales of the first and second types to 150 and 200
units respectively. Suppose the profit earned per product is $8 for type 1 and $5 for type 2. Following the graphical
method, determine the number of hats of each type that must be made to maximize profit.

Problem 2

An electronics company produces two models of radio, each on a different volume production line. The daily
capacity of the first line is 60 units and that of the second is 75 radios. Each unit of the first model uses 10 pieces of
a certain electronic component, while each unit of the second model requires eight pieces of the same component.
The maximum daily availability of the special component is 800 pieces. The profit per unit of models 1 and 2 is $30
and $20 respectively. Determine the optimal daily output for each radio model.

Problem 3

Two products are manufactured on three machines. One pound of each product requires a specific number of
hours on each machine, as presented in the table. The total hours available for machines 1, 2 and 3 correspond
respectively to 10, 16 and 12. The profits per pound for products 1 and 2 are $4 and $3 respectively. Define the
decision variables and formulate the problem as a linear program for profit maximization.

Machine Product 1 Product 2

MODEL:

^ 1 : Quantity of I pounds of product 1, produced and sold\ ^ 2 : Quantity of I pounds of product 2, produced and sold

Problem 3 4
WM ax Z = 4^ 1 + 3^ 2
Subject to Problem 4 10
3^1 + 2^2 ≤ 10 Problem 1 11
^1 + 4^2 ≤ 16
5^1 + 3^2 ≤ 12 Problem 2. 17
MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
Problem 14. 25
MODEL: 25
Problem 15. 26
MODEL: 26
Problem 16. 27
MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 24. 35
MODEL:k 35
Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
MODEL: 52
Problem 33. 53
MODEL: 53
Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
MODEL: 58
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
Problem 47. 67
MODEL: 67
Problem 48. 68
MODEL: 68
Problem 49. 69
MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
MODEL: 72
Problem 53. 73
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
MODEL: 93
Problem 62. 94
MODEL: 94
Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
Problem 65. 96
MODEL: 97
E— 1 + 97
Problem 66. 98
MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
Problem 81. 118
Problem 82. 119
MODEL: 119
Problem 83. 120
MODEL: 120
Problem 84. 121
MODEL: 121
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 85. 127

MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
Problem 89. 137
Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
Problem 92. 140
BIBLIOGRAPHY. 141

^1,^2 ≥ 0

Problem 4

A company manager provides shelters for puppies. Kennel dog food is made by blending two soy products for a
well-balanced dog diet. The table shows the data for the two products. If the manager wants to make sure his dogs
receive at least 8 ounces of protein and 1 ounce of fat daily. What would be the minimum cost mix of the two dog
foods.

soy product Cost per ounce Protein (%) Fats (%)

1 $ 0.60 50 10
2 0.15 20 20
MODEL:
x1: Number of ounces of Product 1, used in the mixture
x2: Number of ounces of Product 2, used in the mixture
Min z = 0.60x 1 + 0.15x2
Subject to
0.50x 1 + 0.20x 2 > 8 Protein ounce requirement
0.10x 1 + 0.20x2 > 1 Fat Ounce Requirement
x1,x2>0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 1

A company manufactures and sells two products. The company earns a profit of $12 per unit of product 1 and $4
per unit of product 2 sold. The labor hours required for the products in each of the three production departments
are summarized in the table. The supervisors of these departments have estimated that during the next month the
following work hours will be available: 800 in department 1, 600 in department 2, and 200 in department 3.
Assuming that the company wants to maximize profits, formulate the linear programming model for this problem.
Department Product 1 Product 2
1 1 2
2 1 3
3 2 3
MODEL:
^ 1 : quantity of product 1 ^ produce and sell
^ 2 : quantity of product 2 ^ produceandsell
Max z = 12^ 1 + 4^ 2
Subject to
Problem 3 4
Problem 4 10
Problem 1 11
Problem 2. 17
MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
Problem 14. 25
MODEL: 25
Problem 15. 26
MODEL: 26
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 16. 27
MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
Problem 24. 35
MODEL:k 35
Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 52
Problem 33. 53
MODEL: 53
Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
MODEL: 58
Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
Problem 47. 67
MODEL: 67
Problem 48. 68
MODEL: 68
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 49. 69
MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
MODEL: 72
Problem 53. 73
MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
MODEL: 93
Problem 62. 94
MODEL: 94
Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 65. 96
MODEL: 97
E— 1 + 97
Problem 66. 98
MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
Problem 81. 118
Problem 82. 119
MODEL: 119
Problem 83. 120
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 120
Problem 84. 121
MODEL: 121
Problem 85. 127
MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
Problem 89. 137
Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
Problem 92. 140
BIBLIOGRAPHY. 141
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 2.
A company, specialized in the manufacture of furniture for doll houses, produces a certain type of mini tables and
mini chairs that it sells for 2000 monetary units (u. m.) and 3000 u. m. For each article, respectively. You want to
know how many units of each item an operator must manufacture daily to maximize income, having the following
restrictions:

• The total number of units of both types may not exceed four per day per operator .
• Each mini table requires two hours to make; each mini chair, three hours. The working day
Maximum is ten hours .
• The material used in each mini table costs 400 um The one used in each mini chair costs 200
Um Each operator has 1200 um daily for material.

Pose and solve the previous problem as a linear programming model.

MODEL:

^ 1 : Quantity of Mini m i n i mesasa to produce and sell ^ 2 : Quantity of M i n isillasa to produce and sell j
WM ax Z = 2000^ 1 + 3000^ 2
Subject to
^1 + ^2 ≤ 4 Maximum number of units
2^1 +3^2 ≤ 10 Hour requirements Manufacturing
400^1 +200^2 ≤ 1200 um availability for material
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 3.

In a fruit warehouse there are 800 kg of oranges, 800 kg of apples and 500 kg of bananas. Two lots (A and
B) are made for sale. Lot A contains 1 kg of oranges, 2 kg of apples and 1 kg of bananas; Lot B consists
of 2 kg of oranges, 1 kg of apples and 1 kg of bananas. The profit per kilogram obtained with batch A is
1200 um and with lot B of 1400 um Determine the number of kilograms of each type of batch to achieve
maximum profits.|

Pose and solve the previous problem as a linear programming model.

MODEL:
x,: Quantity of Kg of lot A to sell]
x 2 : Kg quantity of lot B to sell

Max z = 1200^ ! + 1400X 2 ^^^^^M

Subject ap ^^^^^^^^^^^^^^^^^^M^ MXT+2X 2 < 800
Availability of kg of oranges|
^^^^^^^^^^^^^^^^^^^^M2XT+^ 2 < 800 Availability of kg of apples^^M
^^^^^^^^^^^^^^^^^^^^■~^1+^2 < 500 Availability of kg of bananas^^^B
x,x22o
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 8.

A fruit bowl needs at least 16 boxes of oranges, 5 of bananas and 20 of apples. Two wholesalers can supply you
to meet your needs, but they sell the fruit in full containers. Wholesaler A sends 8 boxes of oranges, 1 of bananas
and 2 of apples in each container. The wholesaler B sends in each container 2 boxes of oranges, one
of bananas and 7 of
apples. Knowing that the wholesaler A is found 150 km awayand wholesaler B 300
km away,
Calculate how many containers you will have to buy from each wholesaler, reducing the distance from what is
requested to a minimum.

MODEL:
^1 : Number of trips with type containers ^
^2 : Number of trips with type B containers
Min z = 150^ 1 + 300^ 2
Subject to
8^1 + 2^2 ≥ 16 Number of boxes of oranges
^1 + ^2 ≥ 5 Number of boxes of bananas
2^1 + 7^2 ≥ 20 Number of boxes of apples
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 9.

A company has two mines: mine A produces daily 1 ton of coal high anthracite
quality, 2 tons charcoal medium quality and 4 tons low carbon quality; mine B
produces 2 tons of each of the three classes. This company needs 70 tons of high quality coal, 130 of medium
quality and 150 of low quality. The daily expenses of mine A amount to 500 CU and those of mine B at 750 um
(How many days should they work in each mine for the cost function to be minimum?

MODEL:
^1 : Amount ds days worked on Iami n a TO
^2: Amount of days brought down in Iami n aB
E n z = 500^ 1 + 750^ 2
Request inton of coal quality high
Request inton of coal quality half
Subject to Request in ton of coal
^1 + 2^2 ≥ 70 quality low
2^1 + 2^2 ≥ 130 ^1, ^2 ≥ 0
4^1 + 2^2 ≥ 150
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 10.
Let's imagine that a person's minimum weekly needs for proteins, carbohydrates and fats are, respectively, 8.
12 and 9 units. Suppose we must obtain a
prepared with that minimum composition by mixing two products A and B, whose contents per kilogram are those
indicated in the following table:

Proteins Carbohydrates Fats Cost/kg

TO 2 6 1 600
b 1 1 3 400

How many kilograms of each product should be purchased weekly so that the cost of preparing the diet is
minimal? Pose and solve the previous problem as a linear programming model.

MODEL.
^1 : number of kilograms of product A to buy
^2: quantity of Kilograms of product B ac^m^rar
E n z = 600^ 1 + 400^ 2
Minimum unit requirements for protein Minimum unit requirements for carbohydrates Minimum unit requirements
for fat
Subject
to
2^1 + ^2 ≥8
6^1 + ^2 ≥ 12
^1 + 3^2 ≥9
^1, 2≥0
^
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 11.

In the production of product A, substance B is needed. The quantity of A obtained is less than or equal to twice
the B used, and the difference between the quantities of product B and A does not exceed 2 g while the sum must
not exceed 5 g. Additionally, at least 1 g of B is used and 1 g of A is required. Substance A sells for 5 million µm
and B costs 4 million um the gram Calculate the amount of substance B necessary for maximum benefit.

Pose and solve the previous problem as a linear programming model.

MODELING.
^1 : Number of branches of product A to be produced and sold
^2: Number of grams of product B ac^m^rar
Max z = 5^ 1 4^2
Subject to
^1 - 2^2 ≤ 0 Quantity obtained from product A Requirement of
-^1 + ^2 ≤ 2 gr.
^ 1 + ^2 ≤ 5 Gr requirement
^1 ≥1
Minimum use of gr of A Minimum requirement in
^2 ≥ 1 gr of B
^1, ^2 ≥ 0
Problem 12.
In a survey carried out by a local television station, it was detected that a program with 20 minutes of variety and
one minute of advertising attracts 30,000 viewers, while another program with 10 minutes of variety and 1 minute
of advertising attracts 10,000 viewers.
 LINEAR PROGRAMMING EXERCISES. MODELING

For a certain period, the network management decides to dedicate 80 minutes of variety and 6 minutes of
advertising. How many times should each program appear in order to attract the maximum number of viewers?

MODEL:
^1 : Number of times that
looks like the program^ 1
^2: Number of times that
It looks like the program^ 2
Max z = 30000^ 1 + 10000^ 2
Subject to
20^1 + 10^2 = 80 Minutes dedicated to varieties
^1 + ^2 = 6 Minutes dedicated to advertising
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 13.

A company has two factories A and B. In them a certain product is manufactured, at a rate of 500 and 400 units
per day respectively. The product must subsequently be distributed to three centers I, II and III, which require,
respectively, 200, 300 and 400 units. The costs of
Transport each unit of the product from each factory to each distribution center are as indicated in the following
table:

Manufacturing
Factory 1 II III
(units)
TO 50 60 10 500 u
b 25 40 20 400 u
Demand 200 300 400

How should they organize transportation so that expenses are minimal?

MODEL:
x
íj: Amount of product transferred from factory i to distribution center j
E n z = 50^ 11 + 60^ 12 + 10^ 13 + 25^ 21 + 40^ 22 + 20^ 23
Subject to
^11 + ^12 + ^13 ≤ 500 Units produced in A
^21 + ^22 + ^23 ≤ 400 Units produced in B
^11 + ^21 ≥ 200 Demand for units from the center I
^12 + ^22 ≥ 300 Demand for units from center II
^13 + ^23 ≥ 200 Demand for units from center II
^^ i ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 14.
A pharmaceutical multinational wants to manufacture a nutritional compound based on two products A and B.
Product A contains 30% proteins, 1% fats and 10% sugars. Product B contains 5% proteins, 7% fats and 10%
sugars.

The compound must have at least 25g of proteins, 6g of fats and 30g of sugars. The cost of product A is 0.6
um/g. and that of B is 0.2 um/g.
How many grams of each product should the compound have so that the total cost is minimal?

MODEL:
X1: Number of grams of product A that the compound has
X2: Number of grams of product B that the compound has
Min z = 0.6x 1 + 0.2x 2
Subject to
0.30x1 + 0.05X2 > Minimum requirement of grams of protein
25 Minimum requirement of grams of fats
0.01 x 1 + 0.07x 2 > 6 Minimum requirement of grams of sugars
0.10x 1 + 0.10x2 > 30 x1,x2>0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 15.
The profit per batch of each new product. (Profit per batch produced was chosen as an appropriate measure once
the team concluded that the incremental profit from each additional batch produced would be essentially constant,
regardless of the total number of batches produced. Because no substantial costs are incurred to initiate the
production and marketing of these new products, the total profit of each is approximately the profit per batch
produced multiplied by the number of batches.)

Obtaining reasonable estimates of these amounts required the support of key personnel in various units of the
company. The manufacturing division personnel provided the data for the first mentioned category. Developing
estimates for the second category required analysis by the manufacturing engineers involved in designing the
production processes for the new items. By analyzing the cost data obtained by these engineers, along with the
marketing division's pricing decision, the accounting department calculated estimates for the third category.

• The following table summarizes the data gathered from the above Information,___________
Plant Batch production time, Hours Available production time
to the
week, hours
Product
1 2
1 1 0 4
2 0 2 12
3 3 2 18
Earnings per lot $3000 $5000

MODEL:
^1 : number of batches of product 1,^produce and sell
^2: number of batches of product 2,^produce and sell
Max z = 3000^ 1 + 5000^ 2
Subject to
Availability hours Floor 1
^1 ≤ 4
Availability hours Floor 2
2^2 ≤ 12 Availability hours Floor 3
3^1 + 2^2 ≤ 18
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 16.
An agricultural association has two plots: plot P1 has 400 hectares of usable land and has
of 500 m 3 of water, while plot P2 has 900 Ha of usable land and has 1200 m 3 of water. The recommended crops
are: beets and cotton. Beet consumes 3 m 3 of water per Ha, with a benefit of 700 um By Ha; Cotton consumes 2
m 3 of water per Ha, with a benefit of 500 um By Ha. A maximum quota per hectare has been established for each
crop: 800 for beets and 600 for cotton, with the total percentage of cultivated land being the same in each plot.

Pose the linear programming problem.

MODEL:
x
íj: Number of ℎectares cut with product i in the
Plot
Max z = 700(^ 11 + ^ 12 ) + 500(^ 21 + ^ 22 )
Subject to
^11 + ^21 ≤ 400 Ha availability in P1
^12 + ^22 ≤ 900 Ha availability in P2
3^11 + 2^21 ≤ 500 Availability of m 3 of water in P1
3^12 + 2^22 ≤ 1200 Availability of m 3 of water in P2
^11 + ^12 ≤ 800 Maximum hectares of arable beet
^21 + ^22 ≤ 600 Maximum ha of arable cotton
^11 + ^21 ^12 + ^22
≥0
400 900
X ij ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 17.
A construction company has two types of CYC trucks and needs to transport at least 100 tons of sand to a
construction site. If the company has up to 6 type C trucks 1 with a capacity of 15 tons and a cost of 4000 um, per
trip and up to 10 type C trucks with a capacity of 5 tons and a cost of 3000 um per trip…

Determine the number of trucks you should use so that the cost is minimal

MODEL:
^1 : Amount of trucks guy C 1 used
^2: Amount of trucks guy C 2used
M i n z = 4000^ 1 + 3000^ 2
Subject to

15^1 + 5^2 ≥ 100 Units to be transported

x ≤6 C 1 truck availability
1 ^2 ≤ 10 C 2 truck availability
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 18.
An airline company has two types of aircraft A 1 and A 2 to cover a certain route. Plane A 1 must make the trip
more times than plane A 2 , to at least reach a break-even point, however it cannot exceed 120 trips. Between the
two planes they must make more than 60 flights, but less than 200. On each trip of plane A 1 the company earns
30,000 um and 20,000 um for each trip of plane A.

How many trips should each plane make to obtain maximum profits?

MODEL:
^1 : number of plane trips on type ^1
^2: number of trips of the airplane type ^2
Max z = 30,000^ 1 + 20,000^ 2
More A1 trips than A2
Maximum trips made by A1
Minimum trips made by A1 and A2
Maximum trips
Subject to
^1 - ^2 ≥ 0
^1 ≤ 120
^1 +^2 ≥ 60
^1 +^2 ≤ 200
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 19.

A wine industry produces wine and vinegar. Double the production of wine is always less than or equal to the
production of vinegar plus four units. On the other hand, triple the production of vinegar added to four times the
production of wine always remains less than or equal to 18 units.

Find the number of units of each product that must be produced to reach a maximum profit, knowing that each
unit of wine leaves a profit of 800 um And each unit of vinegar of 200 um

MODEL:
^1 : number of units of wine to be produced
^2: number of units of input to be produced
Max z = 800^ 1 + 200^ 2
Subject to
2^1 - ^2 ≤ 4 Wine Production Units
4^1 + 3^2 ≤ 18 Vinegar Production Units
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 20.

A car and truck body factory has two warehouses. In warehouse A, to make the body of a truck, seven operator-
days are invested, to manufacture the body of a car, two operator-days are required. In warehouse B, three
operator days are spent on both truck and car bodies. Due to limitations in manpower and machinery, warehouse
A has 300 operator-days, and warehouse B has 270 operator-days. If the profits obtained from each truck are 6
million um And for each car 2 million um, how many units of each must be produced to maximize profits?

MODEL:
^1 : Number of units of cars produced and sold
^2: Number of truck units produced and sold
Max z = 2^ 1 + 6^ 2
Subject to
2^1 + 7^2 ≤ 300 Availability of operators in A
3^1 + 3^2 ≤ 270 Availability of operators in B
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 21.1
A financial institution collects deposits and lends money. Capturing deposits takes an hour to convince
the client and another hour of bureaucratic work. Lending money takes one hour to convince the client
and two hours of bureaucratic work. The maximum number of working hours available is 40 hours for
convincing clients and 60 hours for bureaucratic work. The profit obtained from lending money is
1/3 greater than that from collecting deposits.
How many operations of each type should the entity carry out to obtain the maximum benefit?

MODEL:

X1: Number of operations carried out in deposit^ x2: Number of operations carried out in loans
gKKKKMax z = x + 4/3 X2 Subject ap ^M^B% i + x < 40
± 2

Maximum number of hours to convince^M^M

^^^ M* , + 2X 2 < 60 Maximum number of hours for bureaucratic
work, xi,x22o
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 22.
A person has 500,000 um to invest in two types of shares A and b. He type A has enough
risk with an annual interest of 10% and type B is quite safe with an annual interest of 7%. Decides to invest a
maximum of 300,000 um in A and at least 100000 um in B, and invest in A for
less as much as in B. How should you invest your 500,000 um to maximize your annual interest?

MODEL:
X1: Amount of money invested in type A shares
X2: Amount of money invested in type B shares
Max z = 0.1x 1 + 0.07x 2
Subject to
x 1 + x 2< 500000
x1 < 300000
x 2 > 100000 Investment maximum
x1—x2 >0 Maximum investment in A
x1,x2>0 Maximum investment in B
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 23.

Rulisa manufactures dough for type I and II cakes. The type I sells it for 5 euros per kilo, spending 1 euro on
ingredients and 2 on labor. Type II is sold for 3 euros and costs 1 euro for both ingredients and labor. To make
dough, two types of activities are needed: kneading and baking. Rulisa has 18 hours of kneading and 12 hours of
baking a week. Type I dough needs 2 hours of kneading AND 3 hours of baking, while type II dough needs 3
hours of kneading and 1 hour of baking.

If the amount of dough that can be sold is unlimited, optimize Rulisa's weekly profits .

MODEL:
^1 : Quantity of ki of type 1 mass
^2 : Quantity of ki those of type 2 mass
Max z = 2^ 1 + ^ 2
Subject to
2^1 + 3^2 ≤ 18 Availability in kneading hours
3^1 + ^2 ≤ 12 Availability in baking hours
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 24.

A baker has 150 kg of flour, 22 kg of sugar and 275 kg of butter to make two types of cakes P and Q. To make a
dozen type P cakes you need 3 kg of flour, I kg of sugar and 1 kg of butter and to make a dozen of type Q you
need 6 kg of flour, 0.5 kg of sugar and 1 kg of butter.

The profit you get for a dozen of type P is 20 per kg and for a dozen of type Q is 30. Find, using linear
programming techniques, the number of dozens you have to make of each class so that the profit is maximum.

MODEL:k
^1 : Number of P-type cake docs
^2: Number of Q-type cake docs
Max z = 20^ 1 + 30^ 2
Subject to
3^1 + 6^2 ≤ 150 Availability of kg of flour
^1 +0.5^2 ≤22 Availability of kg of sugar
^1 + ^2 ≤275 Availability of kg of butter
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 25.
A company manufactures three products A, B and C. Each unit of A requires one hour of engineering, eight hours
of direct labor, and four pounds of material. A unit of B takes three hours of engineering, three hours of labor
direct work and three pounds of material. Each
product unit c requires two hours of engineering, four hours hand of direct work and two
pounds of material. HE It has 80 hours of engineering, 800 hours hand of direct work and 300
pounds of material each month. The utilities are as follows:

Product A Product B Product C

Sales (unit) Utility /unit Sales (unit) Utility /unit Sales (unit) Utility /unit
0-40 10 0-50 6 0-100 5
41-100 9 51-100 4 More than 100 4
101-150 8 Over 3 100
More than 150 6

MODEL:
x
ij Number of type i products
to reach customer level j
M ax z = 10^ 11 + 9^ 12 + 8^ 13 + 6^ 14 + 6^ 21 + 4^ 22 + 3^ 23 +5^ 31 +4^ 32 Subject to
(^11 + ^12 + ^13 + ^4)+ 3(^21+^22 + ^23)+2(^31 + ^32)≤ 80 Availability hr engineering
8(^11 + ^12 + ^13+ ^4)+3(^21 + ^22 + ^23)+4(^31 + ^32) ≤ 800 Availabilityfrom hr MO
4(^11 + ^12 + ^13+ ^4)+3(^21 + ^22 + ^23)+2(^31 + ^32) ≤ 300 Availability of pounds material
^11 ≤ 40 Sales maxims
^12 ≥ 41 Sales minimal
^12 ≤ 100 Sales maxims
^13 ≥ 101 Sales minimal
^13 ≤ 150 Sales maxims
^14 ≥ 151 Sales minimal
^21 ≤ 50 Sales maxims
^22 ≥ 51 Sales minimal
^22 ≤ 100 Sales maxims
^23 ≥ 101 Sales minimal
^31 ≤ 100 Sales maxims
^32 ≥ 101 Sales minimal
x
í j ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 26.
The El Condor company operates a plane that transports both passengers and cargo between the airports of
Bogota, Medellin and Cali. Due to the high costs of operation, he plane does
not leave
until all your holds have been loaded. The plane has three holds: lower, middle
and higher. Due to space limitations what's up, the plane can't carry more of 100 tons
of cargo on each trip: the lower hold must carry a maximum of 40 tons of cargo, the intermediate hold must carry
a third of the load of the lower hold and the upper hold must carry 2/5 of it. Of the cargo of the lower hold.
However, no more than 60 tons of cargo should be carried between the middle and upper holds. Transportation
profits are 8000 um per ton of cargo in the lower hold, 10,000 um Per ton in the intermediate and 12000 um in the
upper one, after deducting expenses. Create a LP model to determine the way to load the plane that maximizes
profits.

MODEL:
^1 : amount of tune s inI to store lower
^2 : amount of tons inthe store half
^3 : amount of tons inthe store^up^ri or
M ax z = 8000^ 1 + 10000^ 2 + 12000^ 3 Subject to
^1 + ^2 + ^3 ≤ 100 Maximum ton to carry the plane
^1 ≤ 40 Maximum ton of the lower hold
1
⁄ 3 ^ 1 + ^2 =0 Load in tons of the intermediate hold
2
⁄5 ^1 + ^3 = 0 Load in ton of the upper hold
^2 + ^3 ≤ 60 Maximum load in tons of medium and
^1 ^2,^3 ≥ 0 higher
,
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 27.
An automobile workshop plant is going to be organized where electricians and mechanics will work; Due to
market needs, it is necessary that the number of mechanics is equal to or greater than the number of electricians
and that the number of mechanics does not exceed twice the number of electricians. In total there are 20
electricians and 30 mechanics available. The company's profit per day is 25,000 um per electrician and 20,000
per mechanic. How many workers of each class should be chosen to obtain maximum profit?

MODEL:
^1 : number of electricians chosen
^2: number of mechanics chosen
Max z = 25000^ 1 + 20000^ 2
Subject to
-^1 + ^2 ≥0 Greater number of mechanics Maximum
-2^1 + ^2 ≤0 number of mechanics Availability of electricians
^1 ≤20
^2 ≤30 Availability of mechanics
^1, ^2 ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 28.
A manufacturing company discontinued production of a certain unprofitable product line. This created a
considerable excess in production capacity. Management wants to dedicate this capacity to one or more of three
products; Call them products 1, 2 and 3. The following table summarizes the available capacity of each machine
that can limit production:

Machine type Available time (Hours)

Milling machine 500
Turnstile 350
Grinding machine 150

The number of machine hours required for each product is:

Machine type Product 1 Product 2 Product 3

Milling machine 9 3 5
Turnstile 5 4 0
Grinding machine 3 0 2

The sales department has indicated that the potential sales for products 1 and 2 exceed the maximum production
rate and that the potential sales for product 3 are 20 units per week. The unit profit would be $50, $20, and $25,
respectively, for products 1, 2, and 3. The goal is to determine how many of each type of product the company
should produce to maximize profit.

MODEL:
^1 : amount of product1 ^ produceandsell\
^2: amount of product2 ^ produceandsell
^3 : amount of product3 ^ produceand sell
WM ax Z = 50^ 1 + 20^ 2 + 25^ 3
Subject to
9^ 1 + 3^ 2 + 5^ 3 ≤ 500 Milling machine hr availability
≤ 350 hr availability around
3^1 + 2^ 3 ≤ 1 50
5^1 + 4^2 Availability of hr in
grinding machine
^ 3 ≤ 2 0 Potential sales of product 3
^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 29.

A company manufactures two types of cologne: A and B. The first contains 15% jasmine extract, 20% alcohol and
the rest is water; The second contains 30% jasmine extract, 15% alcohol and the rest is water. Daily there are 60
liters of jasmine extract and 50 liters of alcohol. A maximum of 150 liters of colony B can be produced each day.
The selling price per liter of colony A is 500 um and that of colony B is 200 um Find the liters of each type that
must be produced daily for maximum benefit.

MODEL:
^1 : Quantity of liters of col^nia type ^
^2: Number of liters of type B col^nia
Max z = 500^ 1 + 200^ 2
Subject to
0.15^1 + 0.30^2 ≤ 60 Availability in liters of jasmine extract
0.20^1 + 0.50^2 ≤ 50 Availability in liters of alcohol Maximum
^2 ≤ 150 production in liters of cologne B
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 30.
In a division of chemical products of the Chemical company Colombia they make the products
A and B that require of two operations that are the same for each one. From the production of
B
A by-product C results, part of which can be sold up to 12 units. The rest has to be destroyed due to lack of
demand. The unit profits for products A and B are 4 um and 9 um respectively. Byproduct C is sold at 2 um the
unit (is utility). If C cannot be sold, the destruction cost is 1 cu The process provides 3.1 units of C for each unit of
B produced. Forecasts indicate that demand for A and B is limited. The unit process times are: A, 2.6 hours in
operation 1 and 3.3 hours in operation 2; B, 4.7 hours in operation one and 4.6 hours in operation two. Available
times: 60 hours for operation 1 and 65 hours in
operation 2. Assume that the products are divisible. The following formulation solves the problem.

MODEL:
^1 : amount of productTO to produce and sell
^2 : amount of productb to produceandsell
^3 : amount of product c to produceandsell
^3 : Amount of product c destroyed
 LINEAR PROGRAMMING EXERCISES. MODELING

M ax z = 4^ 1 + 9^ 2 + 2^ 3 - ^ 4
Subject to
2.6^1 + 4.7^2 ≤60 Availability in hours of operation 1
Availability in hours of operation 2
3.3^1 + 4.6^2 ≤65
Potential sales of product C
^3 ≤12 Contribution of product C
3.1^2 - ^3 - ^4 = 0
^1, ^2, ^3, ^4 ≥ 0
Problem 31.

A factory that produces umbrellas has two types of inspectors (A and B), who must be assigned for quality control.
Factory policy requires that at least 18,000 umbrellas
are inspected daily (eight hours of work). Class A inspectors can check 250 umbrellas per hour, with 98%
accuracy, while Class B inspectors can check 150 with 95% accuracy. In the current market, a class A inspector
charges 450 um per hour and B, 350 um per hour. Each mistake by the inspector costs 100 um To the factory.
There are eight class A and 10 class B inspectors. The factory manager wants to determine the optimal allocation
of inspection personnel.

MODEL:
^1 : Number of inspectors gnats of class A
^2: Number of inspectors to s gn two of class B
M i n z = 2,800^ 1 + 1,600^ 2
Subject to
2000^1 + 1200^2 ≥ 18000 Minimum quantity of umbrellas policy
Problem 3 4
Problem 4 10
Problem 1 11
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 2. 17
MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
Problem 14. 25
MODEL: 25
Problem 15. 26
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 26
Problem 16. 27
MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
Problem 24. 35
MODEL:k 35
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
MODEL: 52
Problem 33. 53
MODEL: 53
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
MODEL: 58
Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
Problem 47. 67
MODEL: 67
Problem 48. 68
MODEL: 68
Problem 49. 69
MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 72
Problem 53. 73
MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 93
Problem 62. 94
MODEL: 94
Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
Problem 65. 96
MODEL: 97
E— 1 + 97
Problem 66. 98
MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
Problem 81. 118
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 82. 119

MODEL: 119
Problem 83. 120
MODEL: 120
Problem 84. 121
MODEL: 121
Problem 85. 127
MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
Problem 89. 137
Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 92. 140

BIBLIOGRAPHY. 141
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 32.
A textile factory produces knitwear of grades A and B. Those of quality A are manufactured with one unit of wool
and two units of fiber synthetic and quality B with two units of wool and one
of
synthetic fiber. The benefits obtained in the sale of The garments are 1500 u .m. for the quality
ones
A and 1000 um For quality B. Knowing that only 180 units of wool and 240 of synthetic fiber are available, the
following is requested:

Determine how many garments of each type should be produced to obtain a maximum profit if production cannot
exceed 1000 garments.

MODEL:
^1 : Quantity of quality garments produced

^2:___Quantity of quality garments B el abor a

yes
yes
WM ax Z = 1500^ 1 + 1000^ 2
Subject to
^1 + 2^2 ≤ 180 Availability of units ofwool
2^1 + ^2 ≤ 240 Availability of units offiber
^1 + ^2 ≤ 1000 Maximum garment production
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 33.

A company makes two models of hats: Bae and Viz. The manufacture of the hats is carried out inmolding
sections, paint and mounting. The makingOf each model Bae requires two hours
of molded, three of paint and one of mounting;the manufacturingof the model Viz requires
three Hours of
molded, two of painting and one of assembly. The sections of molded andpaint they have, each,
of a maximum 1500 hours each month and the assembly one of 600.

If the Bae model is sold at 10,000 um and the Viz model at 12000 um How many hats of each type must he make
to maximize monthly profit?

MODEL:
^1 : Amount of hats guy Baes f abricados
^2: Amount of hats guy Saw
zf abricados
Max z = 10000^ 1 + 12000^ 2
Subject to
2^1 + 3^2 ≤ 1500 Availability in hours in molded
3^1 + 2^2 ≤ 1500 Availability in hours in paint
^1 + ^2 ≤ 600 Availability in hours in
^1, ^2 ≥ 0 mounting
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 34.

A company manufactures two types of markers: class A 200 um unit and class B 150 um In daily production it is
known that the number of class B markers does not exceed those of class A by 1000 units; Furthermore, between
the two classes they do not exceed 3000 units and that of class B does not go below 1000 units per day. Find the
minimum cost of daily production.

MODEL:
^1 : Quantity of Amanufactured type labels
^2: Quantity of type B labels manufactured
E n z = 200^ 1 + 150^ 2
Subject to
^1 + ^2 ≤ 3000 Maximum number of units
^2 ≥ 1000 Minimum units of B
-^1 + ^2 ≤ 1000 Maximum of B does not exceed A by 1000 units
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 35.

In a motorcycle workshop they estimate that, on average, the normal inspection of a new motorcycle requires 0.5
hours in the mechanical section, and one hour in the electrical section, while the inspection of a used motorcycle
requires three hours. of mechanics and one hour of electricity. For the inspection of a new motorcycle they charge
2500 um and for the inspection of a used motorcycle they charge 4500 um

If the mechanical section can work for a maximum of nine hours a day, and the electrical section for eight hours a
day, calculate how they should select the work to obtain the maximum income.

MODEL:
^1 : Number of new motorcycles accepted
^2: Number of used motorcycles accepted
Max z = 2500^ 1 + 4500^ 2
Subject to
0.50^1 + 3^2 ≤ 9 Availability in hours in mechanical section
^1 + ^2 ≤ 8 Availability in hours in electricity section
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 36.
A businessman intends to manufacture two types of freezers called A and B. Each of them must go through three
processes before being commercialized: Assembly, painting and quality control. The 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 sales prices are 52 and 48, all
of them in thousands of pesos.

The employer has a maximum of 4,500 hours weekly to assemble 8,400 kg. of enamel and 20,000 hours at least
in quality control. Market studies show that the weekly demand for freezers does not exceed 1,700 units and that,
in particular, type A is at least 600 units. Wanted:

a) Formulate a linear programming model that indicates how many freezers of each type should be
manufactured so that the profit is maximum, taking into account the demand study.

MODEL:

^1 : quantity of type A freezers produced ^ 2 : quantity of type B freezers produced

Max z = 22^ 1 + 20^ 2
Subject to
2.5^1 + 3^2 ≤ 4500 Availability in assembly hours
3^1 + 6^2 ≤ 8400 Availability inkg in inted weight
14^1 + 10^2 ≥ 20000 Availability in hrs in DC
^1 + ^2 ≤ 1700 Maximum demand in units
^1 ≥ 600 Minimum demand for type A units
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 37.
To manufacture items A and B, you have of 600 kg of steel. to produce an article A
They consume 4 kg of steel and, to obtain one of B, 8 kg. Calculate how many items of each type should be
manufactured to obtain maximum profit, knowing that the selling price of each item of type A is 1200 CU and each
one of type B is 2000 um and that, due to lack of other materials, no more than 120 units of type A or more than 70
units of type B can be manufactured.

MODEL:
^1 : Quantity of type A items to be manufactured
^2 : Quantity of type B items to be manufactured
Max z = 1200^ 1 + 2000^ 2
Subject to

4^1 + 8^2 ≤ 600 Kg of steel available

x
1
≤ 120 Maximum manufacturing in units of A
^2 ≤ 70 Maximum manufacturing in units of B
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 38.
On a farm, two kinds of bags, P and Q, are prepared by mixing two products A and B. A bag of P contains8 kg of
A and 2 of B, and a bag About what contains 10 kg of A and 5 of b. Each
bag of P is sold at
300um and each bag of Q at 800 um Yes in the farm there are stored 80 kg of A and 25 of B, How
many
bags of each type should be prepared to obtain maximum income?

MODEL:
^1 : quantity of type P bags to prepare
^2: quantity of bags of type Q to prepare
Max z = 300^ 1 + 800^ 2
Subject to
8^1 + 10^2 ≤ 80 Availability of kg of A
2^1 + 5^2 ≤ 25 Availability of kg of B
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 39.

A person who wants to lose weight is offered two products, A and B, so that they can take a mixture of both with
the following recommendations:

You should take no more than 150 g of the mixture and no less 50 g. The amount of A must be equal to or
higher than that of B. It should not include more than 100 g of A.

• How many grams of each product should you mix to obtain a mixture with the required requirements?
MODEL:
^1 : Number of branches of product A to mix
^2: Number of grams of product B to mix
Max z = 0.3^ 1 + 0.20^ 2
Subject to

^1 + ^2 ≤ 150 Maximum allowed in grams of the

^1 + ^2 ≥ 50 mixture Minimum acceptable in
x 1- ^2 ≥ 0 grams of mixture A equal to or
^1 ≤ 100 greater than B
^1, ^2 ≥ 0
Maximum gr of A
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 40.
A company produces wooden slats in four sizes: small, medium, large and extra large. These slats can be
produced on three machines: A, B and C. The number of meters that each machine can produce per hour is:

TO b c
Boy 300 600 800
Medium 250 400 700
Big 200 350 600 .
[ Extra big 100 200 300

Suppose that each machine can be used 50 hours per week and that the operating cost per hour of each one is
30, 50 and 80 um. respectively. If 10,000, 8,000, 6,000 and 4,000 meters of each are needed
type of slats per week, formulate a model to minimize costs.

MODEL:
x
íJ : Quantity of ℎ or as used of Iama qu i n ai
to produce a Iiston j meter
E n z = 30(^ 11 + ^ 12 + ^ 13 + ^ 14 ) + 50(^ 21 + ^ 22 + ^ 23 + ^ 24 ) + 80(^ 31 + ^ 32 + ^ 33 + ^ 34 ) Subject to
300^11 + 600^21 + 800^31 ≥ 10000 Minimum requirement in meters of small ribbon
250^12 + 400^22 + 700^32 ≥ 8000 Minimum requirement in meters of medium slat
200^13 + 350^23 + 600^33 ≥ 6000 Minimum requirement in meters of large ribbon
100^ 14 + 200^ 24 + 300^ ≥ 4000 Minimum requirement in meters of extra strip
34 gde
^11 + ^12 + ^13 + ^14 ≤ 50 Availability of machine hours A
^21 + ^22 + ^23 + ^24 ≤ 50 Availability of machine hours B
^31 + ^32 + ^33 + ^34 ≤ 50 Availability of machine hours C
^^ j ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 41.

A truck can transport a maximum of 9 T per trip. On a certain trip you want to transport at least 4 T of merchandise
A, and a weight of merchandise B that is not less than half the weight you are transporting of A. Knowing that 3000
um are charged per kg of A and 2000 um per kg of B. How should the truck be loaded to obtain maximum profit?

MODEL:
X1: Number of tons of A's merchandise loaded
Max z = 3x 1 + 2x 2
(in millions)
X2: Number of tons of B merchandise loaded
-1/2 x
1 +xx 12 >0 >4 Minimum required in tons of A
Minimum requirement of B Maximum
x1 + x2 < 9 transportation in tons per trip
Subject to
x1,x2>0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 42.

Co/petro processes oil to produce jet fuel and machine oil. It costs 40 um buy 1000 barrels of oil, which are then
distilled to produce 500 barrels of jet fuel and 500 barrels of oil. What is obtained from the distillation can be sold
directly or processed again with a catalytic fractionator. If sold without the second process, jet fuel is sold at 60 CU
for 1000 barrels and the oil for heating is sold at 40 um per 1000 barrels. It takes one hour to process 1,000 barrels
of jet fuel in the catalytic fractionator, and those 1,000 barrels sell for 130 CU

The same process takes 45 minutes for 1000 barrels of oil to heat, and those 1000 barrels are sold at 90 um Each
day, at most 20,000 barrels of oil can be purchased, and eight hours of the catalytic fractionator are available.
Formulate an LP that maximizes the benefits of Colpetro.

MODEL:
X i '. Quantity of miles of ba rr
used oil iles
To produce thousands of barrels
product numbers ^
M ax z = -40^ 1 + 60^ 2 + 40^ 3 + 130^ 4 + 90^ 5
Subject to
^1 - 1⁄2 ^2 - 1⁄2 ^3 =0
^4 + 3⁄4 ^5 ≤ 8
^1 ≤ 2000
LINEAR PROGRAMMING EXERCISES. MODELING

^1 - 1⁄2 ^4 - 1⁄2 ^5 = 0
^^ ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 43.

Cartauto has a budget of 30000000 um For advertising. To increase automobile sales, the firm is considering
incorporating advertising in a newspaper and on television. The more Cartauto advertises in a medium, the less
effective each additional advertisement is. The table shows the number of new customers each new advertisement
provides. Each newspaper advertisement costs 100,000 um, and each television advertisement costs 1000,000
um. At most 30 ads can be published in the newspaper and 15 ads on television. How can Cartauto maximize the
number of customers through advertising?
MODEL:

Subject to

To raise the level of element j

x
í j : Number of notices in option
^
11 + ^ + ^
12 13 ≤ 30
^21 + ^22 + ^23 ≤ 15
^
11 ≤ 10
^12 ≥ 11
^12 ≤ 20
^13 ≥ 21
^13 ≤ 30
^21 ≤5
^22 ≥6
^22 ≤ 10
^23 ≥ 11
^23 ≤ 15
^^j ≥0
M ax z = 900^ 11 + 600^ 12 + 300^ 13 + 10000^ 21 + 5000^ 22 +
2000^ 23
100000(^11 + ^12 + ^13) + 1000000(^21 + ^22 + ^23) ≤ 30000000
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 44.

A person has 100,000,000 monetary units and knows of the existence of three actions to invest: the first will give a
profit of 4% on what was invested, the second 5% and the third 5.5%; However, in none of them can you invest
more than 40% of the total capital and at least 25,000,000 monetary units in the second. "How to invest that initial
amount to maximize the profit on the investment?

Pose the previous problem as a linear programming model.

MODEL:

^ 1 : amount invested in share 1 ^ 2 : amount invested in share 2 ^ 3 : amount invested in share 3

^1 ≤ 40´ Maximum investment in um in the first action
^2 ≤40´ Maximum investment in um in the second
^ ≤ 40´ action
Maximum investment in um in the third action
3
^2 ≥25´ Minimum investment in the 2nd action
X 1 + X 2 + X ≤ 100´ Subject to of money in um.
Availability
3
M ax z = 0.04^ 1 + 0.05^ 2 + 0.055^ 3

^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 45.

You are a student of the Operations Research course and you have considered the need to maximize the daily
satisfaction that comes from carrying out a series of activities, which are presented in the following list:

ACTIVITIES UNITS OF SATISFACTION (US)

1. having a beer 4
2. Smoke a cigarette 2

3. Play a football game 7

4. Take a walk on the beach 3
5. Read an important book 2
6. Sleep (one hour) 4

Even if you would like to do all the activities, you have some limitations. Of course, you only have 24 hours a day
and activities consume time, like this: activity 1, 15 minutes; activity 2, 10 minutes; activity 3, 2 hours; activity 4, 1
hour; activity 5, 5 hours.

Furthermore, due to the economic hardship in which he lives, it is not possible for him to drink more than five beers
a day, he cannot smoke more than five cigarettes a day for health reasons, he cannot play more than two soccer
games due to fatigue, he cannot give more than two walks a day due to boredom and cannot read more than two
books a day due to visual fatigue.

As for sleep, you know that you cannot sleep more than 10 hours a day and no less than 7. What are the daily
activities and at what level should they be performed to achieve your goal, maximizing your satisfaction per day,
without violating existing limitations?

MODEL:
x: Number of times per day you must perform the activity
Max z = 4^ 1 + 2^ 2 + 7^ 3 +3 ^ 4 + 2^ 5 + 4^ 6
Subject to
1/4^1 + 1/6^2 + 2^3+^4 + 5^5 + ^6 ≤ 24 Availability of hours per day
^1 ≤5 Maximum number of beers
^2 ≤5 Maximum number of
^3 ≤2 Maximum matches per
^4 ≤2 Maximum walks per day
^5 ≤2 Maximum books per day
^6 ≤ 10 Maximum hours to sleep
^6 ≥ 7 Minimum hours to sleep
^1,^2, ^3, ^4, ^5,^6 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 46.

The Business Administration Student Association has 100,000 u. m. and has thought about investing them in two
businesses. The first one brings you a profit of 25 u. m. monthly and the second 40 u. m. per month in every 100
u. m. inverted. Due to certain conditions imposed by the Members' Assembly, at least 25% of the capital must be
invested in the first business and no more than 50% in the second.

Furthermore, the amount invested in the latter should not be greater than 1.5 times the amount invested in the
former. It is requested to pose this problem as a linear programming model.

MODEL:
^1 : amount of hundreds of pesos invested in the business1
^2: amount of hundreds of pesos invested in the business2

Availability of um.
Max z = 25^1 + 2
Minimum investment in the first business
Subject 1 40^ Maximum investment in the second business
to ^ + ^ 2 ≤ 1000 Investment maximum
^ ≥ 250
1
^2 ≤ 500
-1.5^1 + ^2 ≤ 0
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 47.
Lechera Cartagena has a reception capacity of 50,000 liters of milk per day. The administration requires that at
least 30,000 liters be bottled per day and the rest be used to produce flavored milk or butter. The contribution of
each liter of milk to the utility, according to its use, is: bottled, 100u. m.; flavored, 80 um; and butter 50u. m.

The butter making equipment can handle at least 6,000 liters of milk per day; The packaging section can handle at
least 40,000 liters per day and the flavored milk equipment up to 20,000 liters per day.

The company wants to know how much milk in liters is converted into butter or flavored milk and how much should
be bottled (regular milk) to maximize profit.

MODEL:
^1 : quantity of liters of milk used
to bottle
^2 : number of liters of milk used
for flavored milk
^3 : number of liters of milk used
forButter
X 1 + X 2 + X ≤ 50,000 Availability of liters of milk
3
^1 ≥ 30,000 Minimum number of liters of milk to be bottled
^₂ + ^3 ≤ 20,000 Maximum liters of flavored milk or mant.
^ ≥ 6,000 Availability of liters of butter
3
^1 ≥ 40,000 Maximum availability of liters to be bottled
Subject to
^2 ≤ 20,000 Maximum availability of liters of milk
M ax z = 100^ 1 + 80^ 2 + 50^ 3

^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 48.

(Transportation) Cervecería El Halcón produces a brand of beer in three plants, in three different cities. From
these three plants, beer is shipped by truck to four distribution centers; Administrators have begun conducting a
study to determine whether transportation costs can be reduced. The production managers of the three plants
have estimated the expected monthly production for their respective plants.

A total of enough to load 300 trucks will be manufactured in the three plants. The general manager of the brewery
has assigned the total production to the respective centers by examining data from previous months. The table
presents production and demand information along with transportation costs for each combination of supply and
demand. How many trucks of beer should be shipped from each plant to each distribution center to minimize
transportation costs?

MODEL:
x
ij Number of trucks leaving the plant at the center j
Mi n z = 4000^ 11 + 5130^ 12 + 6500^ 13 + 8000^ 14 + 3520^ 21 + 4600^ 22 + 6900^ 23 + 7900^ 24 + 9900^ 31 +
6820^ 32 + 3880^ 33 + 6800^ 3. 4
Subject to
^11 + ^12 + ^13 + ^14 ≤ 75 Maximum bid P1
^21 + ^22 + ^23 + ^24 ≤ 125 Maximum bid P2
≤ 100 Maximum bid P3
^31 + ^32 + ^33 + ^34
^11 + ^21 + ^31 ≥80 C1 Demand
^12 + ^22 + ^32 ≥65 C2 Demand
^13 + ^2 + ^33 ≥70 C3 Lawsuit
^14 + 3 ^24 + ^34 ≥85 C4 Lawsuit
x
ij ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 49.
(Assignment) The Administrative Board Local (JAL) of Commune
road paving. The board has the problem of determining which contractors will carry out the projects. Bidding for
the projects was opened among local contractors; Three presented their completed documents. The cost of each
project according to the proposal of each contractor is presented in the following table (in millions of um).

How should contracts be assigned if the total costs of all of them are to be minimized and if, to avoid political
discontent, a contract is to be awarded to each contractor?

MODEL:
x
ij Contractor assigned to the project
Min z = 280^ 11 + 320^ 12 + 360^ 13 + 360^ 21 + 280^ 22 + 300^ 23 + 380^ 31 + 340^ 32 + 400^ 33
Subject to
^11 + ^12 + ^13 =1
^21 + ^22 + ^23 =1
^31 + ^32 + ^33 = 1
^11 + ^21 + ^31 =1
^12 + ^22 + ^32 =1
^13 + ^23 + ^33 = 1
^^j = 0.1
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 50.

The Higgins Company manufactures high-precision metal parts used in racing car engines. The piece is
manufactured in a forging and refining process and minimal quantities of various metals are necessary. Each
piece requires 40 ounces of lead, 48 of copper and 60 of cast iron. There are 4 types of ore available for the
forging and refining process. Type 1 ore contains 4 ounces of lead, 2 of copper, and 2 of cast steel per pound.
One pound of type 2 ore contains 2 ounces of lead, 6 of copper, and 6 of cast steel. One pound of type 3 material
contains 1 ounce of lead, 4 of copper, and 4 of cast steel. Finally, type 4 ore contains % ounce of lead, 1 ounce of
copper, and 8 ounces of cast steel per pound. The cost per pound for the four minerals is $20, $30, $60, and $50,
respectively. The company would like to mix the minerals in a way that meets the specifications of the parts and
minimizes the cost of manufacturing them. Formulate the model.

MODEL:
X1: Ounces of mineral guy1 used in heprocess
X2: Ounces of mineral guy2 used in heprocess
x 3 : Ounces of mineral guy 2 used in heprocess
x 4 : Ounces of mineral guy 2 used in heprocess
Min z = 20x 1 + 30x 2 + 60x 3 + 50x4
Subject to
4x 1 +2 x 2 +x 3 + 0.5x4 > 40 Request ofounces lead
2x 1 + 6x 2 + 4x 3 + 1x 4 > 48 Request ofounces copper
2x 1 + 6x 2 +4x 3 + 8x 4 > 40 Request ofounces of ironstrained
x 1 ,x 2 ,x 3 ,x 4 > 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 51.1
In a laboratory, 4 products P1, P2, P3, P4 are manufactured that consume one day per unit in their complete
production process, although several units can be produced simultaneously. The space (m2) in the warehouse
and the labor (number of workers) available limit production. The following table contains relevant data on the
production process, as well as manufacturing costs and sales prices (in thousands of pesos).

Product Pi Q2 Q3 P4 Availability
Area (m2 /unit) 10 30 80 40 900
Workers /und. 2 1 1 3 80
Costs/unit 20 30 45 58
Sale price/unit. 30 50 85 90

a) Find the maximum profit production plan

MODEL:
X1: Amount of product 1to produce andsell
X2: Amount of product 2to produce andsell
x3: Amount of product 3to produce andsell
x4: Amount of product 4a produce and sell
^ax z = 10x 1 + 20x 2 + 40x 3 + 32x 4 |
Subject to
10x 1 + 30x +80x + 40x 4 < 900 Availability in m ^^^^B
2 3
2

2x 1 + x 2 + x 3 + 3x < 80 4 Availability of workers

x 1 ,x 2 ,x 3 ,x 4 > 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 52.

The firm Productos Lo Mejor S. TO. Manufactures three products on two machines. In a typical week, 40 hours are
available on each machine. The contribution to profits and production time in hours per unit are as follows:

Two operators are required for machine 1, therefore two hours of labor must be scheduled for each time of
time of the machine 1; In machine 2 it is only required an operator There is a total of
100 hours of labor available to assign to machines in the following week. Product 1 does not can constitute
more than 50% of the units that are manufactured and that product 3 must
constitute
at least 20% of the units produced.

How many units of each product should be manufactured in order to maximize the contribution to profits?

MODEL:
^1 : Amount of Product1 ^ produceandsell
^2 : Amount of Product2 ^ produceandsell
^3 : Amount of Product3 ^ produce sell

M ax z = 30^ 1 + 50^ 2 + 20^

3 Subject to
0.5^1 + 2^2+ 0.75^3 ≤ 40 Availability in hr on machine 1
^1 + ^2+ 0.50^3 ≤ 40 Availability in hr on machine 2
Availability in labor hours
3^1 + 5^2X 1 +X+2 2^
+X 3 ≤ 100
Requirement 50%
—X1—< 0.5 3
x3 ≥ 0.2
Requirement 20%
X 1 +X 2 +X 3
^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 53.
48 . The Cartagena Chamber of Commerce periodically sponsors seminars and programs on public services.
Promotional plans are currently being made for this year's program. The alternatives advertising They
include television, radio and newspapers. They are shown at
Below are audience estimates, costs, and limitations on maximum media usage:

To ensure a balanced use of advertising media, radio advertisements must not exceed 50% of the total number of
advertisements authorized. Additionally, television is required to constitute at least 10% of the total number of
authorized advertisements.

If the advertising budget is limited to 18200 um How many commercial messages should be placed in each
medium in order to maximize total contact with the audience?

MODEL:
^1 : amount of messages placed in television
^2 : amount of messages placed in radio
^3 : amount of messages placed in newspaper
M ax z = 100000^ 1 + 18000^ 2 + 40000^ 3
Subject to
um availability
Problem 3..................................................................................................................................................4
maximum tv utilization
Maximum radio utilization
Problem 4................................................................................................................................................10
Maximum newspaper usage
Problem 1................................................................................................................................................11
50% requirement
Problem 2................................................................................................................................................17
10% requirement
MODEL:..............................................................................................................................................17
Problem 3................................................................................................................................................18
Problem 8................................................................................................................................................19
MODEL:..............................................................................................................................................19
Problem 9................................................................................................................................................20
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:..............................................................................................................................................20
Problem 10..............................................................................................................................................21
MODEL...............................................................................................................................................21
Problem 11..............................................................................................................................................22
MODELING........................................................................................................................................22
Problem 12..............................................................................................................................................22
MODEL:..............................................................................................................................................23
Problem 13..............................................................................................................................................24
MODEL:..............................................................................................................................................24
Problem 14..............................................................................................................................................25
MODEL:..............................................................................................................................................25
Problem 15..............................................................................................................................................26
MODEL:..............................................................................................................................................26
Problem 16..............................................................................................................................................27
MODEL:..............................................................................................................................................27
Problem 17..............................................................................................................................................28
MODEL:..............................................................................................................................................28
Problem 18..............................................................................................................................................29
MODEL:..............................................................................................................................................29
Problem 19..............................................................................................................................................30
MODEL:..............................................................................................................................................30
Problem 20..............................................................................................................................................31
MODEL:..............................................................................................................................................31
Problem 21.1...........................................................................................................................................32
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 22..............................................................................................................................................33
MODEL:..............................................................................................................................................33
Problem 23..............................................................................................................................................34
MODEL:..............................................................................................................................................34
Problem 24..............................................................................................................................................35
MODEL:k............................................................................................................................................35
Problem 25..............................................................................................................................................36
MODEL:..............................................................................................................................................36
Problem 26..............................................................................................................................................37
MODEL:..............................................................................................................................................37
Problem 27..............................................................................................................................................38
MODEL:..............................................................................................................................................38
Problem 28..............................................................................................................................................39
MODEL:..............................................................................................................................................39
Problem 29..............................................................................................................................................40
MODEL:..............................................................................................................................................40
Problem 30..............................................................................................................................................41
MODEL:..............................................................................................................................................41
Problem 31..............................................................................................................................................41
MODEL:..............................................................................................................................................42
Problem 32..............................................................................................................................................52
MODEL:..............................................................................................................................................52
Problem 33..............................................................................................................................................53
MODEL:..............................................................................................................................................53
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 34..............................................................................................................................................54
Problem 35..............................................................................................................................................55
MODEL:..............................................................................................................................................55
Problem 36..............................................................................................................................................56
MODEL:..............................................................................................................................................56
Problem 37..............................................................................................................................................57
MODEL:..............................................................................................................................................57
Problem 38..............................................................................................................................................58
MODEL:..............................................................................................................................................58
Problem 39..............................................................................................................................................59
MODEL:..............................................................................................................................................59
Problem 40..............................................................................................................................................60
MODEL:..............................................................................................................................................60
Problem 41..............................................................................................................................................61
MODEL:..............................................................................................................................................61
Problem 42..............................................................................................................................................61
MODEL:..............................................................................................................................................62
Problem 43..............................................................................................................................................63
MODEL:..............................................................................................................................................63
Problem 44..............................................................................................................................................64
MODEL:..............................................................................................................................................64
Problem 45..............................................................................................................................................65
MODEL:..............................................................................................................................................65
Problem 46..............................................................................................................................................66
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:..............................................................................................................................................66
Problem 47..............................................................................................................................................67
MODEL:..............................................................................................................................................67
Problem 48..............................................................................................................................................68
MODEL:..............................................................................................................................................68
Problem 49..............................................................................................................................................69
MODEL:..............................................................................................................................................69
Problem 50..............................................................................................................................................70
MODEL:..............................................................................................................................................70
Problem 51.1...........................................................................................................................................71
MODEL:..............................................................................................................................................71
Problem 52..............................................................................................................................................72
MODEL:..............................................................................................................................................72
Problem 53..............................................................................................................................................73
MODEL:..............................................................................................................................................73
Problem 54..............................................................................................................................................81
MODEL:..............................................................................................................................................81
Problem 55..............................................................................................................................................82
MODEL:..............................................................................................................................................82
Problem 56..............................................................................................................................................83
MODEL:..............................................................................................................................................83
Problem 57..............................................................................................................................................84
MODEL:..............................................................................................................................................84
Problem 58..............................................................................................................................................85
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:..............................................................................................................................................85
Problem 59..............................................................................................................................................86
MODEL:..............................................................................................................................................86
Problem 60..............................................................................................................................................92
MODEL:..............................................................................................................................................92
Problem 61..............................................................................................................................................93
MODEL:..............................................................................................................................................93
Problem 62..............................................................................................................................................94
MODEL:..............................................................................................................................................94
Problem 63..............................................................................................................................................95
MODEL:..............................................................................................................................................95
Problem 64..............................................................................................................................................96
MODEL:..............................................................................................................................................96
Problem 65..............................................................................................................................................96
MODEL:..............................................................................................................................................97
E— 1 +...................................................................................................................................................97
Problem 66..............................................................................................................................................98
MODEL:..............................................................................................................................................98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3.......................................................99
MODEL:..............................................................................................................................................99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1................................................100
MODEL:............................................................................................................................................100
Problem 69............................................................................................................................................101
Problem 70............................................................................................................................................102
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:............................................................................................................................................102
Problem 71............................................................................................................................................103
Problem 72............................................................................................................................................104
Problem 73.1.........................................................................................................................................105
MODEL:............................................................................................................................................105
Problem 74............................................................................................................................................106
MODEL.............................................................................................................................................106
Problem 75............................................................................................................................................107
Problem 76............................................................................................................................................108
MODEL:............................................................................................................................................108
Problem 77............................................................................................................................................114
Problem 78............................................................................................................................................115
MODEL:............................................................................................................................................115
Problem 79............................................................................................................................................116
MODEL:............................................................................................................................................116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2................................................117
MODEL:............................................................................................................................................117
Problem 81............................................................................................................................................118
Problem 82............................................................................................................................................119
MODEL:............................................................................................................................................119
Problem 83............................................................................................................................................120
MODEL:............................................................................................................................................120
Problem 84............................................................................................................................................121
MODEL:............................................................................................................................................121
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 85............................................................................................................................................127
MODEL:............................................................................................................................................128
Problem 86............................................................................................................................................129
MODEL:............................................................................................................................................129
Problem 87............................................................................................................................................130
MODEL:............................................................................................................................................130
Problem 88............................................................................................................................................131
Problem 89............................................................................................................................................137
Problem 90............................................................................................................................................138
MODEL:............................................................................................................................................138
Problem 91............................................................................................................................................139
MODEL:............................................................................................................................................139
Problem 92............................................................................................................................................140
BIBLIOGRAPHY.....................................................................................................................................141
X1+X2+X3
^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 54.
The Hipódromo company is experimenting with a special diet for its racehorses. The feeds available for the diets
are: a common horse feed product, a vitamin-enriched oat product, and a new vitamin and mineral additive. The
nutritional values, in units per pound, and costs for the three foods are as follows:

1---------------------------------------------------------
Standard
Additive
food Enriched oats
Ingredient A 0.8 0.2 0
Ingredient B 1 1,5 3
Ingredient C 0,1 0.6 2
| Cost per pound (um) 0,25 0,5 3|

Suppose the horse trainer sets the daily diet requirements at three units of ingredient A, six units of ingredient B,
and four units of ingredient C. For weight control purposes , the trainer does not want a horse's total daily feed to
exceed 6 pounds.

What is the optimal mixture per day of the three food components?

MODEL:
^1 : amount of Libras of standard feed used
^2 : amount of Libras of used oats
^3 : amount of Libras of additive used

Requirement in units of ingredient A Requirement in units

of Mi n z = 0.25^ 1 + 0.50^ 2 + 3^ ingredient B Requirement in units of ingredient C
Subject 3
Maximum requirement in pounds of the mixture
to 0.8^1 + 0.2^2 ≥3
^1 + 1.5^2 + 3^3 ≥ 6
0.1^1 + 0.6^2 + 2^3 ≥ 4
^1 + ^2 + ^3 ≤ 6
^1, ^2,^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 55.

The Maine Snowmobile Company manufactures two types of machines, each requiring a different manufacturing
technique. The deluxe machine requires 18 hours of labor, 9 hours of testing, and produces a profit of $400. The
standard machine requires 3 hours of labor, 4 hours of testing, and produces a profit of $200. There are 800 hours
for labor and 600 hours for testing each month.

It has been forecast that the monthly demand for the deluxe module is no more than 80 and for the standard
machine is no more than 150. Management wants to know the number of machines of each model that must be
produced to maximize total profit. Formulate this problem as a linear programming model.

MODEL:
^1 : Quantity of other type 1 machines produced and sold
^2: Quantity of other type 2 machines produced and sold
Max z = 400^ 1 + +200^ 2
Subject to

18^1 + 3^2 ≤ 800 Availability of labor hours

9^1 + 4^2 ≤ 600 Availability in test hours
x
1
≤ 80 Maximum demand type 1
^2 ≤ 150 Maximum demand type 2
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 56.
The El Hogar company produces a line of metal articles, which consists of four products. The manufacturing
system is divided into five stages: cutting, die-cutting, glazing, finishing and packaging. The relevant information,
both on the production system and on the article, is presented below.

PRODUCTION RATE (units/hour)

Capacity
DEPARTMENT Product 1 Product 2 Product 3 Product 4
(Hour'Month)
chopped up 25 6 20 10 400
Die cut 14 8 20 10 380
Enamel 17 9 33 8 490
Finish 20 4 8 450
—
Packed 50 13 50 20 400
Furthermore, it is known that in the following month only 1,200 m2 of the sheet produced by products 1 and 2 will
be available. Product 1 requires 0.5 m 2 per unit and product 2 requires 0.8 m 2 per unit.

Formulate the previous problem as a linear programming model.

MODEL:
^1 : amount of product1 ^produce sell
^2: amount of product2 ^produce sell
^3 : amount of product3 ^produce sell
^4: amount of product4 ^produce sell
25^1 + 6^2 + 20^3 + 10^4 ≤ 400 Availability in cutting hours
14^1 + 8^2 + 20^3 + 10^4 ≤ 380 Availability in die-cutting hours
17^1 + 9^2 + 33^3 + 8^4 ≤ 490 Availability in enamelling hours
20^1 + 4^2 + 8^4 ≤ 400 Availability in finishing hours
Subject to
50^1 + 13^2 + 50^3 + 20^4 ≤ 400 Availability in packaging hours
^1 ≥ 500 Minimum demand for product 1
^1 ≤ 5000 Maximum demand for product 1
^2 ≥ 750 Minimum demand for product 2
^2 ≤ 6000 Maximum demand for product 2
^3 ≥ 650 Minimum product demand 3
^3 ≤ 8000 Maximum demand for product 3
^4 ≤ 3500 Maximum demand for product 4
0.5^1 + 0.8^2 ≤ 1200 Space availability in m 2
M ax z = 50^ 1 + 100^ 2 + 40^ 3 + 100^ 4

^1, ^2, ^3, ^4 ≥ 0

 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 57.

The Manizales Hilados y Tejidos factory requires manufacturing two fabrics of different quality T 1 and T 2 ; 500 kg
of yarn A, 300 kg of yarn B and 108 kg of yarn C are available. To obtain one meter of T 1 daily, 125 grams of A,
150 grams of B and 72 grams of C are needed; To produce one meter of T 2 per day, 200 g of A, 100 g of B and
27 g of C are needed.

T 1 sells for $4000 per meter and T 2 sells for $5000 per meter. If maximum profit is to be obtained, how many
meters of T 1 and T 2 should be manufactured?

Pose the previous problem as a linear programming model.

MODEL:
^1 : Number of meters of t 1 manufactured
^2: Number of meters of t 2 manufactured
Max z = 4000^ 1 + 5000^ 2
Subject to
125^1 + 200^2 ≤ 500000 Availability of kg of yarn A
150^1 + 100^2 ≤ 300000 Availability of kg of yarn B
72^1 + 27^2 ≤ 108000
Availability of kg of C yarn
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 58.

The Caldas company has a production system made up of three sections, through which it produces two products.
In the first section, the most that can be processed is 300 units of article 1 or 400 of product 2 daily; The second
section manufactures at least 350 units of product 1 or 450 units of product 2 per day. The third section can
produce up to 400 units of item 1 or 500 units of item 2 per day.

If products 1 and 2 generate a profit of $1000 and $700 respectively. How many of each product should be
manufactured to maximize profit?

Pose the previous problem as a linear programming model.

MODEL:
^1 : Quantity of product 1 produced
^2: Quantity of product 2 produced
Max z = 1000^ 1 + 700^ 2
Subject to
4^1 + 3^2 ≤ 1200
9^1 + 7^2 ≤ 3150
5^1 + 4^2 ≤ 2000
^1,^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 59.
The office in charge of toll collection in the state of Atlanta has the following minimum daily requirement for toll
collaborators.

Period 24 hours a day 6-10 PM

6 – 10 AM 10 PM-2 AM
10 AM – 2 PM 2 – 6 AM
2-6 PM Minimum number of toll drivers

Toll drivers report to their work site at the beginning of each period to work 8 consecutive
hours. The office wishes to determine the number of toll drivers it must employ to have
sufficient staff available each period. Formulate this problem as a linear programming model.

MODEL:
Number of workers who start working in period i
in z = X + X 7 + Xr> + X + Xe + X,
subject to
Problem 3 4
1 + ^6 ≥ Problem 4 10
1 + ^2 ≥
^2 + ^3 ≥ Problem 1 11
^ 3 + ^4 ≥
^4 + ^5 ≥ Problem 2. 17
^5 + ^6 ≥
m X. > MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
Problem 14. 25
MODEL: 25
Problem 15. 26
MODEL: 26
Problem 16. 27
MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
Problem 24. 35
MODEL:k 35
Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
MODEL: 52
Problem 33. 53
MODEL: 53
Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 58
Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
Problem 47. 67
MODEL: 67
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 48. 68
MODEL: 68
Problem 49. 69
MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
MODEL: 72
Problem 53. 73
MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
MODEL: 93
Problem 62. 94
MODEL: 94
Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
Problem 65. 96
MODEL: 97
E— 1 + 97
Problem 66. 98
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
Problem 81. 118
Problem 82. 119
MODEL: 119
Problem 83. 120
MODEL: 120
Problem 84. 121
MODEL: 121
Problem 85. 127
MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 89. 137

Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
Problem 92. 140
BIBLIOGRAPHY. 141
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 60.
Florida Oranges Inc. (FOI) must determine the optimal number of boxcars to pick, pack and transport its “super”
and “regular” oranges each week. The labor available to pick and pack is 4000 hours per week, to pick, pack and
leave a van loaded with super oranges, it takes 30 hours and for regular oranges it takes 15 hours. The FOI has a
maximum amount of cash on hand of $60,000. The rental cost for each van loading and transportation process is
$200 and $300 for regular and super oranges respectively. The profit per van is $2,000 for regular oranges and
$2,500 for super oranges. FO I wishes to determine the optimal combination of boxcars per type of orange that
maximizes weekly profit.

MODEL:
^1 : number of vans loaded with Commons
^2: Quantity of urgent items loaded with Super
M ax z = 2000^ 1 + +2500^ 2 Subject to
15^1 + 30^2 ≤ 4000
Labor availability
200^1 + 300^2 ≤ 60000
Money availability
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 61.

A company manufactures and sells two models of lamps, L 1 and L 2 . Its manufacture requires manual work of 20
minutes for the L 1 model, and 30 minutes for the L 2 model. A machine job of 5 minutes for L 1 and 10 minutes for L 2
. There are 100 hours per month for manual work and 80 hours per month for machine work. Knowing that the
profit per unit is $15 and $10 respectively for the lamps, plan production to obtain maximum profit.

MODEL:
^1 : amount of lamps L 1 produced and sold
^2: amount of lamps L 2 produced and sold
Max z = 15^ 1 + +10^ 2
Subject to
20^1 + 30^2 ≤ 6000 Availability in min of manual work
5^1 + 10^2 ≤ 4800 Availability in min on machine
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 62.
A ship has three holds: bow, stern and center; The capacity limits for those three warehouses are:

WINERY WEIGHT ( VOLUME (FT 3 )

Bow 2000 100000
Stern 1500 300000
Center 3000 135000

The following loads are offered and those responsible for the ship can accept all or part of each load:

BURDEN VOLUME
QUANTITY (0 (T/FT) UTILITY (u.mJt)
6
TO 6000 60
b 4000 50 8
c 2000 25 ________5
________1

Seeking to maintain balance on the boat, the weight of each hold must be proportional to its capacity in tons. How
should the burden be distributed in order to maximize total profits?
Pose the previous problem as a linear programming model.

MODEL:
x
ij Quantity of tons of cargo placed in the warehouse
Max z = 6(^11 + ^12 + ^13) + 8(^21 + ^22 + ^23) + 5(^31 ^32 + )
Subje to + ^33
^11 + ct ^21 + ^31 ≤ 2000
^12 + ^22 + ^32 ≤ 1500
^13 + ^
23 + ^33 ≤ 3000
60^11 + 50^21 + 25^31 ≤ 100000
60^12 + 50^22 + 25^32 ≤ 300000
60^1 + 50^23 + 25^33 ≤ 135000
^11 + ^12 3+ ^13 ≤ 6000
^21 + ^22 ^23 ≤ 4000
+ ^31 + ^32 + ^33 ≤ 2000
Xj ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 63.
A company is dedicated to the production and distribution of interior and exterior paints; Two raw materials MP1
and MP2 are used for the production of paints. The maximum availability of MP1 is 20 tons per day and that of
MP2 is 9 tons per day. Daily raw material requirements
onelada are the

boar
d
Market research has established that the daily demand for interior paint cannot be greater than exterior paint by
more than one ton. Furthermore, the study notes that the maximum demand for interior paint is limited to two tons
per day. How much interior and exterior paint should the company produce each day to maximize gross revenue?

MODEL:
^1 : number of tons of paint
For interiors produced
^2 : number of tons of paint
Paraexteriors produced
M ax z = 100^ 1 + 300^ 2 (thousands)

3^1 + 7^2 ≤ 20

MP1 ton availability

4^1 + ^2 ≤ 9 MP2 ton availability
-^1 + ^2 ≥ 1 Request
^1 ≤2 Availability in exterior paint tone
^1, ^2 ≥ 0

Subject to
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 64.
With the beginning of the course, some offers for school supplies will be launched. Some stores want to offer 600
notebooks, 500 folders and 400 pens for the offer, packaging them in two different ways. In the first block you will
put 2 notebooks, 1 folder and 2 pens. In the second, they will put 3 notebooks, 1 folder and 1 pen. The prices for
each package will be $8 and $7, respectively. How many packages should you put in each type to obtain the
maximum benefit.

MODEL:
^1 : quantity of type one packets sold
^2: quantity of type two packets sold\
Max z = 8^ 1 + +7^ 2
Subject to
2^1 + 3^2 ≤ 600 Notebook availability
^1 + ^2 ≤ 500 Folder Availability
2^1 + ^2 ≤ 400 Pen Availability
^1, ^2 ≥ 0
Problem 65.
A garment company can produce 1,000 pants or 3,000 blouses (or a combination of both) daily. The finishing
department can work on 1,500 pants or 2,000 blouses (or a combination of both) each day; The marketing
department requires that at least 400 pants be produced daily. If the profit of a pair of pants is 4000 monetary units
and the utility of a blouse is 3000 monetary units. How many units of each must be produced to maximize profits?
 LINEAR PROGRAMMING EXERCISES. MODELING

Pose the previous problem as a linear programming model.

MODEL:
^1 : Quantity of antIons produced and sold two n
^2:_____Quantity of blouses produced and sold
Max Z = 4000^ 1 + 3000^ 2
Subject to
+ ^2- < 1 Maximum production^^^^^^^H
1000 3000
E— 1 +
—2 ≤1 Production in dept. Finishing
1500 2000
^1 ≥ 400 Minimum production of pants
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 66.
On a chicken farm, a diet is given, to gain weight, with a minimum composition of 15 units of substance A and
another 15 of substance B. There are only two types of compounds on the market: type X with a composition of
one unit of A and 5 of B, and the other type, Y, with a composition of five units of A and one of B. the price of type
X is $10 and type Y is $30. What quantities of each type must be purchased to cover needs with a minimum cost.

MODEL:
^1 : Amount of type X compound used
^2: Amount of compound type and used
Mi n z = 10^ 1 + +30^ 2
Subject to
^1 + 5^2 ≥ 15 Minimum composition of A
5^1 + ^2 ≥ 15 Minimum composition of B
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3

600 g of a certain drug are available to make large and small pills. The large ones weigh 40 g and the small ones
30 g. You need at least three large pills, and at least twice as many small ones as the large ones. Each large pill
provides a benefit of $2 and the small one provides a benefit of $1. How many pills of each kind must be made so
that the benefit is maximum.

MODEL:

quantity of large pastilles prepared quantity of small pastilles prepared

Max z = 2^ 1 + ^ 2
40^1 +30^2≤ 600 Availability in gr of thedrug
^1 ≥ 3 Request of pills big
- ^1 + 2^2 ≥ 0 Request
^1 , ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1

A department store wants to sell off 200 shirts and 100 pants from the previous season. For this they launch two
offers, A and B. Offer A consists of a lot of a shirt and a pair of pants, which sell for $30. Offer B consists of a lot of
three shirts and one pair of pants, which sells for $50. It is not desired to offer less than 20 lots of offer A or less
than 10 of offer B. How many lots of each type must be sold to maximize profit.

MODEL:
^1 : Number of lots of A vend dos
^2: Quantity of lots of B sold two

Max z = 30^ 1 + 50^ 2

Subject
to ^11 +
^ + 3^ ≤ 100
^22 ≤ 200 Shirt availability
Pants availability
^1 ≥ 20 Minimum requirement of lot A
10
^1, ^22 ≥ 0 Minimum requirement of lot B
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 69.
The current government requires maximum support for the proposed development plan for next year to be
approved in Congress. Through his advisors he has learned that there are 35 congressmen from a coalition group
and 27 from another party who have not yet defined their vote. The president then decides to make a telephone
call with these undecided congressmen to convince them to support him, knowing that he has a 0.9 probability of
success with the members of the coalition and 0.6 with another party. How many congressmen from each party
should they telephone to maximize their probability of success if they cannot make a total number of calls greater
than 30 under the current austerity regime?

MODEL:
^1 : Number of members of the coalition telephoned
^2: Number of c^n^resists from another party telephoned
Max z = 0.9^ 1 + 0.6^ 2
Subject to

^1 + ^2 ≤ 30 Maximum calls
x1 ≤ 35 Availability of coalition congressmen
^2 ≤ 27 Availability of undecided congressmen
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 70.
A company needs to acquire four products (1, 2, 3 and 4) and it is known that there are three companies (A, B and
C) that process and sell them. The difference between the companies means that the articles are distinguished by
their quality, that is, by the probability that they are less defective, and by their prices:

Quality 1 2 3 4 Price 1 2 3 4
TO 0,4 0.6 0.8 0,7 TO 6 4 2 3
b 0,6 0,7 0,4 0,9 b 8 7 5 9
c 0.7 0,6 0,5 0.8 c 3 5 7 6

If the aim is to have an average of no less than 8, 14, 23 and 15 units without defects of products 1, 2, 3 and 4
respectively. If you want to minimize the cost you should buy.

MODEL:
x
íJ : Quantity of items i that are purchased at the ^m^resaj
M ax z = 6^ 11 + 4^ 21 + 2^ 31 + 3^ 41 + 8^ 12 + 7^ 22 + 5^ 32 + 9^ 42 + 3^ 13 + 5^ 23 + 7^ 33 + 6^ 43
Minimum requirement without defect product 1
Minimum requirement without defect product 2
Subject to Minimum requirement without product defect 3
0.4^11 + 0.6^12 + 0.7^13 ≥ 8 Minimum requirement without product defect 4
0.6^21 + 0.7^22 + 0.6^23 ≥ 14
0.8^31 + 0.4^32 + 0.5^33 ≥ 23
0.7^41 + 0.9^42 + 0.8^43 ≥ 15
^^ J ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 71.
A company produces two products, A and B. Each unit of A requires 2 hours on each machine and 5 hours on a
second machine. Each unit of B requires 4 hours on the first machine and 3 hours on the second machine. There
are 100 hours per week on the first machine and 110 hours on the second machine. If the company makes a profit
of $70 for each unit of A and $50 for each unit of B. How much of each unit must be produced in order to maximize
total profit.

Product Machine 1 Machine 2 Utility/kilo

TO 2 5 $ 70
b 4 3 $ 50
MODEL:
^1 : quantity of product A to produce and sell
^2: quantity of product B to be produced and sold

Max z = 70^ 1 + 50^

2
Subject to Availability in hr on machine 1
2^1 + 4^2 ≤ 100
5^1 + 3^2 ≤ 110 Availability in hr on machine 2
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 72.
A manufacturer produces two products A and B, each of which requires time on three machines, as follows.

Product Machine 1 Machine 2 Machine 3 Utility

TO 2 4 3 $ 240
b 5 1 2 $ 300

If the numbers of hours available on the machines per month are 200, 240 and 190 in the case of the first, second
and third, respectively. Determine how many units of each product must be produced in order to maximize total
profit.

MODEL:
^1 : quantity of product A to produce and sell
^2: quantity of product B to be produced and sold

M ax z = 240^ 1 + 300^
2 Subject to
2^1 + 5^2 ≤ 200 Availability in hr on machine 1
4^1 + ^2 ≤ 240 Availability in hr on machine 2
Availability in hr on machine 3
3^1 + 2^2 ≤ 190
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 73.1
A company owns two mines, P and Q. The following table shows the production of the elements for each ton
produced by both mines respectively:
•Mines HMolybdenum •Cost per ton|
__________________
or:
The company must produce, each week, at least the following quantities of the metals shown below:
• 87,500 pounds of copper
• 16,000 pounds of zinc
•5000 pounds of molybdenum How much ore must be obtained from each mine in order to meet production
requirements at a minimum cost.m

MODEL:
x,: Quantity of tons of ore obtained from mine P
x 2 : Quantity of tons of ore obtained from mine Q
^m^=50ÜMin.z = 50x 1 + 60x 2
Subject am ^■^ ■50x 1+ 15x 2 >87500 Request
in pounds copper^ M
4x1 + 8x2 > 16000 Request inpounds by ~ziñc^[M
x 1 + 3x > 5000
2 Request inpoundsmolybdenum|
AND____x1,x22o
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 74.
The Manizales FATEMA Television Factory wishes to maximize its profits in the sale of its main items, color
television with plasma screen and high definition color television. A color television with a plasma screen requires
on average four hours per employee to produce parts, two hours per employee for assembly, and 0.5 hours per
employee for inspection.

A high-definition color television requires an average of six hours for parts production, three hours for assembly,
and one hour for inspection. During each production period there are available: 2500 man hours for parts
production, 1100 man hours for assembly and 600 man hours for inspection. The net profit for each color plasma
television is 50,000 monetary units and the net profit for a high-definition color television is 100,000 monetary
units.

Pose the previous problem as a linear programming model.

MODEL
x1 number of pla sm televisions produced
x2 number of A Ita Defi n ition televisions produced
(in thousands) M ax z = 50^ 1 + 100^
2 Subject to
Availability inhr for 4^1 + 6^2 ≤ 2500 production
Availability inhr for 2^1 + 3^2 ≤ 1100 assembly
Availability inhr for 0. 5^1 + ^2 ≤ 600 inspection
^1, ^2 ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 75.
A farmer has 200 pigs that consume 90 pounds of special food every day. The feed is prepared as a mixture of
corn and soybean meal with the following compositions.
Pounds r pound food
Food Calcium per d Fiber Cost either
Corn 0.001 Protein
0.09 0.0 00..
Soya flour 0.002 0.6 2 26
Pig feed requirements are: 0.0

1. At least 1% calcium
2. At least 30% protein
3. Maximum 5% fiber

Determine the food mix with the minimum cost per day.

MODEL
^1 : quantity of pounds of corn used in the mixture
^2: number of pounds of soybeans used in the mixture
E n z = 0.2^ 1 + 0.6^ 2
Subject to
0.001^1 + 0.002^2 ≥ 0.90
0.09^1 + 0.60^2 ≥ 27
0.02^1 + 0.06^2 ≤ 4.5 Calcium requirement
^1 + ^2 = 90 Protein requirement
^1, ^2 ≥ 0 Fiber requirement
Maximum consumption in
pounds
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 76.
Two products are made by passing successively through three machines. Machine time allocated to products is
limited to 10 hours per day. The production time and profit per unit of each product are:
Minutes per unit
Product Machine 1 Machine 2 Machine 3 Revenue
1 10 6 8 2
2 5 20 15 3

Determine the optimal combination of products.

MODEL:
X1: Quantity of product 1 produced and sold
X2: Quantity of product 2 produced and sold
Max z = 2x 1 + 3x 2
Subject to
Problem 3 4
Problem 4 10
Problem 1 11
Problem 2. 17
MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
Problem 14. 25
MODEL: 25
Problem 15. 26
MODEL: 26
Problem 16. 27
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
Problem 24. 35
MODEL:k 35
Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
MODEL: 52
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 33. 53
MODEL: 53
Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
MODEL: 58
Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
Problem 47. 67
MODEL: 67
Problem 48. 68
MODEL: 68
Problem 49. 69
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
MODEL: 72
Problem 53. 73
MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
MODEL: 93
Problem 62. 94
MODEL: 94
Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
Problem 65. 96
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 97
E— 1 + 97
Problem 66. 98
MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
Problem 81. 118
Problem 82. 119
MODEL: 119
Problem 83. 120
MODEL: 120
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 84. 121

MODEL: 121
Problem 85. 127
MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
Problem 89. 137
Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
Problem 92. 140
BIBLIOGRAPHY. 141
x1,x2>0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 77.
We want to mix three metals A, B and C to form 20 tons of a mixture, which must meet certain specifications: the
mixture must contain at least 25% lead, no more than 50% tin and at least 20 % zinc; The compositions and costs
of the three metals are:^^^^^^^^^^^^^^^^^^^^M

Component metal TO b c
Lead 0,1 0,1 0,4

Tin 0,1 0,3 0,6

Zinc 0,8 0,6 0,0

MU/t 14000 20000 30000

What will be the mixture that will produce an alloy that meets the specifications at minimum cost?

MODEL:
x1 Number of tonsfrom A used in the mix\
x2 Number of tons of B used in the mix
x2 Number of tons of C used in the mix]
^Mm z = 14000X 1 + 20000X 2 + 30000x 3
Subject am
x
+ x2+
i x 3 = 20 Requirement in ton of the mixture
0.1x + 0.1x + 0.40x 3 > 5 Minimum lead requirement
0.1x + 0.3x +0.60x 3 < 10 Maximum tin requirement|
1
0.8x 2+ 0.6x2 >4 Minimum zinc requirement^J
x i , x 2 >om
■
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 78.
A company produces two products: A, B. The sales volume of product A is at least 60% of the total sales of the
two products. Both products use the same raw material, whose daily availability is limited to 100 lb. Products A
and B use this raw material at rates of 2 lb/unit and 4 lb/unit, respectively. The sales price of the products is $20
and $40 per unit. Determine the optimal allocation of the raw material to the two products

MODEL:
x1 Quantity of product A produced and sold
x2 Quantity of product B produced and sold
Max z = 20x 1 + 40x 2
Subject to
— > 0.60
X1+X2
2x 1 + 4X 2 < 100
x1,x2>0
A sales requirement
Availability of lbs of raw material
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 79.
It is desired to obtain a sand and cement mixture that has 30% sand and 70% cement; In the market they sell
three kinds of mixtures: mixture 1 has 20% sand and 80% cement and is worth 300,000 monetary units per ton;
Mixture 2 is composed of 40% sand and 60% cement and is worth 200,000 monetary units per ton and mixture 3
has 50% sand and 50% cement and is worth 100,000 monetary units per ton. How much of each mixture must be
purchased to produce the desired mixture at minimum cost?

MODEL:
X1: Number of tons purchased of mix 1
x 2 : Number of tons purchased of mix 2
x 3 Number of tons purchased of mix 3
Min z = 300000X1 + 200000x 2 + 100000x 3

0.2x 1 +0.4x 2 +0.5x 3 = 0.30

0.8x1 +0.6x 2 +0.5x 3 = 0.70
x 1 + x 2 + x 3 =1

Sand requirement
Cement requirement Use
of the product ton
Subject to
x1,x2,x3>0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2

A company produces doors, desks and chairs; Each of these products goes through the cutting, assembly,
painting and packaging departments. All products consume wood, cutting time, assembly time, finishing time and
packaging time, as well as other raw materials (nails, glue). There are limitations on the total hours available per
department due to social security considerations: exposure to volatile products, noise, heavy physical work; They
work five days a week.

You want to know the weekly production that maximizes profits. The following table shows raw material
consumption and profits:

DOORS DESKS CHAIRS AVAILABLE

RESOURCES
Wood (me) 2,5 3,5 2 1000(nr)
Cutting (min/und) 10 15 20 8 hours/day
Assembly (min) 5 20 15 8 hours/day
Paint (min) 5 15 10 6 hours/day
Packaging (min) 8 16 12 7 hours/day
Others (kg) 0,5 0,8 0,7 105 kg/week
Utility/unit (UM) 10000 28000 15000

Pose the previous problem as a linear programming model.

MODEL:

^ 1: number of doors produced and sold number of desks produced and sold number of chairs produced and sold
2
^ :

3
^ : M ax z = 10000^ 1 + 28000^ 2 + 15000^ 3 Subject to
2.5^1 + 3.5^2 + 2^3 ≤ 1000 Availability in m 2 of wood
1/6^1 + 1/4^2 + 1/3^3 ≤ 40 Availability in cut-off hours
1/12^1 + 1/3^2 + 1/4^3 ≤ 40 Availability in hours in assembly
1/12^1 + 1/4^2 + 1/6^3 ≤ 30 Availability in hours in paint
2/15^1 + 4/15^2 + 1/5^3 ≤ 35 Availability in hours in packaging
0.5^1 + 0.8^2 + 0.7^3 ≤ 105 Availability of kg per week of others
^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 81.
A company has three plants with excess production capacity. The three plants have the capacity to manufacture a
certain product and management has decided to use part of the excess production capacity; the product can be
made in three sizes: large, medium and small; These sizes give a utility of 1200 monetary units, 1000 monetary
units and 900 monetary units respectively.

Plants 1, 2, and 3 have excess labor and equipment to produce 500, 600, and 300 units of the product per day,
regardless of the size or size combinations made.

But the amount of storage space available for products in process also limits production levels. Plants 1, 2 and 3
have 9000, 8000 and 5000 m 2 to store this product.

Each large, medium and small size unit produced per day requires 20, 15 and 12 m 2 respectively. Sales forecasts
indicate that 600, 800 and 500 units of large, medium and small sizes can be sold per day. Management wants to
know how many units of each size should be produced by each of the plants, seeking to maximize total profits.

Pose the previous problem as a linear programming model.

MODEL:
X, J. Quantity of products produced in plant i of product j
Max Z = 1200(^ 11 + ^ 21 + ^ 31 ) + 1000(^ 12 + ^ 22 + ^ 32 ) + 900(^ 13 + ^ 23 + ^ 33 ) Subject to
^11 + ^12 + ^13 ≤ 500 Production capacity P1
^21 + ^22 + ^23 ≤ 600 P2 production capacity
^31 + ^32 + ^33 ≤ 300 P3 production capacity
20^11 + 15^12 + 12^13 ≤ 9000 Availability of m 2 in P1
20^21 + 15^22 + 12^23 ≤ 8000 Availability of m 2 in P2
20^31 + 15^32 + 12^33 ≤ 5000 Availability of m 2 in P3
^11 + ^21 + ^31 ≤ 600 large size sales
^12 + ^22 + ^32 ≤ 800 Medium size sales
^13 + ^23 + ^33 ≤500 small size sales
xj ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 82.
In Manizales, the feasibility of introducing a mass transit bus system is being studied that will partially alleviate the
problem of environmental pollution and thereby reduce traffic in the city; The initial study seeks to determine the
minimum number with which to sustain the demand; After collecting the required information, it is noted that the
minimum number of buses needed to cover the demand fluctuates with the time of day. Studying the data further,
it was discovered that the required number of buses can be assumed constant at successive intervals of four
hours each; It was decided, to facilitate transportation, that each bus can operate only eight consecutive hours a
day.

HOURS NUMBER OF BUSES

00:00 - 4:00 40
4:00 - 8:00 80
8:00 - 12:00 100
12:00 - 16:00 70
16:00 - 20:00 120
20:00 - 00:00 40

Pose the previous problem as a linear programming model.

MODEL:
x: Number of buses that start running in shift i
E n z = ^ 1 + ^ 2 + ^ 3 + ^ 4 + ^ 5 + ^ 6 Subject to

^1 + ^6 ≥ 40 Minimum requirement for shift 1 buses

^ 1 + ^2 ≥ 80 Minimum requirement for shift 2 buses
^2 + ^3 ≥ 100 Minimum requirement for shift 3 buses
^ 3 + ^4 ≥ 70
^4 + ^5 ≥ 120 Minimum requirement for shift 4 buses
Minimum requirement for shift 5 buses
^5 + ^6 ≥ 40 Minimum requirement for shift 6 buses
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 83.
A car and truck factory has the following departments: 1. Stamping of metal plates, 2. Engine assembly, 3.
Automobile assembly and 4. Truck assembly. Department 1 can stamp the plates needed for 25,000 cars or
35,000 trucks, or the corresponding combinations of cars and trucks, per month.

Department 2 can assemble 33,333 car engines or 16,667 truck engines per month, or the corresponding
combinations of car and truck engines. Department 3 can assemble and finish 22,500 cars and department 4
15,000 trucks. If each car leaves a profit of 2000,000 monetary units and each truck of 3,000,000 monetary units.
How many cars and trucks should be produced so that the profits obtained are the maximum possible?

MODEL:
^1 : Number of cars produced and sold dosE
^2:___Quantity of trucks produced and sold
Max Z = 2^ 1 + 3^ 2 (my hones )
Subject to
^■^f^^^+^^^^^^ 2^<^^^^^^^^^Requirements^^^^^^^^^H 2500 35000
EX14-X2<1 Requirementm
33333 16667
^1 ≤ 22500 Availability in unit of the apartment. 1
^2 ≤ 15000 Availability in unit of the apartment. 2
^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 84.
For the production of a product, there are four raw materials which contain the F factor in the proportions indicated
below:

COST PER kg IN
RAW MATERIAL
F CONTENT IN % UM
TO 51 4

b 11 2
c
14 2.4

d 36 3

The aim is to obtain a ton of mixture whose F factor content is at least 18% with the minimum possible cost.
Furthermore, raw materials B and C do not together constitute more than 20% of the mixture.

Pose the previous problem as a linear programming model.

MODEL:
X1: Amount of kgs MP type A used
X2: Amount of kgs MP type B used
x3: Amount of kgs MP type C used
x4: Amount of kgs MP type D used
Min z = 4x 1 + 2x 2 + 2.4x 3 + 3x 4
Subject to
Problem 3..................................................................................................................................................4
Requirement of factor F Total
Problem 4................................................................................................................................................10
production
Requirement of B and
Problem 1................................................................................................................................................11
Problem 2................................................................................................................................................17
MODEL:.............................................................................................................................................17
Problem 3................................................................................................................................................18
Problem 8................................................................................................................................................19
MODEL:.............................................................................................................................................19
Problem 9................................................................................................................................................20
MODEL:.............................................................................................................................................20
Problem 10..............................................................................................................................................21
MODEL...............................................................................................................................................21
Problem 11..............................................................................................................................................22
MODELING.......................................................................................................................................22
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 12..............................................................................................................................................22
MODEL:.............................................................................................................................................23
Problem 13..............................................................................................................................................24
MODEL:.............................................................................................................................................24
Problem 14..............................................................................................................................................25
MODEL:.............................................................................................................................................25
Problem 15..............................................................................................................................................26
MODEL:.............................................................................................................................................26
Problem 16..............................................................................................................................................27
MODEL:.............................................................................................................................................27
Problem 17..............................................................................................................................................28
MODEL:.............................................................................................................................................28
Problem 18..............................................................................................................................................29
MODEL:.............................................................................................................................................29
Problem 19..............................................................................................................................................30
MODEL:.............................................................................................................................................30
Problem 20..............................................................................................................................................31
MODEL:.............................................................................................................................................31
Problem 21.1...........................................................................................................................................32
Problem 22..............................................................................................................................................33
MODEL:.............................................................................................................................................33
Problem 23..............................................................................................................................................34
MODEL:.............................................................................................................................................34
Problem 24..............................................................................................................................................35
MODEL:k...........................................................................................................................................35
Problem 25..............................................................................................................................................36
MODEL:.............................................................................................................................................36
Problem 26..............................................................................................................................................37
MODEL:.............................................................................................................................................37
Problem 27..............................................................................................................................................38
MODEL:.............................................................................................................................................38
Problem 28..............................................................................................................................................39
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:.............................................................................................................................................39
Problem 29..............................................................................................................................................40
MODEL:.............................................................................................................................................40
Problem 30..............................................................................................................................................41
MODEL:.............................................................................................................................................41
Problem 31..............................................................................................................................................41
MODEL:.............................................................................................................................................42
Problem 32..............................................................................................................................................52
MODEL:.............................................................................................................................................52
Problem 33..............................................................................................................................................53
MODEL:.............................................................................................................................................53
Problem 34..............................................................................................................................................54
Problem 35..............................................................................................................................................55
MODEL:.............................................................................................................................................55
Problem 36..............................................................................................................................................56
MODEL:.............................................................................................................................................56
Problem 37..............................................................................................................................................57
MODEL:.............................................................................................................................................57
Problem 38..............................................................................................................................................58
MODEL:.............................................................................................................................................58
Problem 39..............................................................................................................................................59
MODEL:.............................................................................................................................................59
Problem 40..............................................................................................................................................60
MODEL:.............................................................................................................................................60
Problem 41..............................................................................................................................................61
MODEL:.............................................................................................................................................61
Problem 42..............................................................................................................................................61
MODEL:.............................................................................................................................................62
Problem 43..............................................................................................................................................63
MODEL:.............................................................................................................................................63
Problem 44..............................................................................................................................................64
MODEL:.............................................................................................................................................64
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 45..............................................................................................................................................65
MODEL:.............................................................................................................................................65
Problem 46..............................................................................................................................................66
MODEL:.............................................................................................................................................66
Problem 47..............................................................................................................................................67
MODEL:.............................................................................................................................................67
Problem 48..............................................................................................................................................68
MODEL:.............................................................................................................................................68
Problem 49..............................................................................................................................................69
MODEL:.............................................................................................................................................69
Problem 50..............................................................................................................................................70
MODEL:.............................................................................................................................................70
Problem 51.1...........................................................................................................................................71
MODEL:.............................................................................................................................................71
Problem 52..............................................................................................................................................72
MODEL:.............................................................................................................................................72
Problem 53..............................................................................................................................................73
MODEL:.............................................................................................................................................73
Problem 54..............................................................................................................................................81
MODEL:.............................................................................................................................................81
Problem 55..............................................................................................................................................82
MODEL:.............................................................................................................................................82
Problem 56..............................................................................................................................................83
MODEL:.............................................................................................................................................83
Problem 57..............................................................................................................................................84
MODEL:.............................................................................................................................................84
Problem 58..............................................................................................................................................85
MODEL:.............................................................................................................................................85
Problem 59..............................................................................................................................................86
MODEL:.............................................................................................................................................86
Problem 60..............................................................................................................................................92
MODEL:.............................................................................................................................................92
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 61..............................................................................................................................................93
MODEL:.............................................................................................................................................93
Problem 62..............................................................................................................................................94
MODEL:.............................................................................................................................................94
Problem 63..............................................................................................................................................95
MODEL:.............................................................................................................................................95
Problem 64..............................................................................................................................................96
MODEL:.............................................................................................................................................96
Problem 65..............................................................................................................................................96
MODEL:.............................................................................................................................................97
E— 1 +...................................................................................................................................................97
Problem 66..............................................................................................................................................98
MODEL:.............................................................................................................................................98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3......................................................99
MODEL:.............................................................................................................................................99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1................................................100
MODEL:...........................................................................................................................................100
Problem 69............................................................................................................................................101
Problem 70............................................................................................................................................102
MODEL:...........................................................................................................................................102
Problem 71............................................................................................................................................103
Problem 72............................................................................................................................................104
Problem 73.1.........................................................................................................................................105
MODEL:...........................................................................................................................................105
Problem 74............................................................................................................................................106
MODEL.............................................................................................................................................106
Problem 75............................................................................................................................................107
Problem 76............................................................................................................................................108
MODEL:...........................................................................................................................................108
Problem 77............................................................................................................................................114
Problem 78............................................................................................................................................115
MODEL:...........................................................................................................................................115
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 79............................................................................................................................................116
MODEL:...........................................................................................................................................116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2................................................117
MODEL:...........................................................................................................................................117
Problem 81............................................................................................................................................118
Problem 82............................................................................................................................................119
MODEL:...........................................................................................................................................119
Problem 83............................................................................................................................................120
MODEL:...........................................................................................................................................120
Problem 84............................................................................................................................................121
MODEL:...........................................................................................................................................121
Problem 85............................................................................................................................................127
MODEL:...........................................................................................................................................128
Problem 86............................................................................................................................................129
MODEL:...........................................................................................................................................129
Problem 87............................................................................................................................................130
MODEL:...........................................................................................................................................130
Problem 88............................................................................................................................................131
Problem 89............................................................................................................................................137
Problem 90............................................................................................................................................138
MODEL:...........................................................................................................................................138
Problem 91............................................................................................................................................139
MODEL:...........................................................................................................................................139
Problem 92............................................................................................................................................140
BIBLIOGRAPHY....................................................................................................................................141
c
x 1 ,x 2 ,x 3 ,x 4 > 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 85.
The Ferremanizales company is an industrial firm that is dedicated to the production of screws. It has three plants
located in Armenia, Pereira and Manizales; The production capacity of each of the plants is as follows:
1
' ■
1 PRODUCTION
PLANT (BOXES/MONTH)
Armenia 100000

Pereira 120000
Manizales 100000

This company markets its products through five distributors located in different areas of the country. The
forecasted demand for each distributor is:

DEMAND
ZONE
(BOXES/MONTH)
1 75000
2 50000

3 50000
4 55000

5 80000

The cost of transporting one unit from each plant to each zone is:

PLANT
ZONE
ARMENIA PEREIRA MANIZALES
1 100 200 300

2 120 150 200

3 150 100 250

4 200 180 150

5 220 200 100

Which distribution routes should be used and how much merchandise should be sent to each of them?

Pose the previous problem as a linear programming model.

 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL:

X[
j Quantity of screws sent from plant to zone
Min z = 100^ 11 + 120^ 12 + 150^ 13 + 200^ 14 + 220^ 15 + 200^ 21 + 150^ 22 + 100^ 23 + 180^ 24 + 200^ 25 + 300^
31 +
200^ 32 + 250^ 33 + 150^ 34 + 100^ 35
Subject to
^11 + ^12 + ^13 + ^14 + ^15 ≤ 100000
^21 + ^22 + ^23 + ^24 + ^25 ≤ 120000
^31 + ^32 + ^33 + ^34 + ^35 ≤ 100000
^11 + ^21 + ^31 ≥ 75000
^12 + ^22 + ^32 ≥ 50000
^13 + ^23 + ^33 ≥ 50000
^14 + ^24 + ^34 ≥ 55000
^15 + ^25 + ^35 ≥ 80000
^^ J ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 86.
A company produces valves for which two alternative production lines are available; The company has just
received a production order for 1,000 Hakim 1 valves. Line 1 can produce the valves at a rate of 15 minutes per
valve; The production capacity of line 2 is 5 valves per hour. Line 1 will be available, for this order, up to 200 hours
at a cost of 800 monetary units per hour. Line 2 will be available, also for this order, up to 170 hours at 700
monetary units per hour. Find the best production plan if you want to formulate it in two different ways, so that in
one of the approaches the decision variables are in terms of hours.

MODEL:
^1 : amount of ℎ or as of work in IaIine^ 1
^2: amount of ℎ or as of work in IaIine^ 2
^1 ≤ 200 Availability in hours of line 1
^2 ≤ 170 Availability in hours of line 2

Subject to
M in z = 800^ 1 + 700^ 2
4^1 + 5^2 ≥ 1000 Requirement of product units

^1, ^2 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 87.
A company produces three chips: A, whose cost per unit is 1000 monetary units and sells for 1500 monetary
units; B, whose cost per unit is 600 monetary units and is sold for 1000 monetary units; and C, whose cost per unit
is 1200 monetary units and is sold for 1500 monetary units. The company is planning the monthly production
schedule: the marketing department requires the production of at least 100 units of chip C and no more than 1000
units of chip A; the production department cannot manufacture more than 4000 chips of all models; the machine
that manufactures the chips can produce 20,30 or 40 units per hour of chips A, B or C respectively; The machine
has an availability of 100 hours per month. The marketing department also requires that there be at least twice as
many units of chip B as chip C in the monthly program.
How many units of chips A, B, and C should the company produce if the company's goal is to maximize profits?

MODEL:
^1 : amount of Chip guyTO used
^2 : Amount of Chip guy b used
^3 : Amount of Chip guy c used
^3 ≥ 100 Minimum units of C
^1 ≤ 1000 Maximum units of A
^2 - 2^3 ≥ 0 Request
^1 + ^2 + ^3 ≤ 4000Subject Unit Capacity
1/20^1 + 1/30^2 + 1/40^3 ≤ 100 Availability in machine hr
Max z = 500 + 400^ 2 + 300^
3

^1, ^2, ^3 ≥ 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 88.
Mrs. Morales has a diet to follow, which meets the following nutritional requirements.

• At least 4 mg of vitamin A
• At least 6 mg of vitamin B
• At most 3 mg of vitamin D

Likewise, the diet consists of bread, cheese, eggs and meat. The following table gives us the requirements per
vitamin in mg, as well as the cost.

Content in mg per gram of product

Product Cost Vitamin A Vitamin B Vitamin D
Bread 40 0.20 0.18 0.10
Cheese 31 0.15 0.10 0.14
Eggs 19 0.15 0.40 0.15
Meat 53 0.30 0.35 0.16
MODEL:
X1: Amount of mg of bread used in the mixture
X2: Amount of mg of cheese used in the mixture
x3: Amount of mg of eggs used in the mixture
x4: Amount of mg of Meat used in the mixture
Min z = 40x 1 + 31x 2 + 19x 3 + 53x4
Subject to
Problem 3 4
Problem 4 10
Problem 1 11
Problem 2. 17
MODEL: 17
Problem 3. 18
Problem 8. 19
MODEL: 19
Problem 9. 20
MODEL: 20
Problem 10. 21
MODEL. 21
Problem 11. 22
MODELING. 22
Problem 12. 22
MODEL: 23
Problem 13. 24
MODEL: 24
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 14. 25
MODEL: 25
Problem 15. 26
MODEL: 26
Problem 16. 27
MODEL: 27
Problem 17. 28
MODEL: 28
Problem 18. 29
MODEL: 29
Problem 19. 30
MODEL: 30
Problem 20. 31
MODEL: 31
Problem 21.1 32
Problem 22. 33
MODEL: 33
Problem 23. 34
MODEL: 34
Problem 24. 35
MODEL:k 35
Problem 25. 36
MODEL: 36
Problem 26. 37
MODEL: 37
Problem 27. 38
MODEL: 38
Problem 28. 39
MODEL: 39
Problem 29. 40
MODEL: 40
Problem 30. 41
 LINEAR PROGRAMMING EXERCISES. MODELING

MODEL: 41
Problem 31. 41
MODEL: 42
Problem 32. 52
MODEL: 52
Problem 33. 53
MODEL: 53
Problem 34. 54
Problem 35. 55
MODEL: 55
Problem 36. 56
MODEL: 56
Problem 37. 57
MODEL: 57
Problem 38. 58
MODEL: 58
Problem 39. 59
MODEL: 59
Problem 40. 60
MODEL: 60
Problem 41. 61
MODEL: 61
Problem 42. 61
MODEL: 62
Problem 43. 63
MODEL: 63
Problem 44. 64
MODEL: 64
Problem 45. 65
MODEL: 65
Problem 46. 66
MODEL: 66
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 47. 67
MODEL: 67
Problem 48. 68
MODEL: 68
Problem 49. 69
MODEL: 69
Problem 50. 70
MODEL: 70
Problem 51.1 71
MODEL: 71
Problem 52. 72
MODEL: 72
Problem 53. 73
MODEL: 73
Problem 54. 81
MODEL: 81
Problem 55. 82
MODEL: 82
Problem 56. 83
MODEL: 83
Problem 57. 84
MODEL: 84
Problem 58. 85
MODEL: 85
Problem 59. 86
MODEL: 86
Problem 60. 92
MODEL: 92
Problem 61. 93
MODEL: 93
Problem 62. 94
MODEL: 94
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 63. 95
MODEL: 95
Problem 64. 96
MODEL: 96
Problem 65. 96
MODEL: 97
E— 1 + 97
Problem 66. 98
MODEL: 98
Problem 67. SECOND PARTIAL 7B CLASSICAL EXERCISE 3 99
MODEL: 99
Problem 68. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 1 100
MODEL: 100
Problem 69. 101
Problem 70. 102
MODEL: 102
Problem 71. 103
Problem 72. 104
Problem 73.1 105
MODEL: 105
Problem 74. 106
MODEL 106
Problem 75. 107
Problem 76. 108
MODEL: 108
Problem 77. 114
Problem 78. 115
MODEL: 115
Problem 79. 116
MODEL: 116
Problem 80. EXAM 2ND PARTIAL 7B CLASSICAL EXERCISE 2 117
MODEL: 117
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 81. 118

Problem 82. 119
MODEL: 119
Problem 83. 120
MODEL: 120
Problem 84. 121
MODEL: 121
Problem 85. 127
MODEL: 128
Problem 86. 129
MODEL: 129
Problem 87. 130
MODEL: 130
Problem 88. 131
Problem 89. 137
Problem 90. 138
MODEL: 138
Problem 91. 139
MODEL: 139
Problem 92. 140
BIBLIOGRAPHY. 141

x 1 ,x 2 ,x 3 ,x 4 > 0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 89.
A local manufacturing company produces four different metal products that must be machined , polished, and
assembled. The specific time needs (in hours) for each product are as follows:

Product Machining Polished Assembly

1 1
2 1
21
1
13 1 2
4
The Company has 480 hours weekly for machining, 400 hours for polishing and 400 hours for assembly. The unit
profits per product are $6, $4, $6 and $8 respectively. The company has a contract with a distributor in which it
agrees to deliver weekly, at least, 50 units of product 1 and 100 units of any combination of products II and III,
depending on production, but only a maximum of 25 units. of product 4. How many units of each product should the
company manufacture weekly in order to meet all the conditions of the contract and maximize total profit. Formulate
the model.

MODEL:
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 90.
La Ware Farms of the Schoharie Valley, near Alfany, NY, grows broccoli and cauliflower on 500 acres of land in
the valley. One acre of broccoli produces $500 profit contribution and the contribution of one acre of cauliflower is
$1000. Due to government regulations, no more than 200 acres of broccoli can be grown. During the planting
season, 1,200 man-hours of planter time will be available. Each acre of broccoli requires 2.5 man-hours and each
acre of cauliflower requires 5.5 man-hours. Set up a LP problem to determine how many acres of broccoli and
how many acres of cauliflower should be planted to maximize profit contribution.

MODEL:
^1 : Number of broeoli areas planted
^2: Number of planted eoliflower trees
Max z = 500^ 1 + +1000^ 2
Subject to
Land availability ^1 + ^2 ≤ 500
Broccoli acreage requirement ^1 ≤ 200
Availability in hr - man 2.5^1 + 5.5^2 ≤ 1200
X l ,X ≥0
2
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 91.
The Clear-Tube Company manufactures electronic parts for television and radio sets. The company has decided
to manufacture and sell AM/FM radios and tape players. He has built a plant that can operate 48 hours a week
with fixed expenses of $10,000 per week. The production of an AM/FM radio requires 2 hours of labor and the
production of a tape player requires 3 hours of labor. Each radio contributes $20 to profits and each tape player
$25. The company's marketing department has determined that the most that can be sold per week is 150 radios
and 100 tape players. Pose an LP problem to determine the optimal production mix that maximizes the
contribution to profits.

MODEL:
x number of radios produced and sold two
x2 number of tape players produced and sold

Availability of weekly hours

Sales in radio units Max z = 20^ 1 + +25^ 2
Sales in units of tape Subject players
to 2^1 + 3^2 ≤ 48
^1 ≤ 150
^2 ≤ 100
^1, ^2 ≥0
 LINEAR PROGRAMMING EXERCISES. MODELING

Problem 92.
In an oil company's refinery, three grades of gasoline A, B, and C are produced. To make each grade of gasoline,
pure gasoline, octane, and additives are mixed. One liter of A requires 22% pure gasoline, 48% octane and 30%
additive. One liter of B is made up of 45% pure gasoline, 30% octane and 25% additive. One liter of C contains
70% pure gasoline, 25% octane and 5% additives. The company estimates that the profit per liter it obtains on each
type of gasoline is $6 for A, $5 for B and $4 for C. The company has estimated the following availability of the
elements to be combined.

Element Maximum availability

TO 6000000
b 2000000
c 1000000
Formulate a Linear Programming model.
MODEL:
X1: Amount of liters of gasoline dog degreeTO produced
X2: Amount of liters of gasolinewith degreeb produced
x3: Amount of liters of gasolinewith degree c produced
Max z = 6x 1 + 5x 2 + 4x 3
Subject to
0.22x 1 + 0.45x2 + 0.70x3 < 6000000
0.48x 1 + 0.30x 2 + 0.25x 3 < 2000000
0.30x 1 + 0.25x 2 + 0.05x 3 < 1000000 Availability of element A
x1,x2>0 Availability of element B
Availability of element C
 LINEAR PROGRAMMING EXERCISES. MODELING

BIBLIOGRAPHY.

BAZARAA MS and JJ. Jarvis. Linear programming and network flow . Limusa. Noriega editors, 2
ed. 1998.
DAVIS K Roscoey MC KEOWN Patrick. Quantitative models for administration. Iberoamerica
publishing group. 2 Ed. 1986.
DIAZ S. Fco. Javier,RENDON C: Hernán D., Introduction to Operations Research National
University 2002.
GASS YES Linear programming . Continental Publishing Company. 1981.
HILLIERE, FS and Liebermang GJ, Introduction to Operations Research Ed. Mc Graw Hill 2002 7th
Edition.
JIMENEZ Lozano, Guillermo, Quesada Ibargúen, Victor Manueal. One Hundred Linear
Programming Problems. National university of Colombia. 2006. Colombia, Col.
MOSKOWITZ Herbert-Wright Gordon, Prentice Hall Operations Research .
TAHA HAMDY A. Operations research . Alpha Omega. 5 Ed. 1995.
WAYNE L. Winston Operations Research applications and algorithms Ed. Thomson.