Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
A company owns the same asset in a ASIAN plant and in a UK plant . It has B $2,000,000 and a salvage value of 20% of B . For tax depreciation purposes, ASIA allows a straight line write-off over 5 years, while the UK allows SL write-off over 8 years. The general managers of the two plants want to know the difference in the depreciation amount for year 5.
The city of Smallville consists of five subdivisions, Mayor Takeda wants to build telephone lines to ensure that all subdivisions can communicate with each other. The distances between the subdivisions are given in the figure below: Assume that no telephone line can be built between subdivisions 1 and 4.
______ 1) What is the minimum length of cable required?
12 units b. 14 units c. 15 units d. 16 units
______ 2) Which arcs should be connected to obtain the least cable wires needed?
(1, 3), (3, 5), (3, 4), (3, 2) c. (1, 5), (5, 3), (3, 4), (3, 2)
(1, 3), (3, 5), (5, 4), (4, 2) d. (1, 2), (2, 4), (4, 3), (3, 5)
______ 3) What would be the total length if the following arcs are connected: (1, 3), (3, 4), (4, 5), (3, 2)
18 units b. 17 units c. 15 units d. 16 units
A known distribution company intends to reward it deserving employees with a bonus only for sales agents who reached the quota of Php50,000. Considering its mainstream operations, the firm wants to limit it to Manila and San Juan. Details of its roster is shown below:
Name
Area
Position
Sales
Denni Cruz
Caloocan
Manager
76,400
Carmen Romulo
Manila
Sales Agent
53,085
Lea Ramirez
Quezon City
Rep
98,320
Exequiel Cabanda
Las Pinas
Supervisor
67,082
Marissa Caparaz
Manila
Sales Agent
59,999
Michael Guba
Pasay
Manager
43,999
Leslie Romero
Caloocan
Rep
93,000
Patrick Cua
Quezon City
Store Manager
100,032
Paul Rodrigues
San Juan
Sales Agent
32,028
Eryck Pangin
San Juan
Rep
100,320
Ezra Reyes
Manila
Sales Agent
50,021
Henry Dominquez
Makati
Supervisor
65,000
Sarah Folloja
Paranaque
Gen. Manager
82,092
Using logical functions, determine the qualified.
Knowledge Booster
Similar questions
- Suppose that each firm in a perfectly competitive market has a cost of TC = 75 + 500Q - 5Q2 + 0.5Q3 Determine if this is a short-run or long-run cost function (motivate):arrow_forwardIKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…arrow_forwardQ1. Considering the Max-min fairness principle, draw the bandwidth allocation in function of time: • At t=0s, flow 1 starts• At t=2, flow 2 and flow 3 start; both use 30% of the bandwidth• At t=5, flow 4 starts (no assumption about how much bandwidth each flowconsumes)• At t=9, flow 2 and flow 3 end, while flow 4 uses 20% of the bandwidth for theremaining time since t=9s Thank you in advance!arrow_forward
- Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 5.1. I am in need of help solving this problem and figuring out how to come up with the values in the table.arrow_forwardA manufacturer has distribution centres at Kisumu, Nairobi and Mombasa. These centres have availability of 40, 20 and 40 units of his product, respectively. His retail outlets at A, B, C, D and E require25, 10, 20, 30 and 15 units of the products, respectively. The transport cost (in $) per unit betweeneach centre outlet is given below:Determine the optimal distribution so as to minimize the cost of transportation.arrow_forwardConsider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from u to all network nodes. a) Fill the following table to show the Dijkstra’s shortest-path algorithm works by computing the path and cost form u to all other network nodes. b) Construct the resulting least-cost-path tree from u.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole