<< Prev Showing: 311-315 of 562 Next >>
· 286-290 · 291-295 · 296-300 · 301-305 · 306-310 · 311-315 · 316-320 · 321-325 · 326-330 · 331-335 · 336-340 ·Linear Programming and the Simplex methods
Consider the following linear programming problem: A workshop of Peter's Potters makes vases and pitchers. Profit on a vase is $3.00; profit on a pitcher is $4.00. Each vase requires ½ hour of labor, each pitcher requires 1 hour of labor. Each item requires 1 unit of time in the kiln. Labor is limited to 4 hours per day and kiln time is limited to 6 units per day. Initial and final tableaux are shown in finding the production plan which will maximize profits: (x = number of vases and y = number of pitchers made per day). X y u v M x y u v M ½ 1 1 0 0 4 0 1 2 -1 0 2 1 1... click for more
Subject:
Math
Topic:
Finite Mathematics
Posting ID:
44980
OTA ID:
103300
Linear Programming and Simplex Methods
The linear programming problem. Minimize 5x - y subject to: -2x - 2y < 12 -3x + 2y > 0 x > 0, y > 0 is equivalent to the linear programming problem: a. Maximize 5x - y subject to: -2x -2y < 12 3x - 2y < 0 x > 0, y > 0 b. Maximize 5x-y subject to: -2x -2y < 12 -3x + 2y > 0 x > 0, y > 0 c. Maximize 5x -y subject to : ] -2x -2y < 12 -3x + 2y < 0 x > 0, y > 0 d. Maximize 5x-y subject to: -2x -2y < 12 3x + 2y > 0 x > 0, y > 0 e. None of the above
Subject:
Math
Topic:
Finite Mathematics
Posting ID:
44981
OTA ID:
103300
Linear Programming and simplex methods
Consider the simplex tableau x y u v w M 1 0 3 0 0 0 10 0 0 1 0 1 0 0 0 1 -6 0 0 0 3 0 0 8 1 0 0 7 0 0 5 0 0 1 4 The tableau above is the final one in a problem to minimize -x + 2y. The minimum value of -x + 2y occurs when: a. x = 10, y =3 b. x = -10, y= -3 c. x = 10, y =0 d. x = -20, y= 6. e. None of the above
Subject:
Math
Topic:
Finite Mathematics
Posting ID:
44982
OTA ID:
103846
Linear Programming and Simplex methods
In the following simplex tableau, the next pivot element is: x y u v M 2 1 0 5 0 20 4 0 1 8 0 32 -3 0 0 2 1 -9 a. 4 in the second row, first column b. 8 in the second row, fourth column c. 1 in the first row, second column d. -3 in the third row, first column e. None of the above
Subject:
Math
Topic:
Finite Mathematics
Posting ID:
44984
OTA ID:
104455
Linear Programming and Simplex Methods
Problem: New cars are transported from docks in Baltimore and New York to dealerships in Pittsburgh and Philadelphia. The dealership in Pittsburgh needs 20 cars and the delaership in Philadelphia needs 15 cars. It costs $60 to transport a car from Baltimore to Pittsburgh, $45 to transport a car from Baltimore to Philadelphia, $65 to transport a car from New York to Philadelphia. There are 30 cars on the docks in Baltimore and there are 18 cars on the docks in New York. The number of cars sent from each dock to each dealership is chosen to minimize total transportation costs. If x represents the number of cars sent from Baltimore to Philadelphia and y represents the number of cars sent... click for more
Subject:
Math
Topic:
Finite Mathematics
Posting ID:
45001
OTA ID:
103300
<< Prev Showing: 311-315 of 562 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-210 · 211-215 · 216-220 · 221-225 · 226-230 · 231-235 · 236-240 · 241-245 · 246-250 · 251-255 · 256-260 · 261-265 · 266-270 · 271-275 · 276-280 · 281-285 · 286-290 · 291-295 · 296-300 · 301-305 · 306-310 · 311-315 · 316-320 · 321-325 · 326-330 · 331-335 · 336-340 · 341-345 · 346-350 · 351-355 · 356-360 · 361-365 · 366-370 · 371-375 · 376-380 · 381-385 · 386-390 · 391-395 · 396-400 · 401-405 · 406-410 · 411-415 · 416-420 · 421-425 · 426-430 · 431-435 · 436-440 · 441-445 · 446-450 · 451-455 · 456-460 · 461-465 · 466-470 · 471-475 · 476-480 · 481-485 · 486-490 · 491-495 · 496-500 · 501-505 · 506-510 · 511-515 · 516-520 · 521-525 · 526-530 · 531-535 · 536-540 · 541-545 · 546-550 · 551-555 · 556-560 · 561-562 ·Page generated in 0.0986 seconds