<< Prev Showing: 106-110 of 209 Next >>
· 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 ·Multiple choice problems in linear programming applications. (See attached file for full problem descriptions)
Subject:
Math
Topic:
Operations Research
Posting ID:
83602
OTA ID:
104578
Two-Person Zero-Sum Game Problem
Need help setting up this 3X4 Matrix problem. I have only worked 2X2 matrix game problems per recent homework, however, I can't seem to leverage that knowledge for this problem. I'm also not sure how to deal with the extra reward variable (one point for capturing each of the other army's bn). Also need help setting up the LP for the Army with 4 Battalions. Thank You! Based on questions from OTA's, here is additional input I neglected earlier. Sorry! - How many cities? two - What happens when Armies send the same number of Battalions? it is a draw, i.e., no points
Subject:
Math
Topic:
Operations Research
Posting ID:
87299
OTA ID:
101620
Two armies are advancing on two cities. The first army has 4 regiments and the second army has 3 regiments. At each city, the army that send more regiments to the city captures both the city and the opposing army regiment. If both armies send the same number of regiments to a city, them the battle at the city is a draw. Each army scores 1 point per city captured and 1 point per captured regiment. Assume that each army wants to maximize the difference between its reward and its opponent's reward. Formulate this situation as two-person zero-sum game and solve for the value of the game and each player's optimal strategies.
Subject:
Math
Topic:
Operations Research
Posting ID:
88053
OTA ID:
101620
We have 21 coins and are told that one is heavier than any of the other coins. How many weighings on a balnce will it take to find the heaviest coin? (Hint: If the heaviest coin is in a group of three coins, we can find it in one weighing. Than work backward to two weighings, and so on).
Subject:
Math
Topic:
Operations Research
Posting ID:
88092
OTA ID:
103300
Transportation Method: Andrew-Carter case
Andrew-Carter, Inc. (A-C), is a major Canadian producer and distributor of outdoor lighting fixtures. Its fixture is distributed throughout North America and has been in high demand for several years. The company operates three plants that manufacture the fixture and distribute it to five distribution centers (warehouses). During the present recession. A-C has seen a major drop in demand for its fixture as the housing market has declined. Based on the forecast of interest rates, the head of operations feels that demand for housing and thus for its product will remain depressed for the foreseeable future. A-C is considering closing one of its plants, as it is now operating with a forecasted ... click for more
Subject:
Math
Topic:
Operations Research
Posting ID:
92008
OTA ID:
105227
<< Prev Showing: 106-110 of 209 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 · 56-60 · 61-65 · 66-70 · 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-190 · 191-195 · 196-200 · 201-205 · 206-209 ·Page generated in 0.0154 seconds