Mark, Tim, Maia, and Kelly are dividing a cake among themselves using the lone-divider method. The divider divides the cake into four slices ( s 1 , s 2 , s 3 , and s 4 ) . T a b l e 3 - 1 8 shows the values of the slices to each player expressed as a percent of the total value of the cake. Table 3 − 1 8 Mark 20% 32% 28% 20% Tim 25% 25 % 25% 25% Maia 15% 15% 30% 40% Kelly 24% 24% 24% 28% a. Who was the divider? b. Find a fair division of the cake.
Mark, Tim, Maia, and Kelly are dividing a cake among themselves using the lone-divider method. The divider divides the cake into four slices ( s 1 , s 2 , s 3 , and s 4 ) . T a b l e 3 - 1 8 shows the values of the slices to each player expressed as a percent of the total value of the cake. Table 3 − 1 8 Mark 20% 32% 28% 20% Tim 25% 25 % 25% 25% Maia 15% 15% 30% 40% Kelly 24% 24% 24% 28% a. Who was the divider? b. Find a fair division of the cake.
Mark, Tim, Maia, and Kelly are dividing a cake among themselves using the lone-divider method. The divider divides the cake into four slices
(
s
1
,
s
2
,
s
3
,
and
s
4
)
.
T
a
b
l
e
3
-
1
8
shows the values of the slices to each player expressed as a percent of the total value of the cake.
can you solve this question and explain the steps used along the way
You manage a chemical company with 2 warehouses. The following quantities of
Important Chemical A have arrived from an international supplier at 3 different
ports:
Chemical Available (L)
Port 1
400
Port 2
110
Port 3
100
The following amounts of Important Chemical A are required at your warehouses:
Warehouse 1
Warehouse 2
Chemical Required (L)
380
230
The cost in£to ship 1L of chemical from each port to each warehouse is as follows:
Warehouse 1 Warehouse 2
Port 1
£10
Port 2
£20
Port 3
£13
£45
£28
£11
(a) You want to know how to send these shipments as cheaply as possible. For-
mulate this as a linear program (you do not need to formulate it in standard
inequality form) indicating what each variable represents.
(b) Suppose now that all is as in the previous question but that only 320L of
Important Chemical A are now required at Warehouse 1. Any excess chemical
can be transported to either Warehouse 1 or 2 for storage, in which case the
company must pay only the relevant transportation…
Suppose we have a linear program in standard equation form
maximize cx
subject to Ax = b,
x > 0.
and suppose u, v, and w are all optimal solutions to this linear program.
(a) Prove that z = u+v+w is an optimal solution.
(b) If you try to adapt your proof from part (a) to prove that that u+v+w
is an optimal solution, say exactly which part(s) of the proof go wrong.
(c) If you try to adapt your proof from part (a) to prove that u+v-w is an
optimal solution, say exactly which part(s) of the proof go wrong.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.