Deck 6: Linear Programming

Full screen (f)
exit full mode
Question
Write down (without solving) the dual linear programming problem. Minimize C=13s+35tC = 13 s + 35 t subject to the following. 7s3t15s+4t25s0,t0\begin{array} { l } 7 s - 3 t \geq 15 \\s + 4 t \geq 25 \\s \geq 0 , t \geq 0\end{array}

A)Maximize P=15x+25yP = 15 x + 25 y subject to the following. 7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\- 3 x + 4 y \leq 35 \\x \leq 0 , y \leq 0\end{array}

B) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\3 x + 4 y \leq - 35 \\x \geq 0 , y \geq 0\end{array}

C) Maximize P=15x+25yP = 15 x + 25 y subject to the following.

7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \geq 13 \\- 3 x + 4 y \geq 35 \\x \geq 0 , y \geq 0\end{array}

D) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\3 x + 4 y \leq 35 \\x \geq 0 , y \geq 0\end{array}

E) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\- 3 x + 4 y \leq 35 \\x \geq 0 , y \geq 0\end{array}
Use Space or
up arrow
down arrow
to flip the card.
Question
Solve the standard minimization problem using duality.
Minimize c=5s+2tc = 5 s + 2 t
Subject to 3s+t30s+t20s+3t30s0,t0\begin{array} { l } 3 s + t \geq 30 \\s + t \geq 20 \\s + 3 t \geq 30 \\s \geq 0 , t \geq 0\end{array}

A) c=55c = 55 , s=5s = 5 , t=15t = 15
B) c=85c = 85 , s=15s = 15 , t=5t = 5
C) c=25c = 25 , s=5s = 5 , t=0t = 0
D) c=30c = 30 , s=0s = 0 , t=15t = 15
E) c=10c = 10 , s=0s = 0 , t=5t = 5
Question
Solve the standard minimization problem using duality.  Minimize c=3s+3t+3u3s+2t+u1502s+t+3u150 subject to s+3t+2u150s0,t0,u0\begin{array} { l } \text { Minimize } ^ { c = 3 s + 3 t + 3 u } \\3 s + 2 t + u \geq 150 \\2 s + t + 3 u \geq 150 \\\text { subject to } s + 3 t + 2 u \geq 150 \\s \geq 0 , t \geq 0 , u \geq 0 \\\end{array}
If you have several solutions, select one of them.

A) c=90c = 90 , s=37.5s = 37.5 , t=0t = 0 , u=37.5u = 37.5
B) c=225c = 225 , s=25s = 25 , t=25t = 25 , u=25u = 25
C) c=135c = 135 , s=15s = 15 , t=15t = 15 , u=15u = 15
D) c=180c = 180 , s=20s = 20 , t=20t = 20 , u=20u = 20
E) c=225c = 225 , s=10s = 10 , t=10t = 10 , u=10u = 10
Question
Solve the standard minimization problem using duality.
Minimize c=0.4s+0.6tc = 0.4 s + 0.6 t
Subject to 0.2s+0.1t10.15s+0.3t1.510s+10t80s0,t0\begin{array} { l } 0.2 s + 0.1 t \geq 1 \\0.15 s + 0.3 t \geq 1.5 \\10 s + 10 t \geq 80 \\s \geq 0 , t \geq 0\end{array}

A) c=3.6c = 3.6 , s=6s = 6 , t=2t = 2
B) c=2.8c = 2.8 , s=6s = 6 , t=2t = 2
C) c=1.2c = 1.2 , s=6s = 6 , t=2t = 2
D) c=4.4c = 4.4 , s=2s = 2 , t=6t = 6
E) c=2.8c = 2.8 , s=2s = 2 , t=6t = 6
Question
Solve the games with the given payoff matrix.
P=[463435]P = \left[ \begin{array} { l l l } - 4 & - 6 & - 3 \\- 4 & - 3 & - 5\end{array} \right]

A) C=[0108159]C = \left[ \begin{array} { c } 0 \\\frac { 10 } { 81 } \\\frac { 5 } { 9 }\end{array} \right] , R=[108159]R = \left[ \begin{array} { l l } \frac { 10 } { 81 } & \frac { 5 } { 9 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
B) C=[25350]C = \left[ \begin{array} { l } \frac { 2 } { 5 } \\\frac { 3 } { 5 } \\0\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
C) C=[02535]C = \left[ \begin{array} { l } 0 \\\frac { 2 } { 5 } \\\frac { 3 } { 5 }\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = \frac { 21 } { 5 }
D) C=[0108159]C = \left[ \begin{array} { c } 0 \\\frac { 10 } { 81 } \\\frac { 5 } { 9 }\end{array} \right] , R=[108159]R = \left[ \begin{array} { l l } \frac { 10 } { 81 } & \frac { 5 } { 9 }\end{array} \right] , e=215e = \frac { 21 } { 5 }
E) C=[02535]C = \left[ \begin{array} { l } 0 \\\frac { 2 } { 5 } \\\frac { 3 } { 5 }\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
Question
Solve the standard minimization problem using duality.
Minimize c=4s+7t+9uc = 4 s + 7 t + 9 u
Subject to s+2t+2u602s+t+3u60s0,t0,u0\begin{array} { l } s + 2 t + 2 u \geq 60 \\2 s + t + 3 u \geq 60 \\s \geq 0 , t \geq 0 , u \geq 0\end{array}

A) c=140c = 140 , s=0s = 0 , t=20t = 20 , u=0u = 0
B) c=80c = 80 , s=20s = 20 , t=0t = 0 , u=0u = 0
C) c=220c = 220 , s=20s = 20 , t=20t = 20 , u=0u = 0
D) c=260c = 260 , s=20s = 20 , t=0t = 0 , u=20u = 20
E) c=320c = 320 , s=0s = 0 , t=20t = 20 , u=20u = 20
Question
Solve the games with the given payoff matrix. P=[112212121]P = \left[ \begin{array} { c c c } - 1 & 1 & 2 \\2 & - 1 & - 2 \\1 & 2 & - 1\end{array} \right]

A) C=[592929]C = \left[ \begin{array} { l } \frac { 5 } { 9 } \\\frac { 2 } { 9 } \\\frac { 2 } { 9 }\end{array} \right] , R=[71811859]R = \left[ \begin{array} { l l l } \frac { 7 } { 18 } & \frac { 1 } { 18 } & \frac { 5 } { 9 }\end{array} \right] , e=8518e = - \frac { 85 } { 18 }
B) C=[592929]C = \left[ \begin{array} { l } \frac { 5 } { 9 } \\\frac { 2 } { 9 } \\\frac { 2 } { 9 }\end{array} \right] , R=[71811859]R = \left[ \begin{array} { l l l } \frac { 7 } { 18 } & \frac { 1 } { 18 } & \frac { 5 } { 9 }\end{array} \right] , e=3118e = - \frac { 31 } { 18 }
C) C=[59718118]C = \left[ \begin{array} { c } \frac { 5 } { 9 } \\\frac { 7 } { 18 } \\\frac { 1 } { 18 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=518e = \frac { 5 } { 18 }
D) C=[11871859]C = \left[ \begin{array} { c } \frac { 1 } { 18 } \\\frac { 7 } { 18 } \\\frac { 5 } { 9 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=8518e = - \frac { 85 } { 18 }
E) C=[51851849]C = \left[ \begin{array} { c } \frac { 5 } { 18 } \\\frac { 5 } { 18 } \\\frac { 4 } { 9 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=3118e = - \frac { 31 } { 18 }
Question
Minimize p=6a+4bp = 6 a + 4 b subject to the following constraints.
a+b106a+b30a0,b0\begin{array} { l } a + b \geq 10 \\6 a + b \geq 30 \\a \geq 0 , b \geq 0\end{array}

A) a=4a = 4 , b=6b = 6 , p=48p = 48
B) a=10a = 10 , b=0b = 0 , p=60p = 60
C) a=0a = 0 , b=30b = 30 , p=180p = 180
D) a=0a = 0 , b=10b = 10 , p=40p = 40
E) a=6a = 6 , b=6b = 6 , p=60p = 60
Question
Oz makes lion food out of giraffe and gazelle meat. Giraffe meat has 18 grams of protein and 36 grams of fat per pound, while gazelle meat has 36 grams of protein and 18 grams of fat per pound. A batch of lion food must contain at least 36,000 grams of protein and 54,000 grams of fat. Giraffe meat costs $4/pound and gazelle meat costs $8/pound. How many pounds of each should go into each batch of lion food in order to minimize costs What are the shadow costs of protein and fat Use the rounded numbers of pounds in your calculations. ?

A)1,333 pounds of giraffe meat and 333 pounds of gazelle, 22 cents per gram of protein and 15 cents per gram of fat
B) 333 pounds of giraffe meat and 333 pounds of gazelle, 15 cents per gram of protein and 15 cents per gram of fat
C) 1,333 pounds of giraffe meat and 333 pounds of gazelle, 15 cents per gram of protein and 22 cents per gram of fat
D) 1,333 pounds of giraffe meat and 333 pounds of gazelle, 22 cents per gram of protein and 22 cents per gram of fat
E) 333 pounds of giraffe meat and 1,333 pounds of gazelle, 22 cents per gram of protein and 15 cents per gram of fat
Question
Solve the standard minimization problem using duality.  Minimize c=8s+7t+8us+t+u1002s+t50 subject to t+u50s0,t0,u0\begin{array} { l } \text { Minimize } & { c = 8 s + 7 t + 8 u } \\&s + t + u \geq 100 \\&2 s + t \geq 50 \\\text { subject to } &t + u \geq 50 \\&s \geq 0 , t \geq 0 , u \geq 0 \\\end{array}

A) c=800c = 800 , s=100s = 100 , t=0t = 0 , u=0u = 0
B) c=800c = 800 , s=0s = 0 , t=0t = 0 , u=100u = 100
C) c=700c = 700 , s=0s = 0 , t=100t = 100 , u=0u = 0
D) c=350c = 350 , s=0s = 0 , t=50t = 50 , u=0u = 0
E) c=400c = 400 , s=50s = 50 , t=0t = 0 , u=0u = 0
Question
Write down (without solving) the dual LP problem.
Minimize c=s+6t+uc = s + 6 t + u subject to
9st+v3,000uv1,000s+t500s0,t0,u0,v0\begin{array} { l } 9 s - t + v \geq 3,000 \\u - v \geq 1,000 \\s + t \geq 500 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

A)maximize p=x+6y+zp = x + 6 y + z subject to 9xy+w3,000zw1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x - y + w \geq 3,000 \\z - w \geq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

B) maximize p=3,000x+1,000y+500zp = 3,000 x + 1,000 y + 500 z subject to
9x+z1x+z6y1xy0x0,y0,z0\begin{array} { l } 9 x + z \geq 1 \\- x + z \geq 6 \\y \geq 1 \\x - y \geq 0 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

C) maximize p=3,000x+1,000y+500zp = 3,000 x + 1,000 y + 500 z subject to

9x+z1x+z6y1xy0x0,y0,z0\begin{array} { l } 9 x + z \leq 1 \\- x + z \leq 6 \\y \leq 1 \\x - y \leq 0 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

D) maximize p=x+6y+zp = x + 6 y + z subject to
9xy+w3,000zw1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x - y + w \leq 3,000 \\z - w \leq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

E) maximize p=x+6y+zp = x + 6 y + z subject to

9x+y+w3,000z+w1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x + y + w \geq 3,000 \\z + w \geq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}
Question
Solve the standard minimization problem using duality.
Minimize C=18s+29tC = 18 s + 29 t
Subject to 3s+2t606s+3t60s0,t0\begin{array} { l } 3 s + 2 t \geq 60 \\6 s + 3 t \geq 60 \\s \geq 0 , t \geq 0\end{array}

A) C=360C = 360 , s=20s = 20 , t=0t = 0
B) C=580C = 580 , s=0s = 0 , t=20t = 20
C) C=290C = 290 , s=0s = 0 , t=10t = 10
D) C=180C = 180 , s=10s = 10 , t=0t = 0
E) C=650C = 650 , s=20s = 20 , t=10t = 10
Question
The Enormous State University's Business School is buying computers. The school has two models to choose from. Each first model comes with 400 MB of memory and 80 GB of disk space, while each second model has 300 MB of memory and 100 GB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 48,000 MB of memory and at least 12,800 GB of disk space. If both models cost $4,400 each, how many of each should the school buy to keep the cost as low as possible What are the shadow costs of memory and disk space

A)80 first models and 60 second models, $ 776\frac { 77 } { 6 } per MB and $ 3858\frac { 385 } { 8 } per GB
B) 60 first models and 80 second models, $ 3858\frac { 385 } { 8 } per MB and $ 3858\frac { 385 } { 8 } per GB
C) 60 first models and 80 second models, $ 776\frac { 77 } { 6 } per MB and $ 3858\frac { 385 } { 8 } per GB
D) 60 first models and 80 second models, $ 776\frac { 77 } { 6 } per MB and $ 776\frac { 77 } { 6 } per GB
E) 80 first models and 60 second models, $ 3858\frac { 385 } { 8 } per MB and $ 776\frac { 77 } { 6 } per GB
Question
We are to minimize p=3a+2bp = 3 a + 2 b subject to the following constraints. a+b43a+b6a,b0\begin{array} { l } a + b \geq 4 \\3 a + b \geq 6 \\a , b \geq 0\end{array}
After using the simplex method for dual problem to arrive at the tableau below, what is the maximum value for pp
X y s t p
[011212012101232032001319]\left[ \begin{array} { c c c c c } 0 & 1 & \frac { 1 } { 2 } & - \frac { 1 } { 2 } & 0 \\\frac { 1 } { 2 } & & & \\1 & 0 & - \frac { 1 } { 2 } & \frac { 3 } { 2 } & 0 \\\frac { 3 } { 2 } & & & & \\0 & 0 & 1 & 3 & 1 \\9 & & & &\end{array} \right]

A)9
B) 3
C) 5.5
D) 12\frac { 1 } { 2 }
E) 32\frac { 3 } { 2 }
Question
Solve the games with the given payoff matrix. P=[352324433]P = \left[ \begin{array} { l l l } - 3 & - 5 & - 2 \\- 3 & - 2 & - 4 \\- 4 & - 3 & - 3\end{array} \right]

A) C=[121613]C = \left[ \begin{array} { l } \frac { 1 } { 2 } \\\frac { 1 } { 6 } \\\frac { 1 } { 3 }\end{array} \right] , R=[161213]R = \left[ \begin{array} { l l l } \frac { 1 } { 6 } & \frac { 1 } { 2 } & \frac { 1 } { 3 }\end{array} \right] , e=196e = - \frac { 19 } { 6 }
B) C=[161312]C = \left[ \begin{array} { l } \frac { 1 } { 6 } \\\frac { 1 } { 3 } \\\frac { 1 } { 2 }\end{array} \right] , R=[131216]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 2 } & \frac { 1 } { 6 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
C) C=[161312]C = \left[ \begin{array} { l } \frac { 1 } { 6 } \\\frac { 1 } { 3 } \\\frac { 1 } { 2 }\end{array} \right] , R=[131216]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 2 } & \frac { 1 } { 6 }\end{array} \right] , e=196e = - \frac { 19 } { 6 }
D) C=[121613]C = \left[ \begin{array} { l } \frac { 1 } { 2 } \\\frac { 1 } { 6 } \\\frac { 1 } { 3 }\end{array} \right] , R=[161213]R = \left[ \begin{array} { l l l } \frac { 1 } { 6 } & \frac { 1 } { 2 } & \frac { 1 } { 3 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
E) C=[131216]C = \left[ \begin{array} { l } \frac { 1 } { 3 } \\\frac { 1 } { 2 } \\\frac { 1 } { 6 }\end{array} \right] , R=[131612]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 6 } & \frac { 1 } { 2 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
Question
Ruff makes dog food out of chicken and grain. Chicken has 10 grams of protein and 5 grams of fat/ounce, and grain has 2 grams of protein and 2 grams of fat per ounce. A bag of dog food must contain at least 200 grams of protein and at least 50 grams of fat. If chicken costs 15 cents per ounce and grain costs 2 cents per ounce, how many ounces of each should Ruff use in each bag of dog food in order to minimize cost What are the shadow costs of protein and fat ?

A)100 oz of chicken and no grain, 1 cents per gram of protein and 1 cents per gram of fat
B) 200 oz of chicken and no grain, 0 cents per gram of protein and 1 cents per gram of fat
C) 100 oz of chicken and no grain, 0.5 cents per gram of protein and 0.5 cents per gram of fat
D) 200 oz of grain and no chicken, 0.5 cents per gram of protein and 0.5 cents per gram of fat
E) 100 oz of grain and no chicken, 1 cents per gram of protein and 0 cents per gram of fat
Question
Solve the standard minimization problem using duality.
Minimize c=0.7s+0.3tc = 0.7 s + 0.3 t
Subject to 30s+20t6000.1s+0.4t40.2s+0.3t4.5s0.t0\begin{array} { l } 30 s + 20 t \geq 600 \\0.1 s + 0.4 t \geq 4 \\0.2 s + 0.3 t \geq 4.5 \\s \geq 0 . t \geq 0\end{array}

A) c=9,s=30,t=0c = 9 , s = 30 , t = 0
B) c=21,s=0,t=30c = 21 , s = 0 , t = 30
C) c=30,s=30,t=30c = 30 , s = 30 , t = 30
D) c=9,s=0,t=30c = 9 , s = 0 , t = 30
E) c=21,s=30,t=0c = 21 , s = 30 , t = 0
Question
Solve the games with the given payoff matrix. [1120120101102022]\left[ \begin{array} { c c c c } 1 & - 1 & 2 & 0 \\1 & 2 & 0 & 1 \\0 & 1 & 1 & 0 \\2 & 0 & - 2 & 2\end{array} \right]

A) C=[132300]C = \left[ \begin{array} { c } \frac { 1 } { 3 } \\\frac { 2 } { 3 } \\0 \\0\end{array} \right] , R=[013023]R = \left[ \begin{array} { l l l l } 0 & \frac { 1 } { 3 } & 0 & \frac { 2 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
B) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[132300]R = \left[ \begin{array} { l l l l } \frac { 1 } { 3 } & \frac { 2 } { 3 } & 0 & 0\end{array} \right] , e=23e = \frac { 2 } { 3 }
C) C=[132300]C = \left[ \begin{array} { c } \frac { 1 } { 3 } \\\frac { 2 } { 3 } \\0 \\0\end{array} \right] , R=[001323]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 1 } { 3 } & \frac { 2 } { 3 }\end{array} \right] , e=23e = \frac { 2 } { 3 }
D) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[001323]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 1 } { 3 } & \frac { 2 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
E) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[002313]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 2 } { 3 } & \frac { 1 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
Question
We are to minimize p=3a+2bp = 3 a + 2 b subject to the following constraints.
{a+b43a+b6a,b0}\left\{ \begin{array} { c } a + b \geq 4 \\3 a + b \geq 6 \\a , b \geq 0\end{array} \right\}
What is the dual problem in matrix form

A) [114316320]\left[ \begin{array} { l l l } 1 & 1 & 4 \\3 & 1 & 6 \\3 & 2 & 0\end{array} \right]
B) [114316110]\left[ \begin{array} { l l l } 1 & 1 & 4 \\3 & 1 & 6 \\1 & 1 & 0\end{array} \right]
C) [114316320]\left[ \begin{array} { c c c } 1 & 1 & 4 \\3 & 1 & 6 \\- 3 & - 2 & 0\end{array} \right]
D) [133112460]\left[ \begin{array} { c c c } 1 & 3 & - 3 \\1 & 1 & - 2 \\4 & 6 & 0\end{array} \right]
E) [133112460]\left[ \begin{array} { l l l } 1 & 3 & 3 \\1 & 1 & 2 \\4 & 6 & 0\end{array} \right]
Question
Write down (without solving) the dual LP problem.
Maximize p=x+y+z+wp = x + y + z + w subject to
x+y+z9y+z+w7x+z+w2x+y+w4x0,y0,z0,w0\begin{array} { l } x + y + z \leq 9 \\y + z + w \leq 7 \\x + z + w \leq 2 \\x + y + w \leq 4 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

A)minimize c=9s+7t+2u+4vc = 9 s + 7 t + 2 u + 4 v subject to s+u+v1s+t+v1s+t+u1t+u+v1s0,t0,u0,v0\begin{array} { l } s + u + v \leq 1 \\s + t + v \leq 1 \\s + t + u \leq 1 \\t + u + v \leq 1 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

B) minimize c=s+t+u+vc = s + t + u + v subject to
s+t+u7t+u+v6s+u+v3s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \leq 7 \\t + u + v \leq 6 \\s + u + v \leq 3 \\s + t + v \leq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

C) minimize c=s+t+u+vc = s + t + u + v subject to s+t+u9t+u+v7s+u+v2s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \geq 9 \\t + u + v \geq 7 \\s + u + v \geq 2 \\s + t + v \geq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

D) minimize c=s+t+u+vc = s + t + u + v subject to

s+t+u9t+u+v7s+u+v2s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \geq 9 \\t + u + v \geq 7 \\s + u + v \geq 2 \\s + t + v \geq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

E) minimize c=9s+7t+2u+4vc = 9 s + 7 t + 2 u + 4 v subject to
s+u+v1s+t+v1s+t+u1t+u+v1s0,t0,u0,v0\begin{array} { l } s + u + v \leq 1 \\s + t + v \leq 1 \\s + t + u \leq 1 \\t + u + v \leq 1 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}
Question
Federal Rent-a-Car is putting together a new fleet. It is considering package offers from three car manufacturers. Fred Motors is offering 5 small cars, 5 medium cars, and 10 large cars for $500,000. Admiral Motors is offering 5 small, 10 medium, and 5 large cars for $400,000. Chrysalis is offering 10 small, 5 medium, and 5 large cars for $300,000. Federal would like to buy at least 600 small cars, at least 500 medium cars, and at least 600 large cars. How many packages should it buy from each car maker to keep the total cost as small as possible What will be the total cost ?

A)15 packages of Fred Motors, 35 packages of Admiral Motors, and 15 packages of Chrysalis, the total cost is $26,000,000
B) 35 packages of Fred Motors, 15 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $34,000,000
C) 35 packages of Fred Motors, 35 packages of Admiral Motors, and 15 packages of Chrysalis, the total cost is $36,000,000
D) 15 packages of Fred Motors, 35 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $32,000,000
E) 15 packages of Fred Motors, 15 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $24,000,000
Question
Write down (without solving) the dual LP problem.

Maximize Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas.<div style=padding-top: 35px> subject to
Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas.<div style=padding-top: 35px>
Use the letters s, t​, u, and v in the indicated order.

Minimize Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas.<div style=padding-top: 35px> __________ subject to the constraints.

Please enter the inequalities, separated by commas.
Question
The Enormous State University's Business School is buying computers. The school has two models to choose from. Each first model comes with 400 MB of memory and 80 GB of disk space, while each second model has 300 MB of memory and 100 GB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 48,000 MB of memory and at least 12,800 GB of disk space. If both models cost $800 each, how many of each should the school buy to keep the cost as low as possible

__________ first model(s) and __________ second model(s).

What are the shadow costs of memory and disk space

Please, enter first the shadow cost of MB and then the shadow cost of GB as improper fractions of integers without units. Separate your answers by a comma.
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________<div style=padding-top: 35px> ___________
Question
Solve the standard minimization problem using duality.

Minimize c=6s+2tc = 6 s + 2 t
subject to s+t96s+t24s0,t0\begin{array} { l } s + t \geq 9 \\6 s + t \geq 24 \\s \geq 0 , t \geq 0\end{array}
After using the simplex method for dual problem to arrive at the tableau below, what is the maximum value for c
xyzwc\quad \quad x\quad y\quad z \quad w \quad c
[0115150451015650650036130]\left[ \begin{array} { c c c c c } 0&1&\frac{1}{5}&\frac{1}{-5}&0\\\frac{4}{5}\\1&0&\frac{1}{-5}&\frac{6}{5}&0\\\frac{6}{5}\\0&0&3&6&1\\30\end{array} \right]
Question
Ruff makes dog food out of chicken and grain. Chicken has 10 grams of protein and 5 grams of fat per ounce, and grain has 2 grams of protein and 2 grams of fat per ounce. A bag of dog food must contain at least 200 grams of protein and at least 100 grams of fat. If chicken costs 25 cents/ounce and grain costs 1 cents/ounce, how many ounces of each should Ruff use in each bag of dog food in order to minimize cost

__________ oz of chicken and __________ oz of grain.

What are the shadow costs of protein and fat

__________ cent(s) per gram of protein and __________ cent(s) per gram of fat.
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px> _________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px> _________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Oz makes lion food out of giraffe and gazelle meat. Giraffe meat has 18 grams of protein and 36 grams of fat per pound, while gazelle meat has 36 grams of protein and 18 grams of fat per pound. A batch of lion food must contain at least 36,000 grams of protein and 54,000 grams of fat. Giraffe meat costs $2/pound and gazelle meat costs $4/pound. How many pounds of each should go into each batch of lion food in order to minimize costs Please round the answers to the nearest pound.

__________ pound(s) of giraffe meat and __________ pound(s) of gazelle.

What are the shadow costs of protein and fat Please round the answers to the nearest cent.

__________ cents per gram of protein and __________ cents per gram of fat.
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Each serving of Gerber Mixed Cereal for Baby contains 60 calories and no Vitamin C. Each serving of Gerber Mango Tropical Fruit Dessert contains 80 calories and 45 percent of the U.S. Recommended Daily Allowance (RDA) of Vitamin C for infants. Each serving of Gerber Apple Banana Juice contains 60 calories and 120 percent of the RDA of Vitamin C for infants. The cereal costs 10 cents per serving, the dessert costs 53 cents per serving, and the juice costs 27 cents per serving. If you want to provide your child with at least 120 calories and at least 120 percent of the RDA of Vitamin C, how can you do so at the least cost ?

A)1 serving of cereal, 1 serving of juice, and no dessert
B) 1 serving of dessert, 1 serving of juice, and no cereal
C) 1 serving of cereal, 3 servings of dessert, and no juice
D) 3 servings of dessert, 1 serving of juice, and no cereal
E) 1 serving of cereal, 1 serving of dessert, and no juice
Question
Write down (without solving) the dual LP problem.

Minimize Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas.<div style=padding-top: 35px> subject to
Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas.<div style=padding-top: 35px>
Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem.

Maximize Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas.<div style=padding-top: 35px> __________ subject to the constraints.

Please enter the inequalities, separated with commas.
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​  <div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​  <div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​  <div style=padding-top: 35px>
Question
Solve the standard minimization problem using duality. Minimize Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> subject to the following.
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
The Miami Beach City Council has offered to subsidize hotel development in Miami Beach, and it is hoping for at least two hotels with a total capacity of at least 2,600. Suppose that you are a developer interested in taking advantage of this offer by building a small group of hotels in Miami Beach. You are thinking of three prototypes: a convention-style hotel with 500 rooms costing $100 million, a vacation-style hotel with 200 rooms costing $20 million, and a small motel with 50 rooms costing $4 million. The City Council will approve your plans, provided you build at least one convention-style hotel and no more than two small motels. How many of each type of hotel should you build to satisfy the city council's wishes and stipulations while minimizing your total cost ?

A)1 convention-style hotel, 13 vacation-style hotels, and 2 small motels
B) 1 convention-style hotel, 1 vacation-style hotel, and 2 small motels
C) 2 convention-style hotels, 10 vacation-style hotels, and 1 small motel
D) 2 convention-style hotels, 1 vacation-style hotel, and 1 small motel
E) 1 convention-style hotel, 10 vacation-style hotels, and 2 small motels
Question
Write down ( without solving ) the dual LP problem.

Minimize p=5a+4bp = 5 a + 4 b subject to
{a+b85a+b20a0,b0}\left\{ \begin{array} { c } a + b \geq 8 \\5 a + b \geq 20 \\a \geq 0 , b \geq 0\end{array} \right\}
What is the dual problem in matrix form
Question
Solve the standard minimization problem using duality.
Minimize Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> subject to Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
We return to your exploits coordinating distribution for the Tubular Ride Boogie Board Company. You will recall that the company has manufacturing plants in Tucson, Arizona and Toronto, Ontario, and you have been given the job of coordinating distribution of their latest model, the Gladiator, to their outlets in Honolulu and Venice Beach. The Tucson plant can manufacture up to 620 boards per week, while the Toronto plant, beset by labor disputes, can produce no more than 410 Gladiator boards per week. The outlet in Honolulu orders 480 Gladiator boards per week, while Venice Beach orders 510 boards per week. Transportation costs are as follows: Tucson to Honolulu: $10 per board; Tucson to Venice Beach: $5 per board; Toronto to Honolulu: $20 per board; Toronto to Venice Beach: $10 per board. Your manager has said that you are to be sure to fill all orders and ship the boogie boards at a minimum total transportation cost. But you have just been notified that workers at the Toronto boogie board plant have gone on strike, resulting in a total work stoppage. You are to come up with a revised delivery schedule by tomorrow with the understanding that the Tucson plant can push production to a maximum of 880 boards per week. Can you devise a delivery schedule with these accommodations in mind ?

A)no
B) yes
Question
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Minimize Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> subject to the following (using the simplex method).
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Minimize c=5.45x+y+1.5z+wc = 5.45 x + y + 1.5 z + w
Subject to
5.12xy+w1,500z+w1,5001.12x+y1,000x0,y0,z0\begin{aligned}5.12 x - y + w & \geq 1,500 \\z + w & \geq 1,500 \\1.12 x + y & \leq 1,000 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=1,500c = 1,500 , x=0x = 0 , y=1,500y = 1,500 , z=0z = 0 , w=0w = 0
B) c=1,500c = 1,500 , x=0x = 0 , y=0y = 0 , z=0z = 0 , w=1,500w = 1,500
C) c=1,500c = 1,500 , x=0x = 0 , y=0y = 0 , z=1,500z = 1,500 , w=0w = 0
D) c=8,175c = 8,175 , x=1,500x = 1,500 , y=0y = 0 , z=0z = 0 , w=0w = 0
E) c=2,250c = 2,250 , x=0x = 0 , y=0y = 0 , z=1,500z = 1,500 , w=0w = 0
Question
Minimize c=4x+7yc = 4 x + 7 y
Subject to
8x+3y302x+3y12x0,y0\begin{array} { l } 8 x + 3 y \geq 30 \\2 x + 3 y \geq 12 \\x \geq 0 , y \geq 0\end{array}

A) c=24c = 24 , x=6x = 6 , y=0y = 0
B) c=21c = 21 , x=0x = 0 , y=3y = 3
C) c=6c = 6 , x=3x = 3 , y=0y = 0
D) c=42c = 42 , x=0x = 0 , y=6y = 6
E) no solution
Question
Minimize c=2x+y+3zc = 2 x + y + 3 z
Subject to
x+y+z1502x+y30y+z40x0,y0,z0\begin{aligned}x + y + z & \geq 150 \\2 x + y & \geq 30 \\y + z & \geq 40 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=450c = 450 , x=0x = 0 , y=0y = 0 , z=150z = 150
B) c=300c = 300 , x=150x = 150 , y=0y = 0 , z=0z = 0
C) c=150c = 150 , x=0x = 0 , y=150y = 150 , z=0z = 0
D) c=30c = 30 , x=0x = 0 , y=30y = 30 , z=0z = 0
E) no solution
Question
Maximize
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>

If there is no solution, do not fill the fields.
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Maximize p=2x+3y+z+4wp = 2 x + 3 y + z + 4 w
Subject to
x+y+z+w402x+yzw10x+y+z+w10x0,y0,z0,w0\begin{aligned}x + y + z + w & \leq 40 \\2 x + y - z - w & \geq 10 \\x + y + z + w & \geq 10 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}

A) p=65p = 65 , x=25x = 25 , y=0y = 0 , z=15z = 15 , w=0w = 0
B) p=135p = 135 , x=0x = 0 , y=25y = 25 , z=0z = 0 , w=15w = 15
C) p=130p = 130 , x=0x = 0 , y=15y = 15 , z=0z = 0 , w=15w = 15
D) p=55p = 55 , x=15x = 15 , y=0y = 0 , z=25z = 25 , w=0w = 0
E) no solution
Question
Your small farm encompasses 100 acres, and you are planning to grow tomatoes, lettuce, and carrots in the coming planting season. Fertilizer costs per acre are: $5 for tomatoes, $4 for lettuce, and $2 for carrots. Based on past experience, you estimate that each acre of tomatoes will require an average of 4 hours of labor per week, while tending to lettuce and carrots will each require an average of 2 hours per week. You estimate a profit of $2,000 for each acre of tomatoes, $1,500 for each acre of lettuce and $500 for each acre of carrots. You would like to spend at least $300 on fertilizer (your niece owns the company that manufactures it) and your farm laborers can supply up to 500 hours per week. How many acres of each crop should you plant to maximize total profits In this event, will you be using all 100 acres of your farm ?

A)plant 100 acres of tomatoes and no other crops, you will be using all 100 acres of your farm
B) plant 60 acres of tomatoes and no other crops, you will not be using all 100 acres of your farm
C) plant 100 acres of lettuce and no other crops, you will be using all 100 acres of your farm
D) plant 40 acres of carrots and no other crops, you will be using all 100 acres of your farm
E) plant 20 acres of lettuce and no other crops, you will be using all 100 acres of your farm
Question
Minimize c=2.2x+y+3.3zc = 2.2 x + y + 3.3 z
Subject to
x+1.5y+1.2z1502x+1.5y401.5y+1.1z40x0,y0,z0\begin{aligned}x + 1.5 y + 1.2 z & \geq 150 \\2 x + 1.5 y & \geq 40 \\1.5 y + 1.1 z & \geq 40 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}
Round all answers to two decimal places.

A) c=320c = 320 , x=100x = 100 , y=100y = 100 , z=0z = 0
B) c=330c = 330 , x=0x = 0 , y=0y = 0 , z=100z = 100
C) c=100c = 100 , x=0x = 0 , y=100y = 100 , z=0z = 0
D) c=550c = 550 , x=100x = 100 , y=0y = 0 , z=100z = 100
E) c=220c = 220 , x=100x = 100 , y=0y = 0 , z=0z = 0
Question
Maximize p=x+2yp = x + 2 y
Subject to
x+y20y82xy0x0,y0\begin{aligned}x + y & \leq 20 \\y & \geq 8 \\2 x - y & \geq 0 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=80p = 80 , x=40x = 40 , y=20y = 20
B) p=100p = 100 , x=20x = 20 , y=40y = 40
C) p=803p = \frac { 80 } { 3 } , x=403x = \frac { 40 } { 3 } , y=203y = \frac { 20 } { 3 }
D) p=1003p = \frac { 100 } { 3 } , x=203x = \frac { 20 } { 3 } , y=403y = \frac { 40 } { 3 }
E) no solution
Question
Minimize c=50x+50y+11zc = 50 x + 50 y + 11 z
Subject to
2x+z82x+yz43x+yz6x0,y0,z0\begin{aligned}2 x + z & \geq 8 \\2 x + y - z & \geq 4 \\3 x + y - z & \leq 6 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=399c = 399 , x=5x = 5 , y=1y = 1 , z=9z = 9
B) c=494c = 494 , x=5x = 5 , y=4y = 4 , z=4z = 4
C) c=161c = 161 , x=2x = 2 , y=1y = 1 , z=1z = 1
D) c=344c = 344 , x=2x = 2 , y=4y = 4 , z=4z = 4
E) no solution
Question
Maximize p=12x+10yp = 12 x + 10 y
Subject to
x+y40x1x+2y0x0,y0\begin{aligned}x + y & \leq 40 \\x & \geq 1 \\- x + 2 y & \geq 0 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=1,360p = 1,360 , x=80x = 80 , y=40y = 40
B) p=5603p = \frac { 560 } { 3 } , x=403x = \frac { 40 } { 3 } , y=803y = \frac { 80 } { 3 }
C) p=1,3603,x=803,y=403p = \frac { 1,360 } { 3 } , x = \frac { 80 } { 3 } , y = \frac { 40 } { 3 }
D) p=1,280p = 1,280 , x=40x = 40 , y=80y = 80
E) no solution
Question
Minimize c=5x+y+z+2wc = 5 x + y + z + 2 w
Subject to
5xy+w1,000z+w2,000x+y500x0,y0,z0,w0\begin{aligned}5 x - y + w & \geq 1,000 \\z + w & \leq 2,000 \\x + y & \leq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}

A) c=600c = 600 , x=0x = 0 , y=200y = 200 , z=200z = 200 , w=200w = 200
B) c=1,600c = 1,600 , x=200x = 200 , y=200y = 200 , z=200z = 200 , w=200w = 200
C) c=1,000c = 1,000 , x=200x = 200 , y=0y = 0 , z=0z = 0 , w=0w = 0
D) c=200c = 200 , x=0x = 0 , y=200y = 200 , z=0z = 0 , w=0w = 0
E) no solution
Question
Fancy Pineapple produces pineapple juice and canned pineapple rings. This year the company anticipates a demand of at least 10,000 pints of pineapple juice and 500 cans of pineapple rings. Each pint of pineapple juice requires 2 pineapples, and each can of pineapple rings requires 1 pineapple. The company anticipates using at least 5,000 pineapples for these products. Each pint of pineapple juice costs the company 20 cents to produce, and each can of pineapple rings costs 50 cents to produce. How many pints of pineapple juice and cans of pineapple rings should Fancy Pineapple produce to meet the demand and minimize total costs ?

A)25,000 pints of pineapple juice and 500 cans of pineapple rings
B) 500 pints of pineapple juice and 10,000 cans of pineapple rings
C) 1,000 pints of pineapple juice and 25,000 cans of pineapple rings
D) 10,000 pints of pineapple juice and 500 cans of pineapple rings
E) 25,000 pints of pineapple juice and 1,000 cans of pineapple rings
Question
Maximize p=7x+9yp = 7 x + 9 y subject to the following (using the simplex method).
9x+8y144x+y88x+9y144x0,y0\begin{aligned}9 x + 8 y & \leq 144 \\x + y & \geq 8 \\8 x + 9 y & \leq 144 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=112p = 112 , x=16x = 16 , y=0y = 0
B) p=144p = 144 , x=0x = 0 , y=16y = 16
C) p=56p = 56 , x=8x = 8 , y=0y = 0
D) p=72p = 72 , x=0x = 0 , y=8y = 8
E) no solution
Question
Maximize Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> subject to the following (using the simplex method).
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
The political pollster Canter is preparing for a national election. It would like to poll at least 2,400 Democrats and 2,400 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost $40 each to produce and mail, mailings to the Midwest cost $60 each, and mailings to the West Coast cost $50 each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost What will it cost ?

A)16 mailings to the East Coast, none to the Midwest, 16 to the West Coast, the cost is $1,440
B) No mailings to the East Coast, 24 to the Midwest, none to the West Coast, the cost is $1,440
C) 24 mailings to the East Coast, none to the Midwest, 24 to the West Coast, another solution resulting in the same cost is no mailings to the East Coast, 16 to the Midwest, none to the West Coast, the cost is $1,440
D) 16 mailings to the East Coast, none to the Midwest, 16 to the West Coast, another solution resulting in the same cost is no mailings to the East Coast, 24 to the Midwest, none to the West Coast, the cost is $1,440
E) No mailings to the East Coast, 16 to the Midwest, none to the West Coast, the cost is $1,440
Question
Minimize c=50x+11y+50zc = 50 x + 11 y + 50 z
Subject to
3x+z63x+yz64x+yz8x0,y0,z0\begin{array} { r } 3 x + z \geq 6 \\3 x + y - z \geq 6 \\4 x + y - z \leq 8 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

A) c=400c = 400 , x=8x = 8 , y=0y = 0 , z=0z = 0
B) c=716c = 716 , x=8x = 8 , y=6y = 6 , z=5z = 5
C) c=88c = 88 , x=0x = 0 , y=0y = 0 , z=8z = 8
D) c=100c = 100 , x=2x = 2 , y=0y = 0 , z=0z = 0
E) no solution
Question
Maximize p=2x+3y+1.1z+4wp = 2 x + 3 y + 1.1 z + 4 w
Subject to
1.2x+y+z+w422.2x+yzw151.2x+y+z+1.2w11.5x0,y0,z0,w0\begin{aligned}1.2 x + y + z + w & \leq 42 \\2.2 x + y - z - w & \geq 15 \\1.2 x + y + z + 1.2 w & \geq 11.5 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}
Round all answers to two decimal places.

A) p=111p = 111 , x=28.5x = 28.5 , y=0y = 0 , z=0z = 0 , w=13.5w = 13.5
B) p=139.5p = 139.5 , x=0x = 0 , y=28.5y = 28.5 , z=0z = 0 , w=13.5w = 13.5
C) p=154.5p = 154.5 , x=0x = 0 , y=13.5y = 13.5 , z=0z = 0 , w=28.5w = 28.5
D) p=71.85p = 71.85 , x=28.5x = 28.5 , y=0y = 0 , z=13.5z = 13.5 , w=0w = 0
E) p=100.35p = 100.35 , x=0x = 0 , y=28.5y = 28.5 , z=13.5z = 13.5 , w=0w = 0
Question
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Maximize p=3x+5y+zp = 3 x + 5 y + z
Subject to
2x6y+2z20x+3y4z11x0,y0,z0\begin{aligned}2 x - 6 y + 2 z & \leq 20 \\x + 3 y - 4 z & \leq 11 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) p=116p = 116 , x=9x = 9 , y=14y = 14 , z=13z = 13
B) p=116p = 116 , x=13x = 13 , y=9y = 9 , z=14z = 14
C) p=116p = 116 , x=14x = 14 , y=9y = 9 , z=13z = 13
D) p=116p = 116 , x=14x = 14 , y=13y = 13 , z=9z = 9
E) no solution
Question
The political pollster Canter is preparing for a national election. It would like to poll at least 900 Democrats and 900 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost $40 each to produce and mail, mailings to the Midwest cost $60 each, and mailings to the West Coast cost $50 each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost

__________ mailings to the East Coast, none to the Midwest, and __________ to the West Coast.

Another solution resulting in the same cost is no mailings to the East Coast, __________ to the Midwest, and none to the West Coast.

What will it cost

$__________
Question
You have $600,000 and are considering investing in three municipal bond funds, Pimco, Fidelity Spartan, and Columbia Oregon. You have the following data:  Company  Yield  PNF (Pimco NY) 7% FDMMX (Fidelity Spartan Mass) 5% CMBFX (Columbia Oregon) 4%\begin{array} { | c | c | } \hline \text { Company } & \text { Yield } \\\hline \text { PNF (Pimco NY) } & 7 \% \\\hline \text { FDMMX (Fidelity Spartan Mass) } & 5 \% \\\hline \text { CMBFX (Columbia Oregon) } & 4 \% \\\hline\end{array} Your broker has made the following suggestions:
At least 50 percent of your total investment should be in CMBFX.
No more than 10 percent of your total investment should be in PNF.
How much should you invest in each fund to maximize your anticipated returns while following your broker's advice

A)$60,000 in PNF, $240,000 in FDMMX, and $300,000 in CMBFX
B) $240,000 in PNF, $300,000 in FDMMX, and $60,000 in CMBFX
C) $300,000 in PNF, $240,000 in FDMMX, and $60,000 in CMBFX
D) $300,000 in PNF, $60,000 in FDMMX, and $240,000 in CMBFX
E) $60,000 in PNF, $300,000 in FDMMX, and $240,000 in CMBFX
Question
The Miami Beach City Council has offered to subsidize hotel development in Miami Beach, and it is hoping for at least two hotels with a total capacity of at least 1,800. Suppose that you are a developer interested in taking advantage of this offer by building a small group of hotels in Miami Beach. You are thinking of three prototypes: a convention-style hotel with 500 rooms costing $100 million, a vacation-style hotel with 200 rooms costing $20 million, and a small motel with 50 rooms costing $4 million. The City Council will approve your plans, provided you build at least one convention-style hotel and no more than two small motels. How many of each type of hotel should you build to satisfy the city council's wishes and stipulations while minimizing your total cost

__________ convention-style hotel(s), __________ vacation-style hotel(s), and __________ small motel(s).

Now assume that the city council will give developers 20 percent of the cost of building new hotels in Miami Beach, up to $70 million. Will the city's $70 million subsidy be sufficient to cover 20 percent of your total costs
Question
Each serving of Gerber Mixed Cereal for Baby contains 60 calories and no Vitamin C. Each serving of Gerber Mango Tropical Fruit Dessert contains 80 calories and 45 percent of the U.S. Recommended Daily Allowance (RDA) of Vitamin C for infants. Each serving of Gerber Apple Banana Juice contains 60 calories and 120 percent of the RDA of Vitamin C for infants. The cereal costs 10 cents per serving, the dessert costs 53 cents per serving, and the juice costs 27 cents per serving. If you want to provide your child with at least 360 calories and at least 240 percent of the RDA of Vitamin C, how can you do so at the least cost
?
__________ serving(s) of cereal, __________ serving(s) of dessert, and __________ serving(s) of juice.
Question
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Maximize
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.<div style=padding-top: 35px>
subject to
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.<div style=padding-top: 35px>
Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Question
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
We return to your exploits coordinating distribution for the Tubular Ride Boogie Board Company. You will recall that the company has manufacturing plants in Tucson, Arizona and Toronto, Ontario, and you have been given the job of coordinating distribution of their latest model, the Gladiator, to their outlets in Honolulu and Venice Beach. The Tucson plant can manufacture up to 620 boards per week, while the Toronto plant, beset by labor disputes, can produce no more than 410 Gladiator boards per week. The outlet in Honolulu orders 470 Gladiator boards per week, while Venice Beach orders 500 boards per week. Transportation costs are as follows: Tucson to Honolulu: $10 per board; Tucson to Venice Beach: $5 per board; Toronto to Honolulu: $20 per board; Toronto to Venice Beach: $10 per board. Your manager has said that you are to be sure to fill all orders and ship the boogie boards at a minimum total transportation cost. But you have just been notified that workers at the Toronto boogie board plant have gone on strike, resulting in a total work stoppage. You are to come up with a revised delivery schedule by tomorrow with the understanding that the Tucson plant can push production to a maximum of 810 boards per week. What should you do
Question
Federal Rent-a-Car is putting together a new fleet. It is considering package offers from three car manufacturers. Fred Motors is offering 5 small cars, 5 medium cars, and 10 large cars for $500,000. Admiral Motors is offering 5 small, 10 medium, and 5 large cars for $400,000. Chrysalis is offering 10 small, 5 medium, and 5 large cars for $300,000. Federal would like to buy at least 750 small cars, at least 600 medium cars, and at least 750 large cars. How many packages should it buy from each car maker to keep the total cost as small as possible

__________ package(s) of Fred Motors, __________ package(s) of Admiral Motors, and __________ package(s) of Chrysalis.

What will be the total cost

$__________
Question
Maximize
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
Round answers to two decimal places, if necessary.

If there is no solution, do not fill the fields.
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Use the simplex method to maximize 2x+9y=p2 x + 9 y = p , subject to the following. {2x+y16x+2y8x0,y0}\left\{ \begin{array} { c } 2 x + y \leq 16 \\x + 2 y \leq 8 \\x \geq 0 , y \geq 0\end{array} \right\}

A) p=110p = 110
B) p=144p = 144
C) p=36p = 36
D) p=120p = 120
E) p=72p = 72
Question
Fancy Pineapple produces pineapple juice and canned pineapple rings. This year the company anticipates a demand of at least 15,000 pints of pineapple juice and 2,500 cans of pineapple rings. Each pint of pineapple juice requires 2 pineapples, and each can of pineapple rings requires 1 pineapple. The company anticipates using at least 10,000 pineapples for these products. Each pint of pineapple juice costs the company 20 cents to produce, and each can of pineapple rings costs 50 cents to produce. How many pints of pineapple juice and cans of pineapple rings should Fancy Pineapple produce to meet the demand and minimize total costs

__________ pints of pineapple juice and __________ cans of pineapple rings.
Question
Minimize
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
subject to
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px>
Round answers to two decimal places, if necessary.

If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________<div style=padding-top: 35px> __________
Question
Your publishing company is about to start a promotional blitz for its new book, Physics for the Liberal Arts. You have 35 salespeople stationed in Chicago and 10 in Denver. You would like to fly at most 20 into Los Angeles and at most 20 into New York. A round-trip plane flight from Chicago to LA costs $195; from Chicago to NY costs $182; from Denver to LA costs $395; and from Denver to NY costs $166. You want to spend at most $7,380 on plane flights. How many salespeople should you fly from each of Chicago and Denver to each of LA and NY to have the most salespeople on the road ?

A)20 people from Chicago to LA, 10 people from Chicago to NY, no people from Denver to LA, and 10 people from Denver to NY
B) 10.0000000000 people from Chicago to LA, 10.0000000000 people from Chicago to NY, 20.0000000000 people from Denver to LA, and no people from Denver to NY
C) 10.0000000000 people from Chicago to LA, no people from Chicago to NY, 10.0000000000 people from Denver to LA, and 20.0000000000 people from Denver to NY
D) 10 people from Chicago to LA, 20 people from Chicago to NY, no people from Denver to LA, and 10 people from Denver to NY
E) 10 people from Chicago to LA, no people from Chicago to NY, 10 people from Denver to LA, and 10 people from Denver to NY
Question
Maximize
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.<div style=padding-top: 35px>
subject to
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.<div style=padding-top: 35px>
Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Question
The University's employee credit union has $4 million available for loans in the coming year. As VP in charge of finances, you must decide how much capital to allocate to each of four different kinds of loans, as shown in the table.  Type of Loan  Annual Rate of  Return  Automobile 8% Furniture 10% Signature 12% Other secured 10%\begin{array} { | c | c | } \hline \text { Type of Loan } & \begin{array} { c } \text { Annual Rate of } \\\text { Return }\end{array} \\\hline \text { Automobile } & 8 \% \\\hline \text { Furniture } & 10 \% \\\hline \text { Signature } & 12 \% \\\hline \text { Other secured } & 10 \% \\\hline\end{array} State laws and credit union policies impose the following restrictions:
Signature loans may not exceed 10 percent of the total investment of funds.
Furniture loans plus other secured loans may not exceed automobile loans.
How much should you allocate to each type of loan to maximize the annual return

A)allocate $1,800,000 to automobile loans, $400,000 to signature loans, $1,800,000 to furniture loans and no allocation to other secured loans
B) allocate $1,800,000 to automobile loans, $400,000 to signature loans, no allocation to furniture loans and $1,800,000 other secured loans
C) allocate $400,000 to automobile loans, $1,800,000 to signature loans, and $1,800,000 to any combination of furniture loans and other secured loans
D) allocate $1,800,000 to automobile loans, $400,000 to signature loans, and $1,800,000 to any combination of furniture loans and other secured loans
E) allocate $1,800,000 to automobile loans, $400,000 to signature loans, and $400,000 to any combination of furniture loans and other secured loans
Question
Your small farm encompasses 150 acres, and you are planning to grow tomatoes, lettuce, and carrots in the coming planting season. Fertilizer costs per acre are: $5 for tomatoes, $4 for lettuce, and $2 for carrots. Based on past experience, you estimate that each acre of tomatoes will require an average of 4 hours of labor per week, while tending to lettuce and carrots will each require an average of 2 hours per week. You estimate a profit of $2,000 for each acre of tomatoes, $1,500 for each acre of lettuce and $500 for each acre of carrots. You would like to spend at least $600 on fertilizer (your niece owns the company that manufactures it) and your farm laborers can supply up to 900 hours per week. How many acres of each crop should you plant to maximize total profits

Plant __________ acres of tomatoes, __________ acres of lettuce, and __________ acres of carrots.

In this event, will you be using all 150 acres of your farm
Question
If x dollars is invested in a company that controls, say, 30 percent of the market with 5 brand-names, then 0.3x0.3 x is a measure of market exposure and 5x5 x is a measure of brand-name exposure. Now suppose you are a broker at a large securities firm, and one of your clients would like to invest up to $100,000 in recording industry stocks. You decide to recommend a combination of stocks in four of the world's largest companies: Warner Music, Universal Music, Sony, and EMI.  Warner Music  Universal Music  Sony  EMI  Market Share 12%20%20%15% Number of  brand-names 8201015\begin{array} { | c | c | c | c | c | } \hline & \text { Warner Music } & \text { Universal Music } & \text { Sony } & \text { EMI } \\\hline \text { Market Share } & 12 \% & 20 \% & 20 \% & 15 \% \\\hline \begin{array} { c } \text { Number of } \\\text { brand-names }\end{array} & 8 & 20 & 10 & 15 \\\hline\end{array}
You wanted your client to maximize his total market exposure but limit his brand-name exposure to 2 million or less (representing an average of 20 labels or fewer per company), and still invest at least 20 percent of the total in Universal. How much should you advise your client to invest in each company

A)$20,000 in Warner Music, $80,000 in Sony, and no investment in Universal Music and EMI
B) $80,000 in Warner Music, $20,000 in EMI, and no investment in Universal Music and Sony
C) $20,000 in Universal Music, $80,000 in Sony, and no investment in Warner Music and EMI
D) $80,000 in Warner Music, $20,000 in Sony, and no investment in Universal Music and EMI
E) $80,000 in Universal Music, $20,000 in Sony, and no investment in Warner Music and EMI
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/161
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 6: Linear Programming
1
Write down (without solving) the dual linear programming problem. Minimize C=13s+35tC = 13 s + 35 t subject to the following. 7s3t15s+4t25s0,t0\begin{array} { l } 7 s - 3 t \geq 15 \\s + 4 t \geq 25 \\s \geq 0 , t \geq 0\end{array}

A)Maximize P=15x+25yP = 15 x + 25 y subject to the following. 7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\- 3 x + 4 y \leq 35 \\x \leq 0 , y \leq 0\end{array}

B) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\3 x + 4 y \leq - 35 \\x \geq 0 , y \geq 0\end{array}

C) Maximize P=15x+25yP = 15 x + 25 y subject to the following.

7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \geq 13 \\- 3 x + 4 y \geq 35 \\x \geq 0 , y \geq 0\end{array}

D) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\3 x + 4 y \leq 35 \\x \geq 0 , y \geq 0\end{array}

E) Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\- 3 x + 4 y \leq 35 \\x \geq 0 , y \geq 0\end{array}
Maximize P=15x+25yP = 15 x + 25 y subject to the following.
7x+y133x+4y35x0,y0\begin{array} { l } 7 x + y \leq 13 \\- 3 x + 4 y \leq 35 \\x \geq 0 , y \geq 0\end{array}
2
Solve the standard minimization problem using duality.
Minimize c=5s+2tc = 5 s + 2 t
Subject to 3s+t30s+t20s+3t30s0,t0\begin{array} { l } 3 s + t \geq 30 \\s + t \geq 20 \\s + 3 t \geq 30 \\s \geq 0 , t \geq 0\end{array}

A) c=55c = 55 , s=5s = 5 , t=15t = 15
B) c=85c = 85 , s=15s = 15 , t=5t = 5
C) c=25c = 25 , s=5s = 5 , t=0t = 0
D) c=30c = 30 , s=0s = 0 , t=15t = 15
E) c=10c = 10 , s=0s = 0 , t=5t = 5
c=55c = 55 , s=5s = 5 , t=15t = 15
3
Solve the standard minimization problem using duality.  Minimize c=3s+3t+3u3s+2t+u1502s+t+3u150 subject to s+3t+2u150s0,t0,u0\begin{array} { l } \text { Minimize } ^ { c = 3 s + 3 t + 3 u } \\3 s + 2 t + u \geq 150 \\2 s + t + 3 u \geq 150 \\\text { subject to } s + 3 t + 2 u \geq 150 \\s \geq 0 , t \geq 0 , u \geq 0 \\\end{array}
If you have several solutions, select one of them.

A) c=90c = 90 , s=37.5s = 37.5 , t=0t = 0 , u=37.5u = 37.5
B) c=225c = 225 , s=25s = 25 , t=25t = 25 , u=25u = 25
C) c=135c = 135 , s=15s = 15 , t=15t = 15 , u=15u = 15
D) c=180c = 180 , s=20s = 20 , t=20t = 20 , u=20u = 20
E) c=225c = 225 , s=10s = 10 , t=10t = 10 , u=10u = 10
c=225c = 225 , s=25s = 25 , t=25t = 25 , u=25u = 25
4
Solve the standard minimization problem using duality.
Minimize c=0.4s+0.6tc = 0.4 s + 0.6 t
Subject to 0.2s+0.1t10.15s+0.3t1.510s+10t80s0,t0\begin{array} { l } 0.2 s + 0.1 t \geq 1 \\0.15 s + 0.3 t \geq 1.5 \\10 s + 10 t \geq 80 \\s \geq 0 , t \geq 0\end{array}

A) c=3.6c = 3.6 , s=6s = 6 , t=2t = 2
B) c=2.8c = 2.8 , s=6s = 6 , t=2t = 2
C) c=1.2c = 1.2 , s=6s = 6 , t=2t = 2
D) c=4.4c = 4.4 , s=2s = 2 , t=6t = 6
E) c=2.8c = 2.8 , s=2s = 2 , t=6t = 6
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
5
Solve the games with the given payoff matrix.
P=[463435]P = \left[ \begin{array} { l l l } - 4 & - 6 & - 3 \\- 4 & - 3 & - 5\end{array} \right]

A) C=[0108159]C = \left[ \begin{array} { c } 0 \\\frac { 10 } { 81 } \\\frac { 5 } { 9 }\end{array} \right] , R=[108159]R = \left[ \begin{array} { l l } \frac { 10 } { 81 } & \frac { 5 } { 9 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
B) C=[25350]C = \left[ \begin{array} { l } \frac { 2 } { 5 } \\\frac { 3 } { 5 } \\0\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
C) C=[02535]C = \left[ \begin{array} { l } 0 \\\frac { 2 } { 5 } \\\frac { 3 } { 5 }\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = \frac { 21 } { 5 }
D) C=[0108159]C = \left[ \begin{array} { c } 0 \\\frac { 10 } { 81 } \\\frac { 5 } { 9 }\end{array} \right] , R=[108159]R = \left[ \begin{array} { l l } \frac { 10 } { 81 } & \frac { 5 } { 9 }\end{array} \right] , e=215e = \frac { 21 } { 5 }
E) C=[02535]C = \left[ \begin{array} { l } 0 \\\frac { 2 } { 5 } \\\frac { 3 } { 5 }\end{array} \right] , R=[2535]R = \left[ \begin{array} { l l } \frac { 2 } { 5 } & \frac { 3 } { 5 }\end{array} \right] , e=215e = - \frac { 21 } { 5 }
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
6
Solve the standard minimization problem using duality.
Minimize c=4s+7t+9uc = 4 s + 7 t + 9 u
Subject to s+2t+2u602s+t+3u60s0,t0,u0\begin{array} { l } s + 2 t + 2 u \geq 60 \\2 s + t + 3 u \geq 60 \\s \geq 0 , t \geq 0 , u \geq 0\end{array}

A) c=140c = 140 , s=0s = 0 , t=20t = 20 , u=0u = 0
B) c=80c = 80 , s=20s = 20 , t=0t = 0 , u=0u = 0
C) c=220c = 220 , s=20s = 20 , t=20t = 20 , u=0u = 0
D) c=260c = 260 , s=20s = 20 , t=0t = 0 , u=20u = 20
E) c=320c = 320 , s=0s = 0 , t=20t = 20 , u=20u = 20
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
7
Solve the games with the given payoff matrix. P=[112212121]P = \left[ \begin{array} { c c c } - 1 & 1 & 2 \\2 & - 1 & - 2 \\1 & 2 & - 1\end{array} \right]

A) C=[592929]C = \left[ \begin{array} { l } \frac { 5 } { 9 } \\\frac { 2 } { 9 } \\\frac { 2 } { 9 }\end{array} \right] , R=[71811859]R = \left[ \begin{array} { l l l } \frac { 7 } { 18 } & \frac { 1 } { 18 } & \frac { 5 } { 9 }\end{array} \right] , e=8518e = - \frac { 85 } { 18 }
B) C=[592929]C = \left[ \begin{array} { l } \frac { 5 } { 9 } \\\frac { 2 } { 9 } \\\frac { 2 } { 9 }\end{array} \right] , R=[71811859]R = \left[ \begin{array} { l l l } \frac { 7 } { 18 } & \frac { 1 } { 18 } & \frac { 5 } { 9 }\end{array} \right] , e=3118e = - \frac { 31 } { 18 }
C) C=[59718118]C = \left[ \begin{array} { c } \frac { 5 } { 9 } \\\frac { 7 } { 18 } \\\frac { 1 } { 18 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=518e = \frac { 5 } { 18 }
D) C=[11871859]C = \left[ \begin{array} { c } \frac { 1 } { 18 } \\\frac { 7 } { 18 } \\\frac { 5 } { 9 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=8518e = - \frac { 85 } { 18 }
E) C=[51851849]C = \left[ \begin{array} { c } \frac { 5 } { 18 } \\\frac { 5 } { 18 } \\\frac { 4 } { 9 }\end{array} \right] , R=[59118718]R = \left[ \begin{array} { l l l } \frac { 5 } { 9 } & \frac { 1 } { 18 } & \frac { 7 } { 18 }\end{array} \right] , e=3118e = - \frac { 31 } { 18 }
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
8
Minimize p=6a+4bp = 6 a + 4 b subject to the following constraints.
a+b106a+b30a0,b0\begin{array} { l } a + b \geq 10 \\6 a + b \geq 30 \\a \geq 0 , b \geq 0\end{array}

A) a=4a = 4 , b=6b = 6 , p=48p = 48
B) a=10a = 10 , b=0b = 0 , p=60p = 60
C) a=0a = 0 , b=30b = 30 , p=180p = 180
D) a=0a = 0 , b=10b = 10 , p=40p = 40
E) a=6a = 6 , b=6b = 6 , p=60p = 60
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
9
Oz makes lion food out of giraffe and gazelle meat. Giraffe meat has 18 grams of protein and 36 grams of fat per pound, while gazelle meat has 36 grams of protein and 18 grams of fat per pound. A batch of lion food must contain at least 36,000 grams of protein and 54,000 grams of fat. Giraffe meat costs $4/pound and gazelle meat costs $8/pound. How many pounds of each should go into each batch of lion food in order to minimize costs What are the shadow costs of protein and fat Use the rounded numbers of pounds in your calculations. ?

A)1,333 pounds of giraffe meat and 333 pounds of gazelle, 22 cents per gram of protein and 15 cents per gram of fat
B) 333 pounds of giraffe meat and 333 pounds of gazelle, 15 cents per gram of protein and 15 cents per gram of fat
C) 1,333 pounds of giraffe meat and 333 pounds of gazelle, 15 cents per gram of protein and 22 cents per gram of fat
D) 1,333 pounds of giraffe meat and 333 pounds of gazelle, 22 cents per gram of protein and 22 cents per gram of fat
E) 333 pounds of giraffe meat and 1,333 pounds of gazelle, 22 cents per gram of protein and 15 cents per gram of fat
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
10
Solve the standard minimization problem using duality.  Minimize c=8s+7t+8us+t+u1002s+t50 subject to t+u50s0,t0,u0\begin{array} { l } \text { Minimize } & { c = 8 s + 7 t + 8 u } \\&s + t + u \geq 100 \\&2 s + t \geq 50 \\\text { subject to } &t + u \geq 50 \\&s \geq 0 , t \geq 0 , u \geq 0 \\\end{array}

A) c=800c = 800 , s=100s = 100 , t=0t = 0 , u=0u = 0
B) c=800c = 800 , s=0s = 0 , t=0t = 0 , u=100u = 100
C) c=700c = 700 , s=0s = 0 , t=100t = 100 , u=0u = 0
D) c=350c = 350 , s=0s = 0 , t=50t = 50 , u=0u = 0
E) c=400c = 400 , s=50s = 50 , t=0t = 0 , u=0u = 0
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
11
Write down (without solving) the dual LP problem.
Minimize c=s+6t+uc = s + 6 t + u subject to
9st+v3,000uv1,000s+t500s0,t0,u0,v0\begin{array} { l } 9 s - t + v \geq 3,000 \\u - v \geq 1,000 \\s + t \geq 500 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

A)maximize p=x+6y+zp = x + 6 y + z subject to 9xy+w3,000zw1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x - y + w \geq 3,000 \\z - w \geq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

B) maximize p=3,000x+1,000y+500zp = 3,000 x + 1,000 y + 500 z subject to
9x+z1x+z6y1xy0x0,y0,z0\begin{array} { l } 9 x + z \geq 1 \\- x + z \geq 6 \\y \geq 1 \\x - y \geq 0 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

C) maximize p=3,000x+1,000y+500zp = 3,000 x + 1,000 y + 500 z subject to

9x+z1x+z6y1xy0x0,y0,z0\begin{array} { l } 9 x + z \leq 1 \\- x + z \leq 6 \\y \leq 1 \\x - y \leq 0 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

D) maximize p=x+6y+zp = x + 6 y + z subject to
9xy+w3,000zw1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x - y + w \leq 3,000 \\z - w \leq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

E) maximize p=x+6y+zp = x + 6 y + z subject to

9x+y+w3,000z+w1,000x+y500x0,y0,z0,w0\begin{array} { l } 9 x + y + w \geq 3,000 \\z + w \geq 1,000 \\x + y \geq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
12
Solve the standard minimization problem using duality.
Minimize C=18s+29tC = 18 s + 29 t
Subject to 3s+2t606s+3t60s0,t0\begin{array} { l } 3 s + 2 t \geq 60 \\6 s + 3 t \geq 60 \\s \geq 0 , t \geq 0\end{array}

A) C=360C = 360 , s=20s = 20 , t=0t = 0
B) C=580C = 580 , s=0s = 0 , t=20t = 20
C) C=290C = 290 , s=0s = 0 , t=10t = 10
D) C=180C = 180 , s=10s = 10 , t=0t = 0
E) C=650C = 650 , s=20s = 20 , t=10t = 10
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
13
The Enormous State University's Business School is buying computers. The school has two models to choose from. Each first model comes with 400 MB of memory and 80 GB of disk space, while each second model has 300 MB of memory and 100 GB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 48,000 MB of memory and at least 12,800 GB of disk space. If both models cost $4,400 each, how many of each should the school buy to keep the cost as low as possible What are the shadow costs of memory and disk space

A)80 first models and 60 second models, $ 776\frac { 77 } { 6 } per MB and $ 3858\frac { 385 } { 8 } per GB
B) 60 first models and 80 second models, $ 3858\frac { 385 } { 8 } per MB and $ 3858\frac { 385 } { 8 } per GB
C) 60 first models and 80 second models, $ 776\frac { 77 } { 6 } per MB and $ 3858\frac { 385 } { 8 } per GB
D) 60 first models and 80 second models, $ 776\frac { 77 } { 6 } per MB and $ 776\frac { 77 } { 6 } per GB
E) 80 first models and 60 second models, $ 3858\frac { 385 } { 8 } per MB and $ 776\frac { 77 } { 6 } per GB
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
14
We are to minimize p=3a+2bp = 3 a + 2 b subject to the following constraints. a+b43a+b6a,b0\begin{array} { l } a + b \geq 4 \\3 a + b \geq 6 \\a , b \geq 0\end{array}
After using the simplex method for dual problem to arrive at the tableau below, what is the maximum value for pp
X y s t p
[011212012101232032001319]\left[ \begin{array} { c c c c c } 0 & 1 & \frac { 1 } { 2 } & - \frac { 1 } { 2 } & 0 \\\frac { 1 } { 2 } & & & \\1 & 0 & - \frac { 1 } { 2 } & \frac { 3 } { 2 } & 0 \\\frac { 3 } { 2 } & & & & \\0 & 0 & 1 & 3 & 1 \\9 & & & &\end{array} \right]

A)9
B) 3
C) 5.5
D) 12\frac { 1 } { 2 }
E) 32\frac { 3 } { 2 }
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
15
Solve the games with the given payoff matrix. P=[352324433]P = \left[ \begin{array} { l l l } - 3 & - 5 & - 2 \\- 3 & - 2 & - 4 \\- 4 & - 3 & - 3\end{array} \right]

A) C=[121613]C = \left[ \begin{array} { l } \frac { 1 } { 2 } \\\frac { 1 } { 6 } \\\frac { 1 } { 3 }\end{array} \right] , R=[161213]R = \left[ \begin{array} { l l l } \frac { 1 } { 6 } & \frac { 1 } { 2 } & \frac { 1 } { 3 }\end{array} \right] , e=196e = - \frac { 19 } { 6 }
B) C=[161312]C = \left[ \begin{array} { l } \frac { 1 } { 6 } \\\frac { 1 } { 3 } \\\frac { 1 } { 2 }\end{array} \right] , R=[131216]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 2 } & \frac { 1 } { 6 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
C) C=[161312]C = \left[ \begin{array} { l } \frac { 1 } { 6 } \\\frac { 1 } { 3 } \\\frac { 1 } { 2 }\end{array} \right] , R=[131216]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 2 } & \frac { 1 } { 6 }\end{array} \right] , e=196e = - \frac { 19 } { 6 }
D) C=[121613]C = \left[ \begin{array} { l } \frac { 1 } { 2 } \\\frac { 1 } { 6 } \\\frac { 1 } { 3 }\end{array} \right] , R=[161213]R = \left[ \begin{array} { l l l } \frac { 1 } { 6 } & \frac { 1 } { 2 } & \frac { 1 } { 3 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
E) C=[131216]C = \left[ \begin{array} { l } \frac { 1 } { 3 } \\\frac { 1 } { 2 } \\\frac { 1 } { 6 }\end{array} \right] , R=[131612]R = \left[ \begin{array} { l l l } \frac { 1 } { 3 } & \frac { 1 } { 6 } & \frac { 1 } { 2 }\end{array} \right] , e=196e = \frac { 19 } { 6 }
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
16
Ruff makes dog food out of chicken and grain. Chicken has 10 grams of protein and 5 grams of fat/ounce, and grain has 2 grams of protein and 2 grams of fat per ounce. A bag of dog food must contain at least 200 grams of protein and at least 50 grams of fat. If chicken costs 15 cents per ounce and grain costs 2 cents per ounce, how many ounces of each should Ruff use in each bag of dog food in order to minimize cost What are the shadow costs of protein and fat ?

A)100 oz of chicken and no grain, 1 cents per gram of protein and 1 cents per gram of fat
B) 200 oz of chicken and no grain, 0 cents per gram of protein and 1 cents per gram of fat
C) 100 oz of chicken and no grain, 0.5 cents per gram of protein and 0.5 cents per gram of fat
D) 200 oz of grain and no chicken, 0.5 cents per gram of protein and 0.5 cents per gram of fat
E) 100 oz of grain and no chicken, 1 cents per gram of protein and 0 cents per gram of fat
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
17
Solve the standard minimization problem using duality.
Minimize c=0.7s+0.3tc = 0.7 s + 0.3 t
Subject to 30s+20t6000.1s+0.4t40.2s+0.3t4.5s0.t0\begin{array} { l } 30 s + 20 t \geq 600 \\0.1 s + 0.4 t \geq 4 \\0.2 s + 0.3 t \geq 4.5 \\s \geq 0 . t \geq 0\end{array}

A) c=9,s=30,t=0c = 9 , s = 30 , t = 0
B) c=21,s=0,t=30c = 21 , s = 0 , t = 30
C) c=30,s=30,t=30c = 30 , s = 30 , t = 30
D) c=9,s=0,t=30c = 9 , s = 0 , t = 30
E) c=21,s=30,t=0c = 21 , s = 30 , t = 0
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
18
Solve the games with the given payoff matrix. [1120120101102022]\left[ \begin{array} { c c c c } 1 & - 1 & 2 & 0 \\1 & 2 & 0 & 1 \\0 & 1 & 1 & 0 \\2 & 0 & - 2 & 2\end{array} \right]

A) C=[132300]C = \left[ \begin{array} { c } \frac { 1 } { 3 } \\\frac { 2 } { 3 } \\0 \\0\end{array} \right] , R=[013023]R = \left[ \begin{array} { l l l l } 0 & \frac { 1 } { 3 } & 0 & \frac { 2 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
B) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[132300]R = \left[ \begin{array} { l l l l } \frac { 1 } { 3 } & \frac { 2 } { 3 } & 0 & 0\end{array} \right] , e=23e = \frac { 2 } { 3 }
C) C=[132300]C = \left[ \begin{array} { c } \frac { 1 } { 3 } \\\frac { 2 } { 3 } \\0 \\0\end{array} \right] , R=[001323]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 1 } { 3 } & \frac { 2 } { 3 }\end{array} \right] , e=23e = \frac { 2 } { 3 }
D) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[001323]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 1 } { 3 } & \frac { 2 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
E) C=[002313]C = \left[ \begin{array} { c } 0 \\0 \\\frac { 2 } { 3 } \\\frac { 1 } { 3 }\end{array} \right] , R=[002313]R = \left[ \begin{array} { l l l l } 0 & 0 & \frac { 2 } { 3 } & \frac { 1 } { 3 }\end{array} \right] , e=23e = - \frac { 2 } { 3 }
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
19
We are to minimize p=3a+2bp = 3 a + 2 b subject to the following constraints.
{a+b43a+b6a,b0}\left\{ \begin{array} { c } a + b \geq 4 \\3 a + b \geq 6 \\a , b \geq 0\end{array} \right\}
What is the dual problem in matrix form

A) [114316320]\left[ \begin{array} { l l l } 1 & 1 & 4 \\3 & 1 & 6 \\3 & 2 & 0\end{array} \right]
B) [114316110]\left[ \begin{array} { l l l } 1 & 1 & 4 \\3 & 1 & 6 \\1 & 1 & 0\end{array} \right]
C) [114316320]\left[ \begin{array} { c c c } 1 & 1 & 4 \\3 & 1 & 6 \\- 3 & - 2 & 0\end{array} \right]
D) [133112460]\left[ \begin{array} { c c c } 1 & 3 & - 3 \\1 & 1 & - 2 \\4 & 6 & 0\end{array} \right]
E) [133112460]\left[ \begin{array} { l l l } 1 & 3 & 3 \\1 & 1 & 2 \\4 & 6 & 0\end{array} \right]
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
20
Write down (without solving) the dual LP problem.
Maximize p=x+y+z+wp = x + y + z + w subject to
x+y+z9y+z+w7x+z+w2x+y+w4x0,y0,z0,w0\begin{array} { l } x + y + z \leq 9 \\y + z + w \leq 7 \\x + z + w \leq 2 \\x + y + w \leq 4 \\x \geq 0 , y \geq 0 , z \geq 0 , w \geq 0\end{array}

A)minimize c=9s+7t+2u+4vc = 9 s + 7 t + 2 u + 4 v subject to s+u+v1s+t+v1s+t+u1t+u+v1s0,t0,u0,v0\begin{array} { l } s + u + v \leq 1 \\s + t + v \leq 1 \\s + t + u \leq 1 \\t + u + v \leq 1 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

B) minimize c=s+t+u+vc = s + t + u + v subject to
s+t+u7t+u+v6s+u+v3s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \leq 7 \\t + u + v \leq 6 \\s + u + v \leq 3 \\s + t + v \leq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

C) minimize c=s+t+u+vc = s + t + u + v subject to s+t+u9t+u+v7s+u+v2s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \geq 9 \\t + u + v \geq 7 \\s + u + v \geq 2 \\s + t + v \geq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

D) minimize c=s+t+u+vc = s + t + u + v subject to

s+t+u9t+u+v7s+u+v2s+t+v4s0,t0,u0,v0\begin{array} { l } s + t + u \geq 9 \\t + u + v \geq 7 \\s + u + v \geq 2 \\s + t + v \geq 4 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}

E) minimize c=9s+7t+2u+4vc = 9 s + 7 t + 2 u + 4 v subject to
s+u+v1s+t+v1s+t+u1t+u+v1s0,t0,u0,v0\begin{array} { l } s + u + v \leq 1 \\s + t + v \leq 1 \\s + t + u \leq 1 \\t + u + v \leq 1 \\s \geq 0 , t \geq 0 , u \geq 0 , v \geq 0\end{array}
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
21
Federal Rent-a-Car is putting together a new fleet. It is considering package offers from three car manufacturers. Fred Motors is offering 5 small cars, 5 medium cars, and 10 large cars for $500,000. Admiral Motors is offering 5 small, 10 medium, and 5 large cars for $400,000. Chrysalis is offering 10 small, 5 medium, and 5 large cars for $300,000. Federal would like to buy at least 600 small cars, at least 500 medium cars, and at least 600 large cars. How many packages should it buy from each car maker to keep the total cost as small as possible What will be the total cost ?

A)15 packages of Fred Motors, 35 packages of Admiral Motors, and 15 packages of Chrysalis, the total cost is $26,000,000
B) 35 packages of Fred Motors, 15 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $34,000,000
C) 35 packages of Fred Motors, 35 packages of Admiral Motors, and 15 packages of Chrysalis, the total cost is $36,000,000
D) 15 packages of Fred Motors, 35 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $32,000,000
E) 15 packages of Fred Motors, 15 packages of Admiral Motors, and 35 packages of Chrysalis, the total cost is $24,000,000
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
22
Write down (without solving) the dual LP problem.

Maximize Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas. subject to
Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas.
Use the letters s, t​, u, and v in the indicated order.

Minimize Write down (without solving) the dual LP problem. ​ Maximize   subject to ​   ​ Use the letters s, t​, u, and v in the indicated order. ​ Minimize   __________ subject to the constraints. ​ Please enter the inequalities, separated by commas. __________ subject to the constraints.

Please enter the inequalities, separated by commas.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
23
The Enormous State University's Business School is buying computers. The school has two models to choose from. Each first model comes with 400 MB of memory and 80 GB of disk space, while each second model has 300 MB of memory and 100 GB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 48,000 MB of memory and at least 12,800 GB of disk space. If both models cost $800 each, how many of each should the school buy to keep the cost as low as possible

__________ first model(s) and __________ second model(s).

What are the shadow costs of memory and disk space

Please, enter first the shadow cost of MB and then the shadow cost of GB as improper fractions of integers without units. Separate your answers by a comma.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
24
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   ___________ ___________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
25
Solve the standard minimization problem using duality.

Minimize c=6s+2tc = 6 s + 2 t
subject to s+t96s+t24s0,t0\begin{array} { l } s + t \geq 9 \\6 s + t \geq 24 \\s \geq 0 , t \geq 0\end{array}
After using the simplex method for dual problem to arrive at the tableau below, what is the maximum value for c
xyzwc\quad \quad x\quad y\quad z \quad w \quad c
[0115150451015650650036130]\left[ \begin{array} { c c c c c } 0&1&\frac{1}{5}&\frac{1}{-5}&0\\\frac{4}{5}\\1&0&\frac{1}{-5}&\frac{6}{5}&0\\\frac{6}{5}\\0&0&3&6&1\\30\end{array} \right]
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
26
Ruff makes dog food out of chicken and grain. Chicken has 10 grams of protein and 5 grams of fat per ounce, and grain has 2 grams of protein and 2 grams of fat per ounce. A bag of dog food must contain at least 200 grams of protein and at least 100 grams of fat. If chicken costs 25 cents/ounce and grain costs 1 cents/ounce, how many ounces of each should Ruff use in each bag of dog food in order to minimize cost

__________ oz of chicken and __________ oz of grain.

What are the shadow costs of protein and fat

__________ cent(s) per gram of protein and __________ cent(s) per gram of fat.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
27
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________ _________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________ _________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   _________ ​   _________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
28
Oz makes lion food out of giraffe and gazelle meat. Giraffe meat has 18 grams of protein and 36 grams of fat per pound, while gazelle meat has 36 grams of protein and 18 grams of fat per pound. A batch of lion food must contain at least 36,000 grams of protein and 54,000 grams of fat. Giraffe meat costs $2/pound and gazelle meat costs $4/pound. How many pounds of each should go into each batch of lion food in order to minimize costs Please round the answers to the nearest pound.

__________ pound(s) of giraffe meat and __________ pound(s) of gazelle.

What are the shadow costs of protein and fat Please round the answers to the nearest cent.

__________ cents per gram of protein and __________ cents per gram of fat.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
29
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
30
Each serving of Gerber Mixed Cereal for Baby contains 60 calories and no Vitamin C. Each serving of Gerber Mango Tropical Fruit Dessert contains 80 calories and 45 percent of the U.S. Recommended Daily Allowance (RDA) of Vitamin C for infants. Each serving of Gerber Apple Banana Juice contains 60 calories and 120 percent of the RDA of Vitamin C for infants. The cereal costs 10 cents per serving, the dessert costs 53 cents per serving, and the juice costs 27 cents per serving. If you want to provide your child with at least 120 calories and at least 120 percent of the RDA of Vitamin C, how can you do so at the least cost ?

A)1 serving of cereal, 1 serving of juice, and no dessert
B) 1 serving of dessert, 1 serving of juice, and no cereal
C) 1 serving of cereal, 3 servings of dessert, and no juice
D) 3 servings of dessert, 1 serving of juice, and no cereal
E) 1 serving of cereal, 1 serving of dessert, and no juice
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
31
Write down (without solving) the dual LP problem.

Minimize Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas. subject to
Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas.
Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem.

Maximize Write down (without solving) the dual LP problem. ​ Minimize   subject to ​   ​ Use the letters x, y, z, and w in the indicated order. Please, use the numbers in the expression for ​p in order they come in the given LP problem. ​ Maximize   __________ subject to the constraints. ​ Please enter the inequalities, separated with commas. __________ subject to the constraints.

Please enter the inequalities, separated with commas.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
32
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
33
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
34
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​  Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
35
Solve the standard minimization problem using duality. Minimize Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________ subject to the following.
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. Minimize   subject to the following. ​   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
36
The Miami Beach City Council has offered to subsidize hotel development in Miami Beach, and it is hoping for at least two hotels with a total capacity of at least 2,600. Suppose that you are a developer interested in taking advantage of this offer by building a small group of hotels in Miami Beach. You are thinking of three prototypes: a convention-style hotel with 500 rooms costing $100 million, a vacation-style hotel with 200 rooms costing $20 million, and a small motel with 50 rooms costing $4 million. The City Council will approve your plans, provided you build at least one convention-style hotel and no more than two small motels. How many of each type of hotel should you build to satisfy the city council's wishes and stipulations while minimizing your total cost ?

A)1 convention-style hotel, 13 vacation-style hotels, and 2 small motels
B) 1 convention-style hotel, 1 vacation-style hotel, and 2 small motels
C) 2 convention-style hotels, 10 vacation-style hotels, and 1 small motel
D) 2 convention-style hotels, 1 vacation-style hotel, and 1 small motel
E) 1 convention-style hotel, 10 vacation-style hotels, and 2 small motels
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
37
Write down ( without solving ) the dual LP problem.

Minimize p=5a+4bp = 5 a + 4 b subject to
{a+b85a+b20a0,b0}\left\{ \begin{array} { c } a + b \geq 8 \\5 a + b \geq 20 \\a \geq 0 , b \geq 0\end{array} \right\}
What is the dual problem in matrix form
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
38
Solve the standard minimization problem using duality.
Minimize Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________ subject to Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. Minimize   subject to   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
39
We return to your exploits coordinating distribution for the Tubular Ride Boogie Board Company. You will recall that the company has manufacturing plants in Tucson, Arizona and Toronto, Ontario, and you have been given the job of coordinating distribution of their latest model, the Gladiator, to their outlets in Honolulu and Venice Beach. The Tucson plant can manufacture up to 620 boards per week, while the Toronto plant, beset by labor disputes, can produce no more than 410 Gladiator boards per week. The outlet in Honolulu orders 480 Gladiator boards per week, while Venice Beach orders 510 boards per week. Transportation costs are as follows: Tucson to Honolulu: $10 per board; Tucson to Venice Beach: $5 per board; Toronto to Honolulu: $20 per board; Toronto to Venice Beach: $10 per board. Your manager has said that you are to be sure to fill all orders and ship the boogie boards at a minimum total transportation cost. But you have just been notified that workers at the Toronto boogie board plant have gone on strike, resulting in a total work stoppage. You are to come up with a revised delivery schedule by tomorrow with the understanding that the Tucson plant can push production to a maximum of 880 boards per week. Can you devise a delivery schedule with these accommodations in mind ?

A)no
B) yes
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
40
Solve the standard minimization problem using duality.

Minimize Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________
subject to Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Solve the standard minimization problem using duality. ​ Minimize   ​ subject to   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
41
Minimize Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ subject to the following (using the simplex method).
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Minimize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
42
Minimize c=5.45x+y+1.5z+wc = 5.45 x + y + 1.5 z + w
Subject to
5.12xy+w1,500z+w1,5001.12x+y1,000x0,y0,z0\begin{aligned}5.12 x - y + w & \geq 1,500 \\z + w & \geq 1,500 \\1.12 x + y & \leq 1,000 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=1,500c = 1,500 , x=0x = 0 , y=1,500y = 1,500 , z=0z = 0 , w=0w = 0
B) c=1,500c = 1,500 , x=0x = 0 , y=0y = 0 , z=0z = 0 , w=1,500w = 1,500
C) c=1,500c = 1,500 , x=0x = 0 , y=0y = 0 , z=1,500z = 1,500 , w=0w = 0
D) c=8,175c = 8,175 , x=1,500x = 1,500 , y=0y = 0 , z=0z = 0 , w=0w = 0
E) c=2,250c = 2,250 , x=0x = 0 , y=0y = 0 , z=1,500z = 1,500 , w=0w = 0
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
43
Minimize c=4x+7yc = 4 x + 7 y
Subject to
8x+3y302x+3y12x0,y0\begin{array} { l } 8 x + 3 y \geq 30 \\2 x + 3 y \geq 12 \\x \geq 0 , y \geq 0\end{array}

A) c=24c = 24 , x=6x = 6 , y=0y = 0
B) c=21c = 21 , x=0x = 0 , y=3y = 3
C) c=6c = 6 , x=3x = 3 , y=0y = 0
D) c=42c = 42 , x=0x = 0 , y=6y = 6
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
44
Minimize c=2x+y+3zc = 2 x + y + 3 z
Subject to
x+y+z1502x+y30y+z40x0,y0,z0\begin{aligned}x + y + z & \geq 150 \\2 x + y & \geq 30 \\y + z & \geq 40 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=450c = 450 , x=0x = 0 , y=0y = 0 , z=150z = 150
B) c=300c = 300 , x=150x = 150 , y=0y = 0 , z=0z = 0
C) c=150c = 150 , x=0x = 0 , y=150y = 150 , z=0z = 0
D) c=30c = 30 , x=0x = 0 , y=30y = 30 , z=0z = 0
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
45
Maximize
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
subject to
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________

If there is no solution, do not fill the fields.
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
46
Maximize p=2x+3y+z+4wp = 2 x + 3 y + z + 4 w
Subject to
x+y+z+w402x+yzw10x+y+z+w10x0,y0,z0,w0\begin{aligned}x + y + z + w & \leq 40 \\2 x + y - z - w & \geq 10 \\x + y + z + w & \geq 10 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}

A) p=65p = 65 , x=25x = 25 , y=0y = 0 , z=15z = 15 , w=0w = 0
B) p=135p = 135 , x=0x = 0 , y=25y = 25 , z=0z = 0 , w=15w = 15
C) p=130p = 130 , x=0x = 0 , y=15y = 15 , z=0z = 0 , w=15w = 15
D) p=55p = 55 , x=15x = 15 , y=0y = 0 , z=25z = 25 , w=0w = 0
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
47
Your small farm encompasses 100 acres, and you are planning to grow tomatoes, lettuce, and carrots in the coming planting season. Fertilizer costs per acre are: $5 for tomatoes, $4 for lettuce, and $2 for carrots. Based on past experience, you estimate that each acre of tomatoes will require an average of 4 hours of labor per week, while tending to lettuce and carrots will each require an average of 2 hours per week. You estimate a profit of $2,000 for each acre of tomatoes, $1,500 for each acre of lettuce and $500 for each acre of carrots. You would like to spend at least $300 on fertilizer (your niece owns the company that manufactures it) and your farm laborers can supply up to 500 hours per week. How many acres of each crop should you plant to maximize total profits In this event, will you be using all 100 acres of your farm ?

A)plant 100 acres of tomatoes and no other crops, you will be using all 100 acres of your farm
B) plant 60 acres of tomatoes and no other crops, you will not be using all 100 acres of your farm
C) plant 100 acres of lettuce and no other crops, you will be using all 100 acres of your farm
D) plant 40 acres of carrots and no other crops, you will be using all 100 acres of your farm
E) plant 20 acres of lettuce and no other crops, you will be using all 100 acres of your farm
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
48
Minimize c=2.2x+y+3.3zc = 2.2 x + y + 3.3 z
Subject to
x+1.5y+1.2z1502x+1.5y401.5y+1.1z40x0,y0,z0\begin{aligned}x + 1.5 y + 1.2 z & \geq 150 \\2 x + 1.5 y & \geq 40 \\1.5 y + 1.1 z & \geq 40 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}
Round all answers to two decimal places.

A) c=320c = 320 , x=100x = 100 , y=100y = 100 , z=0z = 0
B) c=330c = 330 , x=0x = 0 , y=0y = 0 , z=100z = 100
C) c=100c = 100 , x=0x = 0 , y=100y = 100 , z=0z = 0
D) c=550c = 550 , x=100x = 100 , y=0y = 0 , z=100z = 100
E) c=220c = 220 , x=100x = 100 , y=0y = 0 , z=0z = 0
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
49
Maximize p=x+2yp = x + 2 y
Subject to
x+y20y82xy0x0,y0\begin{aligned}x + y & \leq 20 \\y & \geq 8 \\2 x - y & \geq 0 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=80p = 80 , x=40x = 40 , y=20y = 20
B) p=100p = 100 , x=20x = 20 , y=40y = 40
C) p=803p = \frac { 80 } { 3 } , x=403x = \frac { 40 } { 3 } , y=203y = \frac { 20 } { 3 }
D) p=1003p = \frac { 100 } { 3 } , x=203x = \frac { 20 } { 3 } , y=403y = \frac { 40 } { 3 }
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
50
Minimize c=50x+50y+11zc = 50 x + 50 y + 11 z
Subject to
2x+z82x+yz43x+yz6x0,y0,z0\begin{aligned}2 x + z & \geq 8 \\2 x + y - z & \geq 4 \\3 x + y - z & \leq 6 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) c=399c = 399 , x=5x = 5 , y=1y = 1 , z=9z = 9
B) c=494c = 494 , x=5x = 5 , y=4y = 4 , z=4z = 4
C) c=161c = 161 , x=2x = 2 , y=1y = 1 , z=1z = 1
D) c=344c = 344 , x=2x = 2 , y=4y = 4 , z=4z = 4
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
51
Maximize p=12x+10yp = 12 x + 10 y
Subject to
x+y40x1x+2y0x0,y0\begin{aligned}x + y & \leq 40 \\x & \geq 1 \\- x + 2 y & \geq 0 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=1,360p = 1,360 , x=80x = 80 , y=40y = 40
B) p=5603p = \frac { 560 } { 3 } , x=403x = \frac { 40 } { 3 } , y=803y = \frac { 80 } { 3 }
C) p=1,3603,x=803,y=403p = \frac { 1,360 } { 3 } , x = \frac { 80 } { 3 } , y = \frac { 40 } { 3 }
D) p=1,280p = 1,280 , x=40x = 40 , y=80y = 80
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
52
Minimize c=5x+y+z+2wc = 5 x + y + z + 2 w
Subject to
5xy+w1,000z+w2,000x+y500x0,y0,z0,w0\begin{aligned}5 x - y + w & \geq 1,000 \\z + w & \leq 2,000 \\x + y & \leq 500 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}

A) c=600c = 600 , x=0x = 0 , y=200y = 200 , z=200z = 200 , w=200w = 200
B) c=1,600c = 1,600 , x=200x = 200 , y=200y = 200 , z=200z = 200 , w=200w = 200
C) c=1,000c = 1,000 , x=200x = 200 , y=0y = 0 , z=0z = 0 , w=0w = 0
D) c=200c = 200 , x=0x = 0 , y=200y = 200 , z=0z = 0 , w=0w = 0
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
53
Fancy Pineapple produces pineapple juice and canned pineapple rings. This year the company anticipates a demand of at least 10,000 pints of pineapple juice and 500 cans of pineapple rings. Each pint of pineapple juice requires 2 pineapples, and each can of pineapple rings requires 1 pineapple. The company anticipates using at least 5,000 pineapples for these products. Each pint of pineapple juice costs the company 20 cents to produce, and each can of pineapple rings costs 50 cents to produce. How many pints of pineapple juice and cans of pineapple rings should Fancy Pineapple produce to meet the demand and minimize total costs ?

A)25,000 pints of pineapple juice and 500 cans of pineapple rings
B) 500 pints of pineapple juice and 10,000 cans of pineapple rings
C) 1,000 pints of pineapple juice and 25,000 cans of pineapple rings
D) 10,000 pints of pineapple juice and 500 cans of pineapple rings
E) 25,000 pints of pineapple juice and 1,000 cans of pineapple rings
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
54
Maximize p=7x+9yp = 7 x + 9 y subject to the following (using the simplex method).
9x+8y144x+y88x+9y144x0,y0\begin{aligned}9 x + 8 y & \leq 144 \\x + y & \geq 8 \\8 x + 9 y & \leq 144 \\x \geq 0 , y & \geq 0\end{aligned}

A) p=112p = 112 , x=16x = 16 , y=0y = 0
B) p=144p = 144 , x=0x = 0 , y=16y = 16
C) p=56p = 56 , x=8x = 8 , y=0y = 0
D) p=72p = 72 , x=0x = 0 , y=8y = 8
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
55
Maximize Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ subject to the following (using the simplex method).
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Maximize   subject to the following (using the simplex method). ​   ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
56
The political pollster Canter is preparing for a national election. It would like to poll at least 2,400 Democrats and 2,400 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost $40 each to produce and mail, mailings to the Midwest cost $60 each, and mailings to the West Coast cost $50 each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost What will it cost ?

A)16 mailings to the East Coast, none to the Midwest, 16 to the West Coast, the cost is $1,440
B) No mailings to the East Coast, 24 to the Midwest, none to the West Coast, the cost is $1,440
C) 24 mailings to the East Coast, none to the Midwest, 24 to the West Coast, another solution resulting in the same cost is no mailings to the East Coast, 16 to the Midwest, none to the West Coast, the cost is $1,440
D) 16 mailings to the East Coast, none to the Midwest, 16 to the West Coast, another solution resulting in the same cost is no mailings to the East Coast, 24 to the Midwest, none to the West Coast, the cost is $1,440
E) No mailings to the East Coast, 16 to the Midwest, none to the West Coast, the cost is $1,440
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
57
Minimize c=50x+11y+50zc = 50 x + 11 y + 50 z
Subject to
3x+z63x+yz64x+yz8x0,y0,z0\begin{array} { r } 3 x + z \geq 6 \\3 x + y - z \geq 6 \\4 x + y - z \leq 8 \\x \geq 0 , y \geq 0 , z \geq 0\end{array}

A) c=400c = 400 , x=8x = 8 , y=0y = 0 , z=0z = 0
B) c=716c = 716 , x=8x = 8 , y=6y = 6 , z=5z = 5
C) c=88c = 88 , x=0x = 0 , y=0y = 0 , z=8z = 8
D) c=100c = 100 , x=2x = 2 , y=0y = 0 , z=0z = 0
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
58
Maximize p=2x+3y+1.1z+4wp = 2 x + 3 y + 1.1 z + 4 w
Subject to
1.2x+y+z+w422.2x+yzw151.2x+y+z+1.2w11.5x0,y0,z0,w0\begin{aligned}1.2 x + y + z + w & \leq 42 \\2.2 x + y - z - w & \geq 15 \\1.2 x + y + z + 1.2 w & \geq 11.5 \\x \geq 0 , y \geq 0 , z \geq 0 , w & \geq 0\end{aligned}
Round all answers to two decimal places.

A) p=111p = 111 , x=28.5x = 28.5 , y=0y = 0 , z=0z = 0 , w=13.5w = 13.5
B) p=139.5p = 139.5 , x=0x = 0 , y=28.5y = 28.5 , z=0z = 0 , w=13.5w = 13.5
C) p=154.5p = 154.5 , x=0x = 0 , y=13.5y = 13.5 , z=0z = 0 , w=28.5w = 28.5
D) p=71.85p = 71.85 , x=28.5x = 28.5 , y=0y = 0 , z=13.5z = 13.5 , w=0w = 0
E) p=100.35p = 100.35 , x=0x = 0 , y=28.5y = 28.5 , z=13.5z = 13.5 , w=0w = 0
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
59
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
60
Maximize p=3x+5y+zp = 3 x + 5 y + z
Subject to
2x6y+2z20x+3y4z11x0,y0,z0\begin{aligned}2 x - 6 y + 2 z & \leq 20 \\x + 3 y - 4 z & \leq 11 \\x \geq 0 , y \geq 0 , z & \geq 0\end{aligned}

A) p=116p = 116 , x=9x = 9 , y=14y = 14 , z=13z = 13
B) p=116p = 116 , x=13x = 13 , y=9y = 9 , z=14z = 14
C) p=116p = 116 , x=14x = 14 , y=9y = 9 , z=13z = 13
D) p=116p = 116 , x=14x = 14 , y=13y = 13 , z=9z = 9
E) no solution
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
61
The political pollster Canter is preparing for a national election. It would like to poll at least 900 Democrats and 900 Republicans. Each mailing to the East Coast gets responses from 100 Democrats and 50 Republicans. Each mailing to the Midwest gets responses from 100 Democrats and 100 Republicans. And each mailing to the West Coast gets responses from 50 Democrats and 100 Republicans. Mailings to the East Coast cost $40 each to produce and mail, mailings to the Midwest cost $60 each, and mailings to the West Coast cost $50 each. How many mailings should Canter send to each area of the country to get the responses it needs at the least possible cost

__________ mailings to the East Coast, none to the Midwest, and __________ to the West Coast.

Another solution resulting in the same cost is no mailings to the East Coast, __________ to the Midwest, and none to the West Coast.

What will it cost

$__________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
62
You have $600,000 and are considering investing in three municipal bond funds, Pimco, Fidelity Spartan, and Columbia Oregon. You have the following data:  Company  Yield  PNF (Pimco NY) 7% FDMMX (Fidelity Spartan Mass) 5% CMBFX (Columbia Oregon) 4%\begin{array} { | c | c | } \hline \text { Company } & \text { Yield } \\\hline \text { PNF (Pimco NY) } & 7 \% \\\hline \text { FDMMX (Fidelity Spartan Mass) } & 5 \% \\\hline \text { CMBFX (Columbia Oregon) } & 4 \% \\\hline\end{array} Your broker has made the following suggestions:
At least 50 percent of your total investment should be in CMBFX.
No more than 10 percent of your total investment should be in PNF.
How much should you invest in each fund to maximize your anticipated returns while following your broker's advice

A)$60,000 in PNF, $240,000 in FDMMX, and $300,000 in CMBFX
B) $240,000 in PNF, $300,000 in FDMMX, and $60,000 in CMBFX
C) $300,000 in PNF, $240,000 in FDMMX, and $60,000 in CMBFX
D) $300,000 in PNF, $60,000 in FDMMX, and $240,000 in CMBFX
E) $60,000 in PNF, $300,000 in FDMMX, and $240,000 in CMBFX
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
63
The Miami Beach City Council has offered to subsidize hotel development in Miami Beach, and it is hoping for at least two hotels with a total capacity of at least 1,800. Suppose that you are a developer interested in taking advantage of this offer by building a small group of hotels in Miami Beach. You are thinking of three prototypes: a convention-style hotel with 500 rooms costing $100 million, a vacation-style hotel with 200 rooms costing $20 million, and a small motel with 50 rooms costing $4 million. The City Council will approve your plans, provided you build at least one convention-style hotel and no more than two small motels. How many of each type of hotel should you build to satisfy the city council's wishes and stipulations while minimizing your total cost

__________ convention-style hotel(s), __________ vacation-style hotel(s), and __________ small motel(s).

Now assume that the city council will give developers 20 percent of the cost of building new hotels in Miami Beach, up to $70 million. Will the city's $70 million subsidy be sufficient to cover 20 percent of your total costs
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
64
Each serving of Gerber Mixed Cereal for Baby contains 60 calories and no Vitamin C. Each serving of Gerber Mango Tropical Fruit Dessert contains 80 calories and 45 percent of the U.S. Recommended Daily Allowance (RDA) of Vitamin C for infants. Each serving of Gerber Apple Banana Juice contains 60 calories and 120 percent of the RDA of Vitamin C for infants. The cereal costs 10 cents per serving, the dessert costs 53 cents per serving, and the juice costs 27 cents per serving. If you want to provide your child with at least 360 calories and at least 240 percent of the RDA of Vitamin C, how can you do so at the least cost
?
__________ serving(s) of cereal, __________ serving(s) of dessert, and __________ serving(s) of juice.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
65
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
66
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
67
Maximize
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
subject to
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
68
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
69
We return to your exploits coordinating distribution for the Tubular Ride Boogie Board Company. You will recall that the company has manufacturing plants in Tucson, Arizona and Toronto, Ontario, and you have been given the job of coordinating distribution of their latest model, the Gladiator, to their outlets in Honolulu and Venice Beach. The Tucson plant can manufacture up to 620 boards per week, while the Toronto plant, beset by labor disputes, can produce no more than 410 Gladiator boards per week. The outlet in Honolulu orders 470 Gladiator boards per week, while Venice Beach orders 500 boards per week. Transportation costs are as follows: Tucson to Honolulu: $10 per board; Tucson to Venice Beach: $5 per board; Toronto to Honolulu: $20 per board; Toronto to Venice Beach: $10 per board. Your manager has said that you are to be sure to fill all orders and ship the boogie boards at a minimum total transportation cost. But you have just been notified that workers at the Toronto boogie board plant have gone on strike, resulting in a total work stoppage. You are to come up with a revised delivery schedule by tomorrow with the understanding that the Tucson plant can push production to a maximum of 810 boards per week. What should you do
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
70
Federal Rent-a-Car is putting together a new fleet. It is considering package offers from three car manufacturers. Fred Motors is offering 5 small cars, 5 medium cars, and 10 large cars for $500,000. Admiral Motors is offering 5 small, 10 medium, and 5 large cars for $400,000. Chrysalis is offering 10 small, 5 medium, and 5 large cars for $300,000. Federal would like to buy at least 750 small cars, at least 600 medium cars, and at least 750 large cars. How many packages should it buy from each car maker to keep the total cost as small as possible

__________ package(s) of Fred Motors, __________ package(s) of Admiral Motors, and __________ package(s) of Chrysalis.

What will be the total cost

$__________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
71
Maximize
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
subject to
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
Round answers to two decimal places, if necessary.

If there is no solution, do not fill the fields.
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Maximize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
72
Minimize
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________
If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
73
Use the simplex method to maximize 2x+9y=p2 x + 9 y = p , subject to the following. {2x+y16x+2y8x0,y0}\left\{ \begin{array} { c } 2 x + y \leq 16 \\x + 2 y \leq 8 \\x \geq 0 , y \geq 0\end{array} \right\}

A) p=110p = 110
B) p=144p = 144
C) p=36p = 36
D) p=120p = 120
E) p=72p = 72
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
74
Fancy Pineapple produces pineapple juice and canned pineapple rings. This year the company anticipates a demand of at least 15,000 pints of pineapple juice and 2,500 cans of pineapple rings. Each pint of pineapple juice requires 2 pineapples, and each can of pineapple rings requires 1 pineapple. The company anticipates using at least 10,000 pineapples for these products. Each pint of pineapple juice costs the company 20 cents to produce, and each can of pineapple rings costs 50 cents to produce. How many pints of pineapple juice and cans of pineapple rings should Fancy Pineapple produce to meet the demand and minimize total costs

__________ pints of pineapple juice and __________ cans of pineapple rings.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
75
Minimize
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
subject to
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________
Round answers to two decimal places, if necessary.

If there is no solution, do not fill the fields.
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Minimize ​   ​ subject to ​   ​ Round answers to two decimal places, if necessary. ​ If there is no solution, do not fill the fields. ​   __________ ​   __________ ​   __________ ​   __________ __________
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
76
Your publishing company is about to start a promotional blitz for its new book, Physics for the Liberal Arts. You have 35 salespeople stationed in Chicago and 10 in Denver. You would like to fly at most 20 into Los Angeles and at most 20 into New York. A round-trip plane flight from Chicago to LA costs $195; from Chicago to NY costs $182; from Denver to LA costs $395; and from Denver to NY costs $166. You want to spend at most $7,380 on plane flights. How many salespeople should you fly from each of Chicago and Denver to each of LA and NY to have the most salespeople on the road ?

A)20 people from Chicago to LA, 10 people from Chicago to NY, no people from Denver to LA, and 10 people from Denver to NY
B) 10.0000000000 people from Chicago to LA, 10.0000000000 people from Chicago to NY, 20.0000000000 people from Denver to LA, and no people from Denver to NY
C) 10.0000000000 people from Chicago to LA, no people from Chicago to NY, 10.0000000000 people from Denver to LA, and 20.0000000000 people from Denver to NY
D) 10 people from Chicago to LA, 20 people from Chicago to NY, no people from Denver to LA, and 10 people from Denver to NY
E) 10 people from Chicago to LA, no people from Chicago to NY, 10 people from Denver to LA, and 10 people from Denver to NY
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
77
Maximize
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
subject to
Maximize ​   ​ subject to ​   ​ Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Please enter your answer as three numbers, separated by commas in the order p, x, y. If there is no solution, enter no solution.
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
78
The University's employee credit union has $4 million available for loans in the coming year. As VP in charge of finances, you must decide how much capital to allocate to each of four different kinds of loans, as shown in the table.  Type of Loan  Annual Rate of  Return  Automobile 8% Furniture 10% Signature 12% Other secured 10%\begin{array} { | c | c | } \hline \text { Type of Loan } & \begin{array} { c } \text { Annual Rate of } \\\text { Return }\end{array} \\\hline \text { Automobile } & 8 \% \\\hline \text { Furniture } & 10 \% \\\hline \text { Signature } & 12 \% \\\hline \text { Other secured } & 10 \% \\\hline\end{array} State laws and credit union policies impose the following restrictions:
Signature loans may not exceed 10 percent of the total investment of funds.
Furniture loans plus other secured loans may not exceed automobile loans.
How much should you allocate to each type of loan to maximize the annual return

A)allocate $1,800,000 to automobile loans, $400,000 to signature loans, $1,800,000 to furniture loans and no allocation to other secured loans
B) allocate $1,800,000 to automobile loans, $400,000 to signature loans, no allocation to furniture loans and $1,800,000 other secured loans
C) allocate $400,000 to automobile loans, $1,800,000 to signature loans, and $1,800,000 to any combination of furniture loans and other secured loans
D) allocate $1,800,000 to automobile loans, $400,000 to signature loans, and $1,800,000 to any combination of furniture loans and other secured loans
E) allocate $1,800,000 to automobile loans, $400,000 to signature loans, and $400,000 to any combination of furniture loans and other secured loans
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
79
Your small farm encompasses 150 acres, and you are planning to grow tomatoes, lettuce, and carrots in the coming planting season. Fertilizer costs per acre are: $5 for tomatoes, $4 for lettuce, and $2 for carrots. Based on past experience, you estimate that each acre of tomatoes will require an average of 4 hours of labor per week, while tending to lettuce and carrots will each require an average of 2 hours per week. You estimate a profit of $2,000 for each acre of tomatoes, $1,500 for each acre of lettuce and $500 for each acre of carrots. You would like to spend at least $600 on fertilizer (your niece owns the company that manufactures it) and your farm laborers can supply up to 900 hours per week. How many acres of each crop should you plant to maximize total profits

Plant __________ acres of tomatoes, __________ acres of lettuce, and __________ acres of carrots.

In this event, will you be using all 150 acres of your farm
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
80
If x dollars is invested in a company that controls, say, 30 percent of the market with 5 brand-names, then 0.3x0.3 x is a measure of market exposure and 5x5 x is a measure of brand-name exposure. Now suppose you are a broker at a large securities firm, and one of your clients would like to invest up to $100,000 in recording industry stocks. You decide to recommend a combination of stocks in four of the world's largest companies: Warner Music, Universal Music, Sony, and EMI.  Warner Music  Universal Music  Sony  EMI  Market Share 12%20%20%15% Number of  brand-names 8201015\begin{array} { | c | c | c | c | c | } \hline & \text { Warner Music } & \text { Universal Music } & \text { Sony } & \text { EMI } \\\hline \text { Market Share } & 12 \% & 20 \% & 20 \% & 15 \% \\\hline \begin{array} { c } \text { Number of } \\\text { brand-names }\end{array} & 8 & 20 & 10 & 15 \\\hline\end{array}
You wanted your client to maximize his total market exposure but limit his brand-name exposure to 2 million or less (representing an average of 20 labels or fewer per company), and still invest at least 20 percent of the total in Universal. How much should you advise your client to invest in each company

A)$20,000 in Warner Music, $80,000 in Sony, and no investment in Universal Music and EMI
B) $80,000 in Warner Music, $20,000 in EMI, and no investment in Universal Music and Sony
C) $20,000 in Universal Music, $80,000 in Sony, and no investment in Warner Music and EMI
D) $80,000 in Warner Music, $20,000 in Sony, and no investment in Universal Music and EMI
E) $80,000 in Universal Music, $20,000 in Sony, and no investment in Warner Music and EMI
Unlock Deck
Unlock for access to all 161 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 161 flashcards in this deck.