The Tinker Construction Company is ready to begin a project that must be completed in 12 months. This project has four activities (A, B, C, D) with the project network shown next.
The project manager, Sean Murphy, has concluded that he cannot meet the deadline by performing all these activities in the normal way. Therefore, Sean has decided to use the CPM method of time-cost trade-offs to determine the most economical way of crashing the project to meet the deadline. He has gathered the following data for the four activities.
Use marginal cost analysis to solve the problem.
Answer to relevant QuestionsReconsider the Tinker Construction Co. problem presented in Prob. 10.8-1. While in college, Sean Murphy took an OR course that devoted a month to linear programming, so Sean has decided to use linear programming to analyze ...A rebel army is attempting to overthrow the elected government of the Russian Federation. The United States government has decided to assist its ally by quickly sending troops and supplies to the Federation. A plan now needs ...Reconsider the networks shown in Prob. 10.3-4. Use the algorithm described in Sec. 10.4 to find the minimum spanning tree for each of these networks. In problem (a) (b) Consider the following nonlinear programming problem. Maximize Z = x1 (1 – x2) x3, Subject to x1 – x2 + x3 ≤ 1 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Use dynamic programming to solve this problem. Reconsider Example 6. Suppose that the bet is changed as follows: “Starting with two chips, she will not have at least five chips after five plays of the game.” By referring to the previous computational results, make ...
Post your question