Consider the project described by the project digraph shown in Fig.
a. Find the critical path and critical time for the project.
b. Find the critical-time priority list.
c. Schedule the project with
d. Find an optimal schedule for
e. Use the relative error formula
Figure
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
EXCURSIONS IN MOD.MATH W/ACCESS >BI<
- 1.) use the corner point method and enumerate 6 corner points. 2.) find the optimal z-value 3.) how many infeasible corner points does this LP have?arrow_forwardSuppose that in solving a TSP you use the nearest-neighboralgorithm and find a nearest-neighbor tour with a total costof $13,500. Suppose that you later find out that the cost ofan optimal tour is $12,000. What was the relative error ofyour nearest-neighbor tour? Express your answer as a percentage,rounded to the nearest tenth of a percent.arrow_forwardfind the mximum possible order of S5arrow_forward
- 3.4 The system is tested on a sample of one hundred computers and the average connection speed is found to be far below 400 kilobits. What hypothesis should probably be rejected? Explain. If the customer needs a connection speed of 400 kilobits to run her application programs, what is the business decision that corresponds to the decision regarding the hypotheses?arrow_forward(a) Show that C = 4/π.(b) Construct the Neumann method, find the expected number of trials (per one acceptance), and find the computational cost (efficiency).arrow_forwardWe have an initial simplex tableau given byarrow_forward
- We have five jobs, each of which must go through two machines in the order BA. Their processing times are given below: Job 1 2 3 4 5 Machine A 10 2 18 6 20 Machine B 4 12 14 16 18 Decide the optimum sequence of processing of jobs in order to minimize the total time required. Also find the total minimum elapsed time.arrow_forwardIn 2015, the Phoenix/Zweig Advisors Zweig Total Return fund (ZTR) was expected to yield 5% and the Madison Asset Management Madison Strategic Sector Premium fund (MSP) was expected to yield 7%. You would like to invest a total of up to $60,000 and earn at least $3,500 in interest. Draw the feasible region that shows how much money you can invest in each fund (based on the given yields). Find the corner points of the region. Make sure you use a test point in your work. Shade the region(s) that is NOT the solution and label the region SOLUTION SET.arrow_forwardA municipal solid-waste site for a city must be located at Site A or Site B. After sorting, some of the solid refuse will be transported to an electric powerplant where it will be used as fuel. Data for the hauling of refuse from each site to the power plant are shown in Table P2-4. If the power plant will pay $8.00 per cubic yard of sorted solid waste delivered to the plant, where should the solid-waste site be located? Use the city’s viewpoint and assume that 200,000 cubic yards of refuse will be hauled to the plant for one year only. One site must be selected.arrow_forward
- Mo. For each of the following shaded region in Figure 1, can it be the feasible region of a linear program? arrow_forwardConsider a canonical LP problem. If it has an optimal solution, then it has a basic optimal solution.arrow_forwardUse the Runge-Kutta Fehlberg Algorithm to approximate the solution to the following initial-value problems. This is a numerical analysis problemarrow_forward
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning