Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
3rd Edition
ISBN: 9780134689555
Author: Edgar Goodaire, Michael Parmenter
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 11, Problem 19RE
To determine
The slack at all vertices that are of the critical path. On viewing the network as representing a type II scheduling problem and the weights as representing times in days. Find a critical path from A to E and determine the overall time required to complete such a project.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
a) draw the network diagram. under normal conditions, what is the earliest the project can be completed? what is the direct cost? what is the critical path?
b) what is the cost of the project if it is completed 1 day earlier? two days earlier?
c) what is the earliest the project can be completed? what is the lowest cost for completing it in this time?
How can we interpret non-basic slack variables within an optimal solution?
Select one or more:
as the amount of uninvested money
cannot be interpreted
as possible increase in risk
as exceeding the minimum requirement to invest in gold
as the annual return on the total money invested
as the difference between invested money in silver and in platinum
Scott and Associates, Inc., is an accounting firm that has three new clients. Project leaders will be assigned to the three clients. Based on the different backgrounds and experiences of the leaders, the various leader–client assignments differ in terms of projected completion times. The possible assignments and the estimated completion times in days are as follows:
Requireda. Develop a network representation of this problem.b. Find the optimal solution using the Hungarian method. What is the total time required?
Chapter 11 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Ch. 11.1 - Prob. 1TFQCh. 11.1 - Prob. 2TFQCh. 11.1 - Prob. 3TFQCh. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - If a graph G has six odd vertices, to solve the...Ch. 11.1 - Prob. 6TFQCh. 11.1 - Prob. 7TFQCh. 11.1 - In the weighted graph the Chinese Postman Problem...Ch. 11.1 - Prob. 9TFQCh. 11.1 - In the unweighted graph n, n odd, the Chinese...
Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 2ECh. 11.1 - 3. [BB] Solve the Chinese Postman Problem for the...Ch. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Solve the Chinese Postman Problem for the weighted...Ch. 11.1 - Prob. 9ECh. 11.1 - Prob. 10ECh. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.2 - Prob. 1TFQCh. 11.2 - Prob. 2TFQCh. 11.2 - Prob. 3TFQCh. 11.2 - Prob. 4TFQCh. 11.2 - Prob. 5TFQCh. 11.2 - Prob. 6TFQCh. 11.2 - Prob. 7TFQCh. 11.2 - Prob. 8TFQCh. 11.2 - Prob. 9TFQCh. 11.2 - Prob. 10TFQCh. 11.2 - Prob. 1ECh. 11.2 - Prob. 2ECh. 11.2 - Prob. 3ECh. 11.2 - Prob. 4ECh. 11.2 - Prob. 5ECh. 11.2 - Prob. 6ECh. 11.2 - Prob. 7ECh. 11.2 - Prob. 8ECh. 11.2 - Prob. 9ECh. 11.2 - Prove Theorem 11.2.4: A digraph is Eulerian if and...Ch. 11.2 - Prob. 11ECh. 11.2 - Prob. 12ECh. 11.2 - 13. Label the vertices of each pair of digraphs in...Ch. 11.2 - 14. Consider the digraphs , shown.
(a) Find the...Ch. 11.2 - The answers to exercises marked [BB] can be found...Ch. 11.2 - In each of the following cases, find a permutation...Ch. 11.2 - Prob. 17ECh. 11.2 - Prob. 18ECh. 11.2 - [BB] if a graph G is connected and some...Ch. 11.2 - Prob. 20ECh. 11.2 - Prob. 21ECh. 11.2 - Prob. 22ECh. 11.2 - Prob. 23ECh. 11.2 - [BB] Apply the original form of Dijkstras...Ch. 11.2 - Prob. 25ECh. 11.2 - Prob. 26ECh. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - [BB] The Bellman-Ford algorithm can be terminated...Ch. 11.2 - Prob. 30ECh. 11.2 - Prob. 31ECh. 11.2 - Prob. 32ECh. 11.2 - Prob. 33ECh. 11.3 - Prob. 1TFQCh. 11.3 - Prob. 2TFQCh. 11.3 - Prob. 3TFQCh. 11.3 - Prob. 4TFQCh. 11.3 - Prob. 5TFQCh. 11.3 - Prob. 6TFQCh. 11.3 - Prob. 7TFQCh. 11.3 - Prob. 8TFQCh. 11.3 - Prob. 9TFQCh. 11.3 - Prob. 1ECh. 11.3 - Prob. 2ECh. 11.3 - Prob. 3ECh. 11.3 - Prob. 4ECh. 11.3 - Prob. 5ECh. 11.4 - Prob. 1TFQCh. 11.4 - Prob. 2TFQCh. 11.4 - Prob. 3TFQCh. 11.4 - Prob. 4TFQCh. 11.4 - Prob. 5TFQCh. 11.4 - Prob. 6TFQCh. 11.4 - Prob. 7TFQCh. 11.4 - Prob. 8TFQCh. 11.4 - Prob. 9TFQCh. 11.4 - Prob. 10TFQCh. 11.4 - Prob. 1ECh. 11.4 - Prob. 2ECh. 11.4 - Prob. 3ECh. 11.4 - Prob. 4ECh. 11.4 - Prob. 5ECh. 11.4 - Prob. 6ECh. 11.4 - Prob. 7ECh. 11.4 - Prob. 8ECh. 11.4 - Prob. 9ECh. 11.4 - Prob. 10ECh. 11.4 - Prob. 11ECh. 11.4 - Prob. 12ECh. 11.5 - Prob. 1TFQCh. 11.5 - Prob. 2TFQCh. 11.5 - Prob. 3TFQCh. 11.5 - Prob. 4TFQCh. 11.5 - Prob. 5TFQCh. 11.5 - Prob. 6TFQCh. 11.5 - Prob. 7TFQCh. 11.5 - Prob. 8TFQCh. 11.5 - Prob. 9TFQCh. 11.5 - 10. In a type scheduling problem, a vertex that...Ch. 11.5 - Prob. 1ECh. 11.5 - [BB] The construction of a certain part in an...Ch. 11.5 - Prob. 3ECh. 11.5 - Prob. 4ECh. 11.5 - Prob. 5ECh. 11.5 - 6.(a) Find two different orientations on the edges...Ch. 11.5 - Prob. 7ECh. 11.5 - 8. Repeat Exercise 7 if, in addition to all the...Ch. 11.5 - Repeat Exercise 7 if A takes 6 months to complete...Ch. 11.5 - Prob. 10ECh. 11.5 - Prob. 11ECh. 11.5 - Prob. 12ECh. 11.5 - Prob. 13ECh. 11.5 - Prob. 14ECh. 11.5 - Prob. 15ECh. 11.5 - Prob. 16ECh. 11.5 - 17. The computer systems manager in mathematics...Ch. 11 - Solve the Chinese Postman Problem for the two...Ch. 11 - Prob. 2RECh. 11 - 3. Solve the Chinese Postman Problem for the...Ch. 11 - Prob. 4RECh. 11 - Prob. 5RECh. 11 - Prob. 6RECh. 11 - Prob. 7RECh. 11 - Prob. 8RECh. 11 - Prob. 9RECh. 11 - 11. Let and assume that the complete graph has...Ch. 11 - Prob. 11RECh. 11 - Prob. 12RECh. 11 - Prob. 13RECh. 11 - Prob. 14RECh. 11 - Use a version of Dijkstras algorithm to find a...Ch. 11 - Prob. 16RECh. 11 - Prob. 17RECh. 11 - Prob. 18RECh. 11 - Prob. 19RECh. 11 - 20. The following chart lists a number of tasks...Ch. 11 - Prob. 21RE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- A major hotel chain is constructing a new resort hotel complex in Greenbranch Springs, WestVirginia. The resort is in a heavily wooded area, and the developers want to preserve as much ofthe natural beauty as possible. To do so, the developers want to connect all the various facilitiesin the complex with a combination walking–riding path that will minimize the amount of pathwaythat will have to be cut through the woods. The following network shows possible connectingpaths and corresponding distances (in yards) between the facilities: Determine the path that will connect all the facilities with the minimum amount of constructionand indicate the total length of the pathway.arrow_forwardThe manager of the customer service department at a bank can hire employees with a high school degree (HS) who earn $10,000 annually or employees with a bachelor's degree (B) who earn $20,000. The manager wants to maximize the number of customers served given a fixed payroll. Worker Number of Additional Customers Served   High School Degree Bachelor's Degree   1st 80 90   2nd 60 80   3rd 50 60   4th 40 40   5th 35 35   6th 30 25   Given the information in the table, if the manager's payroll is $120,000, what should be done to maximize the number of customers served? What is the math behind this? Do I just look back and select which degrees equal 0.5? That would take a lot of manual work to do that. Is their an easier way?arrow_forwardPlease help ASAP In Example 10.2, suppose that the vehicles operate according to the following scheduling rule in order to minimize the distances the vehicle travel empty: vehicles delivering raw work parts from station 1 to stations 2, 3, and 4 must pick up finished parts at these respective stations for delivery to station 5. (a) Determine the empty travel distances associated with each delivery and develop a from-to chart in the format of Table 10.5 (b) The AGVs travel at a speed of 50 m/min and the traffic factor = 0.90. Assume reliability = 100%. From Example 10.2, the delivery distance Ld = 103.8 m. Determine the value of Le. (c) How many automated guided vehicles will be required to operate the system?arrow_forward
- a. Develop a network representation of the problem. b. Formulate the problem as a linear program, with the optimal solution providing the hours each consultant should be scheduled for each client to maximize the consulting firm’s billings. What is the schedule and what is the total billing? c. New information shows that Avery doesn’t have the experience to be scheduled for client B. If this consulting assignment is not permitted, what impact does it have on total billings? What is the revised schedule?arrow_forwardA shop has four machinists to be assigned to four machines. The hourly cost of having each machine operated by each machinist is as follows: However, because he does not have enough experience, machinist 3 cannot operate machine B. a. Determine the optimal assignment and compute total minimum cost. b. Formulate this problem as a general linear programming model.arrow_forwardA cable TV company was interested in making its operation more efficient by cutting down on the distance between service calls while still maintaining at least the same level of service quality. A treatment group of 18 repairpersons was assigned to a dispatcher who monitored all the incoming requests for cable repairs and then provided a service strategy for that day’s work orders. A control group of 18 repairpersons was to perform their work in a normal fashion—that is, by providing service in roughly a sequential order as requests for repairs were received. The average daily mileages for the 36 repairpersons are recorded in the table below.  What are the populations of interest in this study?  What is the level of significance of your test?  Is there significant evidence that the treatment group had a smaller average daily mileage than the control group? Use α = 0.05.arrow_forward
- Find the minimum cost aswell.arrow_forwardquestion: Which constraints are active, meaning that all of the resource is used in the optimal solution?arrow_forwardResource Allocation  Podunk Institute of Technology's Math Department offers two courses: Finite Math and Applied Calculus. Each section of Finite Math has 40 students, and each section of Applied Calculus has 30. The department is allowed to offer a total of up to 70 sections. Furthermore, no more than 2,400 students want to take a math course. (No student will take more than one math course.) Draw the feasible region that shows the number of sections of each class that can be offered. (Place finite math on the x-axis and applied calculus on the y-axis.) The x y-coordinate plane is given. There are 2 lines and a region labeled "solution set" on the graph. The first line enters the window at y = 80 on the positive y-axis, goes down and right, passes through the point (30, 40) crossing the second line, crosses the x-axis at x = 60, and exits the window in the fourth quadrant. The second line enters the window at y = 70 on the positive y-axis, goes down and right, passes through the…arrow_forward
- In 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_forwardResource Allocation   Podunk Institute of Technology's Math Department offers two courses: Finite Math and Applied Calculus. Each section of Finite Math has 60 students, and each section of Applied Calculus has 40. The department is allowed to offer a total of up to 100 sections. Furthermore, no more than 4,800 students want to take a math course. (No student will take more than one math course.) Draw the feasible region that shows the number of sections of each class that can be offered. (Place finite math on the x-axis and applied calculus on the y-axis.)   Find the corner points of the region. (Order your answers from smallest to largest x, then from smallest to largest y. If an answer does not exist, enter DNE.)arrow_forwardResource Allocation  Podunk Institute of Technology's Math Department offers two courses: Finite Math and Applied Calculus. Each section of Finite Math has 40students, and each section of Applied Calculus has 30. The department is allowed to offer a total of up to 70 sections. Furthermore, no more than 2,400 students want to take a math course. (No student will take more than one math course.) Draw the feasible region that shows the number of sections of each class that can be offered. (Place finite math on the x-axis and applied calculus on the y-axis. )arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY