EXCURSIONS IN MODERN MATH
5th Edition
ISBN: 9781323741559
Author: Tannenbaum
Publisher: PEARSON C
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 8, Problem 63E
You have
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
The Operations Manager of a construction company wants to assign four contractors to four jobs in such a way as to minimize the time taken to complete four buildings of a special kind and size. Based on experience, the times taken (in months) for each contractor to complete each job are
given in the table below.
Jobs
Contractor
1
2
3
4
1
15
15
16
14
2
20
18
16
19
3
24
26
24
23
4
30
35
38
25
Required:-
Using the Hungarian (manual) method, determine the optimal assignment of contractors to jobs in order to minimize the total time taken to complete the jobs. Indicate this overall time and show all working.
2. Write an LP formulation that could be used to solve this problem with the relevant LP software packages.
Draw a network showing the quantities obtained in the final iteration and the optimal value of z.
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 8 Solutions
EXCURSIONS IN MODERN MATH
Ch. 8 - For the digraph shown in Fig. 8-25, find a.the...Ch. 8 - For the digraph shown in Fig. 8-26, find Figure...Ch. 8 - For the digraph in Fig. 8-25, find a.all path of...Ch. 8 - For the digraph in Fig. 8-26, find a.a path of...Ch. 8 - For the digraph in Fig. 8-25, find a.all cycles of...Ch. 8 - For the digraph in Fig. 8-26, find a.all cycles of...Ch. 8 - Prob. 7ECh. 8 - For the digraph in Fig.8-26, find a.all vertices...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...
Ch. 8 - Prob. 11ECh. 8 - Consider the digraph with vertex-set V={V,W,X,Y,Z}...Ch. 8 - Prob. 13ECh. 8 - Prob. 14ECh. 8 - Prob. 15ECh. 8 - A mathematics textbook consists of 10 chapters....Ch. 8 - Prob. 17ECh. 8 - The digraph in Fig. 8-29 is an example of a...Ch. 8 - Prob. 19ECh. 8 - Wobble, a start-up company, is developing a search...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - Prob. 23ECh. 8 - Prob. 24ECh. 8 - Prob. 25ECh. 8 - A ballroom is to be set up for a large wedding...Ch. 8 - Prob. 27ECh. 8 - Prob. 28ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 31ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 33ECh. 8 - Exercises33 and 34 refer to the Martian Habitat...Ch. 8 - Prob. 35ECh. 8 - Prob. 36ECh. 8 - Prob. 37ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 39ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 41ECh. 8 - Prob. 42ECh. 8 - Prob. 43ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 45ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 47ECh. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Prob. 53ECh. 8 - Consider the project digraph shown in Fig.8-41....Ch. 8 - Schedule the Apartments Unlimited project given in...Ch. 8 - Schedule the project given in Exercise26 Table8-5...Ch. 8 - Consider the project described by the project...Ch. 8 - Consider the project digraph shown in Fig.8-43,...Ch. 8 - Prob. 59ECh. 8 - Symmetric and totally asymmetric digraphs. A...Ch. 8 - Prob. 61ECh. 8 - Let W represent the sum of the processing times of...Ch. 8 - You have N=2 processors to process M independent...Ch. 8 - You have N=3 processors to process M independent...Ch. 8 - You have N=2 processor to process M+1 independent...
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
- Suppose a certain manufacturing company produces connecting rods for 4- and 6-cylinder automobile engines using the same production line. The cost required to set up the production line to produce the 4-cylinder connecting rods is $2,200, and the cost required to set up the production line for the 6-cylinder connecting rods is $3,300. Manufacturing costs are $12 for each 4-cylinder connecting rod and $16 for each 6-cylinder connecting rod. Hawkins makes a decision at the end of each week as to which product will be manufactured the following week. If a production changeover is necessary from one week to the next, the weekend is used to reconfigure the production line. Once the line has been set up, the weekly production capacities are 6,000 6-cylinder connecting rods and 8,000 4-cylinder connecting rods. Let x4 = the number of 4-cylinder connecting rods produced next week x6 = the number of 6-cylinder connecting rods produced next week s4 = 1 if the production line is set up to…arrow_forwardConsider the given graph below. The weights represent the time, in minutes of reaching one destination from another destination. Using the Brute Force Method in this complete weighted graph, determine all the Hamilton circuits starting at L and its optimal solution.arrow_forwardWrite down the mathematical expressions for: The market-clearing condition when all endowments are owned by a private-sector individual and that an allocation (x, y) must be feasible in a world with private-endowment, but NO production.arrow_forward
- 22) Determine using the Simplex algorithm the optimal solution to the following linear programming problem:arrow_forwardSO what would be the L, Lq, and Wq of this problem? Assuming we are trying to develop and sovle a waiting line system that can accomodate this increased leel of passenger traffic.arrow_forwardAn engineer is studying the mileage performance characteristics of 5 types of gasoline additives. In the road test he wishes to use cars as blocks; however, because of a time constraint, he must use an incomplete block design. He runs the balanced design with the five blocks that follow. Car Additive 1 2 3 4 5 1 NA 17 14 13 12 2 14 14 NA 13 10 3 12 NA 13 12 9 4 13 11 11 12 NA 5 11 12 10 NA 8 - Verify that this is a balanced incomplete block design - Obtain the estimates of the treatment means and the treatments effectsarrow_forward
- Mo. For each of the following shaded region in Figure 1, can it be the feasible region of a linear program? arrow_forwardThe call center of a small manufacturer receives calls randomly at an average rate of 9 customers per hour. The arriving calls are answered by a single agent randomly with an average service rate of 12 customers per hour. Answer the following questions assuming that the system can be modeled as an M/M/1 queue. average waiting time in queue (in minutes): minimum integer service rate (number of customers served per hour) such that the average waiting time in queue is less than 7 minutes: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_forward
- Consider two small companies, each with 9 employees including 1 boss with the highest salary in each company, and 8 people working for them with lower salaries. The table below gives the annual salaries of the people in each company. These salaries are identical except for the fact that Small Company B is more profitable overall, and their boss decides to keep a much higher salary than the boss of Small Company A. Small Company A Small Company B $85 000 (boss A) $360 000 (boss B) $65 000 $65 000 $60 000 $60 000 $40 000 $40 000 $35 000 $35 000 $35 000 $35 000 $35 000 $35 000 $30 000 $30 000 $30 000 $30 000 For each of the two companies, calculate the mean, median, and mode, and show your answers and calculations in the space below (rounded to the nearest thousands place). After you answer this question, answer the two follow-up questions about the results you just calculated.arrow_forwardConsider a production system of a factory in which group technology is tried to apply. Groups areplanned to include 4 machines however, it is not allowed to assign more than one F Machine in a singlegroup because of the physical constraints. Utilizations are given in the table. Using single pass heuristicapproach, construct a set of groups. Write the parts and machines assigned to each group. Is yoursolution optimal?arrow_forwardJensen Tire & Auto is in the process of deciding whether to purchase a maintenance contract for its new computerized wheel alignment and balancing machine. Managers feel that maintenance expense is related to usage of the machine, and they have collected the following information on weekly usage of the machine (in hours) and annual maintenance expense (in hundreds of dollars) from 10 other companies that own the machine.Company Weekly Usage(hours) Annual maintenance Expense(hundreds of dollars)A 13 17.0B 10 22.0C 20 30.0D 28 37.0E 32 47.0F 17…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
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