# Linear Programming Problems and Solutions

### Solutions

1A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated capacity of 20 m3 and a non-refrigerated capacity of 40 m3 while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of 3,000 m3 of refrigerated stock and 4 000 m3 of non-refrigerated stock. The cost per kilometer of a Type A is \$30, and \$40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost?

2A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9 drivers available. The rental cost for a large bus is \$800 and \$600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost.

3A store wants to liquidate 200 of its shirts and 100 pairs of pants from last season. They have decided to put together two offers, A and B. Offer A is a package of one shirt and a pair of pants which will sell for \$30. Offer B is a package of three shirts and a pair of pants, which will sell for \$50. The store does not want to sell less than 20 packages of Offer A and less than 10 of Offer B. How many packages of each do they have to sell to maximize the money generated from the promotion?

## 1

A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated capacity of 20 m3 and a non-refrigerated capacity of 40 m3 while Type B has the same overall volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire trucks for the transport of 3,000 m3 of refrigerated stock and 4,000 m3 of non-refrigerated stock. The cost per kilometer of a Type A is \$30, and \$40 for Type B. How many trucks of each type should the grocer rent to achieve the minimum total cost?

1Choose the unknowns.

x = Type A trucks

y = Type B trucks

2Write the objective function.

f(x,y) = 30x + 40y

3Write the constraints as a system of inequalities.

A B Total
Refrigerated 20 30 3 000
Non-refrigerated 40 30 4 000

20x + 30y ≥ 3 000

40x + 30y ≥ 4 000

x ≥ 0

y ≥ 0

4 Find the set of feasible solutions that graphically represent the constraints. 5 Calculate the coordinates of the vertices from the compound of feasible solutions. 6 Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.

f(0, 400/3) = 30 · 0 + 40 · 400/3 = 5,333.332

f(150, 0) = 30 · 150 + 40 · 0 = 4,500

As x and y must be natural numbers round the value of y.

f(50, 67) = 30 · 50 + 40 ·67 = 4,180

By default, we see what takes the value x to y = 66 in the equation 20x + 30y = 3,000. x = 51 which it is within the feasible solutions.

f(51, 66) = 30 · 51 + 40 · 66 = 4,170

The minimum cost is \$4,170. To achieve this 51 trucks of Type A and 66 trucks of Type B are needed.

## 2

A school is preparing a trip for 400 students. The company who is providing the transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but only has 9 drivers available. The rental cost for a large bus is \$800 and \$600 for the small bus. Calculate how many buses of each type should be used for the trip for the least possible cost.

1Choose the unknowns.

x = small buses

y = big buses

2Write the objective function.

f(x, y) = 600x + 800y

3Write the constraints as a system of inequalities.

40x + 50y ≥ 400

x + y ≤ 9

x ≥ 0

y ≥ 0

4 Find the set of feasible solutions that graphically represent the constraints. 5 Calculate the coordinates of the vertices from the compound of feasible solutions. 6 Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.

f(0, 8) = 600 · 0 + 800 · 8 = \$6,400

f(0, 9) = 600 · 0 + 800 · 9 = \$7,200

f(5, 4) = 6 00 · 5 + 800 · 4 = \$6,200 €    Minimum

The minimum cost is \$6,200. This is acheived with 4 large and 5 small buses.

## 3

A store wants to liquidate 200 of its shirts and 100 pairs of pants from last season. They have decided to put together two offers, A and B. Offer A is a package of one shirt and a pair of pants which will sell for \$30. Offer B is a package of three shirts and a pair of pants, which will sell for \$50. The store does not want to sell less than 20 packages of Offer A and less than 10 of Offer B. How many packages of each do they have to sell to maximize the money generated from the promotion?

1Choose the unknowns.

x = number of packages of Offer A

y = number of packages of Offer B

2Write the objective function.

f(x, y) = 30x + 50y

3Write the constraints as a system of inequalities.

A B Minimal
Shirts 1 3 200
Pants 1 1 100

x + 3y ≤ 200

x + y ≤ 100

x ≥ 20

y ≥ 10

4 Find the set of feasible solutions that graphically represent the constraints. 5 Calculate the coordinates of the vertices from the compound of feasible solutions. 6 Calculate the value of the objective function at each of the vertices to determine which of them has the maximum or minimum values.

f(x, y) = 30 · 20 + 50 · 10 = \$1,100

f(x, y) = 30 · 90 + 50 · 10 = \$3,200

f(x, y) = 30 · 20 + 50 · 60 = \$3,600

f(x, y) = 30 · 50 + 50 · 50 = \$4,000   Maximum

50 packages of each offer generates a maximum amount of \$4,000 in sales.
{"ft_lang_label":"__label__en","ft_lang_prob":0.91912615,"math_prob":0.9906276,"size":5343,"snap":"2019-13-2019-22","text_gpt3_token_len":1533,"char_repetition_ratio":0.12099644,"word_repetition_ratio":0.6402944,"special_character_ratio":0.32884148,"punctuation_ratio":0.08733624,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9810019,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-22T08:29:46Z\",\"WARC-Record-ID\":\"<urn:uuid:740d2051-9109-4937-8169-96e9e6e18076>\",\"Content-Length\":\"30149\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a32dda9c-5e26-440b-aca0-5ca5bd186634>\",\"WARC-Concurrent-To\":\"<urn:uuid:373783cb-d8f2-409b-aeab-00613483d33d>\",\"WARC-IP-Address\":\"31.11.34.162\",\"WARC-Target-URI\":\"https://www.vitutor.com/alg/linear_programming/problems_solutions.html\",\"WARC-Payload-Digest\":\"sha1:BOR4X5HEJ7G5L6DQSSFCBFILCL2VVFIB\",\"WARC-Block-Digest\":\"sha1:2HHTD37YBAUOE7Q52VQG2NG3IJRNKR3N\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202640.37_warc_CC-MAIN-20190322074800-20190322100800-00141.warc.gz\"}"}