Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3, Problem 57RP
Explanation of Solution
LP to minimize the cost:
- Assume the following,
- Let “LA” be the gallons purchased at Los Angeles.
- Let “MI” be the gallons purchased at Miami.
- Let “HT” be the gallons purchased at Houston.
- Let “NY” be the gallons purchased at New York.
- Let “HL” be the gallons on hand while landing in LA.
- Let “HM” be the gallons on hand while landing in Miami.
- Let “HH” be the gallons on hand while landing in Houston.
- Let “HN” be the gallons on hand while landing in New York.
- The Linear
Programming (LP) to minimize the fuel cost is as follows,
- The above function subject to the following conditions,
- “
- “
- “
- “
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Limits 15, 128 MB
We all know about the recent flood in Sylhet. Every area of Sylhet can be expressed with a number. If there are n number of areas in Sylhet then they can be expressed as 1, 2, 3...n-1,n. Where the
area is located after the (1) area. Volume of each area of Sylhet is 1 meter. A few dams have been constructed in certain areas in Sylhet. Each dam is pre-planned to be built at a certain height so
that the flood water cannot completely inundate the city Flood water will enter through the 1, area. The height of the dam in the area is B, meter. If the water level in area i is greater than B
meter then the remaining water will flow in (i+1), area. Due to the good communication system of Sylhet, people can move from one area to another before any danger
Sylhet is the city of rain. Every area has some tall buildings built to deal with the flood problem. The building in the fen area has H, floors and each floor has a height of 1meter. Due to the weather
forecast people can know…
Two buses, X and Y, start their journey at the same time on a 950 km route.
Bus X gives a 1-hour break after every 3 hours' drive. So, it is at rest at the 4th, 8th, 12th, 16th, 20th,
... hours.
Bus Y gives a 1-hour break after every 4 hours' drive. So, it is at rest at the 5th, 10th, 15th, 20th,
25th,... hours.
You are given the speeds of the two buses Vx and Vy as 80 and 75, respectively.
Write a program that does the following:
•
Evaluate and display at the end of every hour the distance traveled by each bus.
When either one of the buses reach their destination, the evaluations terminate.
Depending on whether X or Y or both reach their destination in the last hour, display one
of the following messages before stopping (where n is the number of hours):
o
"Within hour n, bus X reaches its destination."
"Within hour n, bus Y reaches its destination."
o "Within hour n, both buses reach their destinations."
Sample screen output:
After hour 1, X is at 80 km, Y is at 75 km.
After hour 2, X…
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 3 Solutions
Operations Research : Applications and Algorithms
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Similar questions
- Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where iarrow_forwardProblem 2: For each of the following numbers, state the base in use; that is, what is p, q, r, s? (10 points) 100001, = 3310 • 25q = 1310 25, = 2310 255 = 3710arrow_forwardThe liquid-liquid extraction process carried out at the Electrochemical Materials Laboratory involves the extraction of nickel (Ni) from the liquid phase into an organic phase. Data from laboratory experiments are given in the table below. Ni phase cair, a (gr/l) 2 2,5 3 Ni phase organik, g (gr/l) 8,57 10 12 Assume that a is the amount of Ni in the liquid phase, and g is the amount of Ni in the organic phase. Quadratic interpolation is used to estimate the value of g, which is given by the following formula: g = x1a? + x2a + x3 a. Find three simultaneous equations based on the data given by the experimental results. b. Use the Gauss Elimination method to get the values of x1, x2 and x3 and then estimate the amount of Ni in the organic phase, if 2.3 g/l of Ni is available in the liquid phase. c. Use the LU Decomposition method to get the values of x1, x2 and x3. and then estimate the amount of Ni in the organic phase, if 2.3 g/l of Ni is available in the liquid phase.arrow_forwardA group of n tourists must cross a wide and deep river with no bridge in sight. They notice two 13-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?arrow_forwardThe Dash Cell Phone company charges customers a basic rate of $10 per month to send text messages. Additional rates are as follows:• the first 100 messages per month, regardless of message length, are included in the basic bill.• An additional 3 cents are charged for each text message after the 100th message, up to and including 300 messages.• An additional 2 cents are charged for each text message after the 300th message.• Federal, state, and local taxes add a total of 14% to each bill.Design a flow chart and pseudocode for the following:• a program that accepts the following data about one person’s messages: area code (3 digits), phone number (7 digits), and a number of text messages sent. Display all data, including the month end bill before both and after taxes are added. NOTE: Code C++arrow_forwardAl Watan supermarket has hire-purchases scheme for locals and expats. The customers will get the credit facility if they satisfy any of the following conditions: The customer must hold the present job for more than 5 years and reside in the same place at least for 3 years. In this case, the customer will get credit upto rupees 300 omr. The monthly salary of the customer must exceed 1000 omr and must hold the present job for more than 5 years. In this case credit will be given upto rupees 500 omr. The monthly salary must exceed 1000 omr and reside at the same place at least for 3 years. In this case credit will be given upto 500 omr. In the case, the customer’s monthly salary exceeds 1000 omr, holds the present job for more than 5 years and also reside in the same place at least for the 3 years, the credit facility will be upto 1000 omr The credit facility is rejected for all other customers. Prepare a Decision Table for this hire- purchase schemearrow_forwardplease solve in a quarter of an hour and they came An electricity distribution company wants to calculate the electricity fee to be paid by the subscriber according to the type of electricity usage place (Residential: u or U, Workplace: p or P) as follows; In workplaces; 3.78TL for each kilowatt-hour (kwh), In residences Up to the first 60 kWh, each kWh is 2.98 TL, Then, up to 120 kWh, each kWh is 3.62 TL, For more (more than 100 kWh), it charges 2.56 TL for each kWh. Using the C programming language, write an electricity bill calculation program in accordance with the rules below. 1-Use the switch.case structure while writing the program. 2-First, we ask the user for the 6-digit subscriber number. The user will enter a random 6-digit number after the program runs. 3- After entering the usage type, the first and last meter reading values will be entered randomly from the keyboard. Here, the first read value cannot be greater than the last read value. Create a blocking line for this…arrow_forwardThe Mayfree Appliance Company requires sheet metal for its appliances. The company can purchase long coils of sheet metal in two different widths: 65 inches and 40 inches. The company must purchase the coils by linear foot of length: $1.20 per foot for a 64-inch coil and $1.00 per foot for a 40-inch coil. (This implies that a square foot, say, of the wider coil is less expensive.) Up to 4000 feet of the 65-inch coil is available, and up to 6000 feet of the 40-inch coil is available. There are manufacturing requirements for six different widths: 50, 45, 40, 35, 20, and 10 inches. Mayfree’s requirements are expressed as lengths of the various widths. The company requires 1000 feet of 50-inch width, 2500 feet of 45-inch width, 3000 feet of 40-inch width, 2300 feet of 35-inch width, 1300 feet of 20-inch width, and 2000 feet of 10-inch width. Determine how much of each width coil Mayfree should purchase and how it should cut the coils into various widths to meet its requirements at minimal…arrow_forwardThe public utilities commission has decided that the electric company overcharged its customers for two months last year. To make up the difference to the customers, the commission orders the company to decrease each of the next month’s bills by 10%. The city also levies a 3%utility tax, which is to be applied to the bill before it is discounted. Also, the10% discount does not apply to the utility tax. Assume electricity costs $0.16per kilowatt-hour. Write a program to compute the next month’s electricity bill given the number of kilowatt-hours consumed as inputarrow_forward5. Determine the overall resistance of a 100-meter length of 14 AWA (0.163 cm diameter) wire made of the following materials. a. copper (resistivity = 1.67x10* Q•m) b. silver (resistivity = 1.59x10 Q•m) c. aluminum (resistivity = 2.65x10* Q•m) d. iron (resistivity = 9.71x10* Q•m)arrow_forwardYou are given the arrival and departure times of trains reaching to a particular station. You need to find minimum number of platforms required to accommodate the trains at any point of time. Trains arrival [9:00, 9:40, 9:50, 11:00, 15:00, 18:00] Trains departure = [9:10, 12:00, 11:20, 11:30, 19:00, 20:00] The situation can be solved by using few algorithms. However, it will reflect the complexity of the solution. You are required to solve the problem using, (a) Brute Force Algorithm i) Produce the complete algorithm ii) Calculate the minimum number of platforms based on algorithm in (a)(i) and show the process. (b) Greedy Algorithm i) Produce the complete algorithm ii) Calculate the minimum number of platforms based on algorithm in (b)(i) and show the process. Answer part C only (c) Determine the complexity for both Brute Force and Greedy Algorithm for particular problem based on the processes. Justify your answers.arrow_forwardA detachment of n soldiers must cross a wide and deep river with no bridge in sight. They notice two 12-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one soldier. How can the soldiers get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_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