Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5.3, Problem 4P
Explanation of Solution
Calculating the extra payment:
- Let xmn is the number of units of product n at plant m.
- In order to minimize the cost of meeting these demands, the following Linear
Programming has to be solved: - min z=
- Such that,
- All variables ≥ 0
- The output of this Linear Programming is given below:
- min z=
- Subject to constraint
- End
- LP optimum is found at step 2
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
QUESTION 2
CU, Incorporated (CUI), produces copper contacts that it uses in switches and relays. CUI
needs to determine the order quantity, Q, to meet the annual demand at the lowest cost. The
price of copper depends on the quantity ordered. Annual demand is 25,000 kilograms per
year. Holding cost is 20 percent per unit per year of the price of copper and the Ordering cost
is $30.00. Table 2 that follows, shows the quantity discount schedule price-break:
Table 2- Quantity Discount Schedule
Quantity (kg)
5,000 and greater than 5,000
3,750 to 4,999
2,500 to 3,749
1,250 to 2,499
1 to 1,249
Price ($)
0.38
0.39
0.40
0.41
0.42
Determine the optimal order size that you would order if you were purchasing copper from
CUI.
In Figure, suppose that the wellheads can be divided into two groups depending on gas pressure: a high-pressure group that includes wells 2, 3, 4, and 6 and a low-pressure group that includes wells 5, 7, 8, and 9 . Because of pressure difference, it is not possible to link the wellheads from the two groups. At the same time, both groups must be connected to the delivery point through wellhead 1. Determine the minimum pipeline network for this situation.
Choices:
a.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-5 to ∞ : Total length = 53
b.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-5: Total length = 53
c.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, 5-6, and 6-7 to ∞ : Total length = 53
d.) Set length of arcs 3-5, 5-3, 4-5, 5-4, 4-7, 7-4, and 6-5 to ∞ : Total length = 53
Pakistan Railway has hired you for the task of repair of its rail networks of province SINDH, the cost of the repair of track between the different cities are presented in the given Table. For instance, the entry (KHI,HYD)= 10 in the table tells us the cost of building a rail connection between these two cities is 10 (in million rupees)
You are required to develop a rail network that connects all the cities by at least one path with the smallest cost by avoiding multiple paths to the same city. Hence the problem becomes the finding of Minimum spanning tree in a graph.
Your job is as follows;
a) Translate the given information in the form of Graph (Vertices & edges)
b) Use Greedy Algorithms (Kruskal’s , if the S5 is odd & Prim’s technique , if S5 is even) to build rail connections in this scenario. Apply this algorithm and show all steps up to the final routes.
c) What is the cost of repairing of resulting rail network?
Chapter 5 Solutions
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Ch. 5.1 - Prob. 1PCh. 5.1 - Prob. 2PCh. 5.1 - Prob. 3PCh. 5.1 - Prob. 4PCh. 5.1 - Prob. 5PCh. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5P
Ch. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.3 - Prob. 1PCh. 5.3 - Prob. 3PCh. 5.3 - Prob. 4PCh. 5.3 - Prob. 5PCh. 5.3 - Prob. 6PCh. 5.3 - Prob. 7PCh. 5.3 - Prob. 9PCh. 5.3 - Prob. 10PCh. 5.3 - Prob. 11PCh. 5 - Prob. 1RPCh. 5 - Prob. 2RPCh. 5 - Prob. 3RPCh. 5 - Prob. 4RPCh. 5 - Prob. 6RPCh. 5 - Prob. 7RPCh. 5 - Prob. 8RPCh. 5 - Prob. 9RPCh. 5 - Prob. 10RPCh. 5 - Prob. 11RPCh. 5 - Prob. 12RPCh. 5 - Prob. 13RPCh. 5 - Prob. 14RPCh. 5 - Prob. 15RPCh. 5 - Prob. 16RP
Knowledge Booster
Similar questions
- So I need help solving this particular HW problem.arrow_forwardAn assembly line with 30 activities is to be balanced. The total amount of time to complete all 30 activities is 60 minutes. The longest activity takes 2.4 minutes and the shortest takes .3 minutes. The line will operate for 480 minutes per day. What are the maximum and minimum cycle times? (using the cycle time formula) How much daily output will be achieved by each of those cycle times?arrow_forwardالجمعة تحریر > P V:.. Question#03: If the average defect density is 1.5/cm?, what is the yield if the size is increased to that of an entire 4-inch wafer and the die size is 2cm?? If the cost of each wafer is 200S and the manufacturing complexity is 4 then find? (3 marks) a) The average cost per good die? b) Find predicating the yield by using Poison Distribution Model? iarrow_forward
- PROBLEM 9 The Darby Company manufactures and distributes meters used to measure electric power consumption. The company started with a small production plant in El Paso and gradually built a customer base throughout Texas. A distribution center was established in Fort Worth, Texas, and later, as business expanded, a second distribution center was established in Santa Fe, New Mexico. The El Paso plant was expanded when the company began marketing its meters in Arizona, California, Nevada, and Utah. With the growth of the West Coast business, the Darby Company opened a third distribution center in Las Vegas and just two years ago opened a second production plant in San Bernardino, California. Manufacturing costs differ between the company's production plants. The cost of each meter produced at the El Paso plant is $10.50. The San Bernardino plant utilizes newer and more efficient equipment; as a result, manufacturing costs are $0.50 per meter less than at the El Paso plant. Due to the…arrow_forwardQuestion 15 Match the laser printing process step number with related term: Sweeping blade 1 2 3₂2 4 5 6 7 Cleaning Fusing roller cleaner Primary charging roller Fusing assemb Fusing Charging Stade charge c Exposing Developing Developing cylinder Transfer charging roller Processing Transferring ✓ [Choose ] Negative static charge laser positive static charge PCL magnet hot leftover toner [Choose] [Choose] [Choose] [Choose ]arrow_forwardFor the CMRR to be infinite what will be the condition?arrow_forward
- Nawras Tech assembles laptop computers from generic components. It purchases its colour monitors from a manufacturer in Taiwan with a lead time of one week. Daily demand for monitors is normally distributed with a mean of 30 monitors and a standard deviation of 8 monitors. The company has determined that the ordering cost is OMR 125 per order, the annual holding cost is OMR 25 per monitor, and the stockout cost is OMR 160 per lost sale. Currently, Nawras Tech accepts a 5% risk of stockout. Assume 350 days per year and 7 days in a week. a) Calculate the current fill rate. b) What is the annual cost of lost sales?arrow_forwardA 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.arrow_forwardPart 1. The Bavarian Motor Company (BMC) manufactures expensive luxury cars in Hamburg, Germany, and exports cars to sell in the United States. The exported cars are shipped from Hamburg to ports in Newark, New Jersey and Jacksonville, Florida. From these ports, the cars are transported by rail or truck to distributors located in Boston, Massachusetts; Columbus, Ohio; Atlanta, Georgia; Richmond, Virginia; and Mobile, Alabama. The below figure shows the possible shipping routes available to the company along with the transportation cost for shipping each car along the indicated path. Currently, 200 cars are available at the port in Newark and 300 are available in Jacksonville. The numbers of cars needed by the distributors in Boston, Columbus, Atlanta, Richmond, and Mobile are 100, 60, 170, 80, and 70, respectively. BMC wants to determine the least costly way of transporting cars from the ports in Newark and Jacksonville to the cities where they are needed. Formulate the LP and solve it…arrow_forward
- The IT department is about to create a network to connect all the computer terminals in their office. The floor plan is shown below: Determine the minimum length of cable wire required in the construction of the network in their office. How much will it cost the cable required if 1 meter of cable is 30 pesos?arrow_forward10. You've been asked to determine the shortest distance from each house to the pump before lay pipes. The committee also suggested that it would be better to have one common pipeline which covers each house in the Zone. 11. Redraw the diagram and draw the shortest path they could use to lay pipes. 12. Starting at the pipe, determine the minimum length of pipe needed. *Complete Solution and Drawingarrow_forwardCompany X has 2 factories - Plant 1 and 2. Plant 1 produces 150 units per day and Plant 2 produces 200 per day. The products are shipped by air to Customers A and B, both of which require 130 units/day. Because of the increasing cost of airfreight, Company X believes that it will be cheaper to send the products first to secondary warehouses located in C and D before being sent to the final destinations. Both C and D are used by the 2 plants and could also send products to each other. The cost of sending each product between locations is given in the following table: From To Wh C WhD A B Plant 1 8 13 25 28 Plant 2 15 12 Wh C 0 6 Wh D 6 0 26 25 16 17 Draw the transshipment diagram. 14 16 Develop the 2 transshipment tables and the corresponding transportation table.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
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