Please help me with part b Minimize Z =Subject to:5 XAB +8XAC +6 XAE0 XBB +4 XBC+12 XBE4 XCB +0 XCC +7XCE7 XDB +2XDC +5 XDE +12 XEB+7XEC+ OXEEXAB+XAC+XAE = 750XBB+XBC+XBE = 600XCB+XCC +XCE= 150XDB + XDC + XDE = 800XEB+XEC+XEE = 500+++ XDBXEB $1,000XAB XBB + XCBХАС + XBC Xcc+ XDCXEC ≤1,000XAE+XBE + XCE + XDE + XEE $1,000For all X₁, 20number of students in sector Anumber of students in sector Bnumber of students in sector Cnumber of students in sector Dnumber of students in sector E+b) Using a computer software for solving LP, the objective value at theMinimum number of total miles traveled (objective value) -school B capacityschool C capacityschool E capacitynon negativity conditionoptimal solution achieved is:(round your response to a whole number). The Hills County, Michigan, superintendent of education is responsible for assigning students to the three high schools inhis county. He recognizes the need to bus a certain number of students, for several sectors, A-E, of the county are beyond walking distance to a school. The superintendent partitions the county into five geographic sectorhe attempts to establish a plan that will minimize the total number of student miles traveled by bus. He also recognizes that if a student happens to live in a certain sector and is assigned to the high school in that sector, theis no need to bus him because he can walk to school. The three schools are located in sectors B, C, and E.The accompanying table reflects the number of high-school-age students living in each sector and the distance in miles from each sector to each school:Distance to SchoolSector School in Sector School in Sector School in SectorBсEABссDETotal50471284027612750Each high school has a capacity of 1,000 students.You have been asked to develop a linear programming model so as to minimize the total number of student miles traveled by bus.Decision variable X;;: Number of students living in sector i traveling to school located in sector.The number of decision variables for the model = 15.Number ofStudents7506001508005002,800

Decision Variable: Suppose-Xij be the no. of student living in the sector i travelling to school…

Minimize Z = Subject to: 5 XAB +8XAC +6 XAE 0XBB +4XBC +12 XBE + 4 XCB +0 XCC +7XCE 7 XDB +2 XDC +5 XDE + 12 XEB+ 7XEC+ OXEE XAB+XAC+XAE = 750 = 600 XBB + XBC+ +XBE XCB+XCC +XCE= 150 XDB + XDC+XDE = 800 XEB+XEC+XEE = 500 + XBB + XCB XAB XAC + XBC + XAE For all X₁, 20 number of students in sector A number of students in sector B number of students in sector C number of students in sector D number of students in sector E school B capacity school C capacity school E capacity ≤ 1,000 XDB + XEB Xcc + XDC + XEC ≤ 1,000 + XBE + XCE + XDE + XEE $1,000 non negativity condition b) Using a computer software for solving LP, the objective value at the optimal solution achieved is: Minimum number of total miles traveled (objective value) (round your response to a whole number).

Minimize Z = Subject to: 5 XAB +8XAC +6 XAE 0XBB +4XBC +12 XBE + 4 XCB +0 XCC +7XCE 7 XDB +2 XDC +5 XDE + 12 XEB+ 7XEC+ OXEE XAB+XAC+XAE = 750 = 600 XBB + XBC+ +XBE XCB+XCC +XCE= 150 XDB + XDC+XDE = 800 XEB+XEC+XEE = 500 + XBB + XCB XAB XAC + XBC + XAE For all X₁, 20 number of students in sector A number of students in sector B number of students in sector C number of students in sector D number of students in sector E school B capacity school C capacity school E capacity ≤ 1,000 XDB + XEB Xcc + XDC + XEC ≤ 1,000 + XBE + XCE + XDE + XEE $1,000 non negativity condition b) Using a computer software for solving LP, the objective value at the optimal solution achieved is: Minimum number of total miles traveled (objective value) (round your response to a whole number).

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor (NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once, and finishes at the warehouse to minimize the distance traveled. What is the route and the corresponding distance? Distances W 1 2 3 4 in miles 18 57 27 50 18 0 65 29 61 57 65 0 36 99 3 27 29 36 0 76 4 50 61 99 76 Route=W-1-3-2-4, Distance=182 miles Route=W-3-1-2-4-W, Distance=270 miles Route = W-3-1-2-4, Distance=220 miles Route=W-1-3-2-4-W, Distance=232 miles Route=W-1-3-4-2, Distance=272 miles 1, 2.
Cleveland Area Rapid Delivery (CARD) operates a delivery service in the Cleveland metropolitan area. Most of CARD's business involves rapid delivery of documents and parcels between offices during the business day. CARD promotes its ability to make fast and on-time deliveries anywhere in the metropolitan area. When a customer calls with a delivery request, CARD quotes a guaranteed delivery time. The following network shows the street routes available. The numbers above each arc indicate the travel time in minutes between the two locations. Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows 35 For all X;; = 0, 1. (a) Develop a linear programming model that can be used to find the minimum time required to make a delivery from location 1 to location 6. (Express your answers in the form where each Xij represents the arc from node i to node j as either 1 or Xijr 0.) 30 12 p.m. 3 Need Help? Read It 18 15 39 12 16 5 (b) How long (in minutes) does it take to…
a. A farmers' cooperative association plans to build a new sugar mill in Georgetown. The primary objective of the mill is to provide the farmers with a place to take their crop for processing that will reduce their transportation costs. The members of the co-op believe that the center-of-gravity method is appropriate for this objective. While there are over 200 sugar cane farms in the region, they are tightly clustered around six villages. Using the data below, use the center-of-gravity method to calculate the coordinates of the best location for this mill. All mileage references use Browns Town as (0,0). Village Barney Valley Blue Pasture Congo Valley Bower Rabacca Salem Miles East of Miles North of Sugar Cane Browns Town Browns Town 90 140 20 50 100 10 10 60 70 20 80 120 tonnage 240,000 320,000 450,000 120,000 60,000 140,000
eBook Problem 10-31 A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations. Calls are carried through cable lines and switching nodes. A portion of the company's transmission network is shown here. The numbers above each arc show the capacity in thousands of messages that can be transmitted over that branch of the network. To keep up with the volume of information transmitted between origin and destination points, use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a oty located at node 7. 3 Maximum number of messages -
Zara is a global clothing company based in Spain and it gives utmost importance to customer value, hence it tries to catch customer satisfaction in transportation. Zara expects the following points to be fulfilled by transport companies: The products must be reached to desired places on time, the products must be shipped without any damage or unwanted condition, the products must be carried to next channel level in a good condition. Additionally, Zara gives less weight to freight costs while determining product prices. Which of the followings is less important in transportation policy of Zara? Select one: a. Condition of goods b. Pricing c. Delivery performance d. Customer satisfaction
Define Vehicle routing problem (VRP). Explain its complications and variants. Define four different real-life problems that can be formulated as VRP. Explain their properties based on VRP variations.
Mount Isa Mines is one of the world’s great metal mines. Its main operations are at Mount Isa, in Queensland, Australia, where it mines adjacent deposits of copper and silver-lead-zinc ores. Production levels changes with world demand and prices, but in atypical year 7 million tonnes of ore are mined to give 150,000 tonnes of copper and lead (containing silver) and 200,000 tonnes of zinc. Mount Isa has serious transport problems. It produces huge quantities of ore in a remote area of Australia, while the main demand for finished metals is in the industrialised areas of the world, particularly Europe. The problem is to process the ores and move them to final markets as cheaply as possible. You can see the scope of the problem from an outline of the journey for copper, this starts with underground explosions to break up the ore body. The broken ore is collected by front-end loaders and put onto ore trains that carry it to underground crushers. The crushed ore is then hoisted to the…
3.Silicon Valley Transport Commission (SVTC) has a fleet of maintenance vehicles that includes cars, vans, and trucks. SVTC is currently evaluating four different approaches to help them maintain their fleet of cars and vans efficiently at the lowest possible cost. Their options are: (1) No preventive maintenance at all and repair vehicle components when they fail; (2) Take oil samples at regular intervals and perform whatever preventive maintenance is indicated by the oil analysis; (3) Perform an oil change on a regular basis on each vehicle and perform repairs when needed; (4) perform oil changes at regular intervals, take oil samples regularly, and perform maintenance repairs as indicated by the sample analysis. Option #1 costs nothing to implement and results in two possible outcomes: There is a .10 probability that a defective component will occur, requiring emergency maintenance at a cost of $1,200, or there is a chance that no defects will occur and no maintenance will be…
Morgan Trucking Company operates a special pickup and delivery service between Chicago and six other cities located in a four-state area. When Morgan receives a request for service, it dispatches a truck from Chicago to the city requesting service as soon as possible. With both fast service and minimum travel costs as objectives for Morgan, it is important that the dispatched truck take the shortest route from Chicago to the specified city. Assume that the following network (not drawn to scale) with distances given in miles represents the highway network for this problem. Chicago 1 36 31 21 2 3 9 10 11 21 4 13 Find the shortest-route distance from Chicago to node 6. 6 5 6 16 6 21 7
Solve the following case study using the transportation method:Suppose there is a manufacturing company that produces and distributes its products to various customer locations across the country. This company has three production plants (Plant A, Plant B, and Plant C) located in different locations, and there are also five distribution centers (DC 1, DC 2, DC 3, DC 4, and DC 5) scattered across various regions. Sources Distribution Center DC 1 DC 2 DC 3 DC 4 Capacity Plant A $145 $150 $165 $140 2000 Plant B $175 $135 $120 $165 1250 Plant C $113 $156 $134 $148 1250 Demand 1000 1200 1400 900 The company's goal is to determine the most efficient transportation routes for delivering products from the plants to the distribution centers, considering transportation costs and available capacities.
4.Silicon Valley Transport Commission (SVTC) has a fleet of maintenance vehicles that includes cars, vans, and trucks. SVTC is currently evaluating four different approaches to help them maintain their fleet of cars and vans efficiently at the lowest possible cost. Their options are: (1) No preventive maintenance at all and repair vehicle components when they fail; (2) Take oil samples at regular intervals and perform whatever preventive maintenance is indicated by the oil analysis; (3) Perform an oil change on a regular basis on each vehicle and perform repairs when needed; (4) perform oil changes at regular intervals, take oil samples regularly, and perform maintenance repairs as indicated by the sample analysis. Option #1 costs nothing to implement and results in two possible outcomes: There is a .10 probability that a defective component will occur, requiring emergency maintenance at a cost of $1,200, or there is a chance that no defects will occur and no maintenance will be…
John Clooney, a bush pilot in Alaska, makes regular charter flights in his floatplane to various towns and cities in western Alaska. His passengers include hunters, fishermen, backpackers and campers, and tradespeople hired for jobs in the different localities. He also carries some cargo for delivery. The following network shows the possible air routes between various towns and cities John might take (with the times, in hours). For safety reasons, he flies point-to-point, flying over at least one town along a route, even though he might not land there. In the upcoming week John has scheduled charter flights for Kotzebue, Nome, and Stebbins. Determine the shortest route between John’s home base in Anchorage and each of these destinations.