1 Drag each set of column entries to the correct location in the augmented matrix. Not all sets of entries will be used.
Mac traveled to three cities on one highway. The total distance one way was 320 miles. The distance from his original location to the first city was
20 miles more than half the distance from the first city to the second city. The distance from the second city to the third city was 75 miles less
than the distance from the first city to the second city. Let x represent the distance from the original location to the first city, y represent the
distance from the first city to the second city, and zrepresent the distance from the second city to the third city. Place the correct sets of column
entries in the augmented matrix that models Mac's situation.
95
150
75
1
-0.5
1
1
0
-1
1
1
0
1
-0.5
0
320
20
75
95
145
70
1
0
0
0
1
0
0
0
1
Reset
Next

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i.e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)