In the following problem where the maximum amount of material that can float through any arc is given, we need to maximise the flow of material through the network by formulating it as an LPP. How would you proceed? Vancouver 3-2007057 13 Edmonton Saskatoon V₁ V₂ Calgary 12 14 on 21030-80 20 1/₂ VA Regina Winnipeg *1kc21030-81268-2023/03/11-2021kc21030-81260 7021kc21030-81268-

In the following problem where the maximum amount of material that can float through any arc is given, we need to maximise the flow of material through the network by formulating it as an LPP. How would you proceed? Vancouver 3-2007057 13 Edmonton Saskatoon V₁ V₂ Calgary 12 14 on 21030-80 20 1/₂ VA Regina Winnipeg *1kc21030-81268-2023/03/11-2021kc21030-81260 7021kc21030-81268-

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

T-Shirts Unlimited is a retailer that sells every kind of T-shirt imaginable. The different types of T-shirts are stored in departments that all take up the same amount of space. The available warehouse space is shown in the figure below. storage storage storage DOCK AISLE storage storage storage A from–to matrix showing the number of trips to and from each department is given below. From-To Matrix for T-Shirts Unlimited Department Category Trips to andfrom Dock 1 Sports T-Shirts 47 2 Men's T-Shirts 41 3 Women's T-Shirts 61 4 Children's T-Shirts 43 5 Fashion T-Shirts 63 6 Undershirts 58 Help T-Shirts Unlimited decide where to store each type of T-shirt. Fill the blanks with department numbers. (If two answers are acceptable, locate the greater numbers in the top row). enter an appropriate number enter an appropriate number enter an appropriate number…
The starting node of the shortest path problem has a supply out flow value of -1 in the LP model. True False (Don't hand writing solution)
Suppose that shipments are not allowed between warehouse 1 and store 2 or between warehouse 2 and store 3. What is the easiest way to modify the spreadsheet so that you can solve this modified problem?a) Assign arbitrarily small costs such as $0.01 to the arcs representing these flows.b) Assign arbitrarily large costs such as $999 to the arcs representing these flows.(I picked option b, which is correct) What is the optimal solution to the modified problem?
fertilizer manufacturer has to fulfill supply contracts to its two main customers (650 tons to Customer A and 800 tons to Customer B). It can meet this demand by shipping existing inventory from any of its three warehouses. Warehouse 1 (W1) has 400 tons of inventory onhand, Warehouse 2 (W2) has 500 tons, and Warehouse 3 (W3) has 600 tons. The company would like to arrange the shipping for the lowest cost possible, where the per-ton transit costs are as follows: W 1 W 2 W 3 Customer A $7.50 $6.25 $6.50 Customer B $6.75 $7.00 $8.00 Write the objective function and the constraint in equations. Let Vij= tons shipped to customer i from warehouse j, and so on. For example, VA1=tons shipped to customer A from warehouse W1. This exercise contains only parts b, c, d, e, and f. Part 2 b) The objective function for the LP model =
each Distributors packages and distributes industrial supplies. A standard shipment can be packaged in a class A container, a class K container, or a class T container. A single class A container yields a profit of $10; a class K container, a profit of $8; and a class T container, a profit of $12. Each shipment prepared requires a certain amount of packing material and a certain amount of time. Formulate and solve this problem using LP software. Resources Needed per Standard Shipment Class of Container Packing Material (pounds) Packing Time (hours) A 2 2 K 1 6 T 3 4 Total amount of resource available per week 120 pounds 210 hours Hugh Leach, head of the firm, must decide the optimal number of each class of container to pack each week. He is bound by the previously mentioned resource restrictions but also decides that he must keep his 6 full-time packers employed all 210 hours (6 workers × 35 hours)…
Seven types of packages are to be delivered by fivetrucks. There are three packages of each type, and thecapacities of the five trucks are 6, 4, 5, 4, and 3 packages,respectively. Set up a maximum-flow problem that can beused to determine whether the packages can be loaded sothat no truck carries two packages of the same type.
Oranges are grown, picked, and then processed and pack-aged at distribution centers in Tampa, Miami, and Fresno. These centers supply oranges to markets in New York,Philadelphia, Chicago, and Boston. The following tableshows the shipping costs per truckload ($100s), supply,and demand: Because of an agreement between distributors, ship-ments are prohibited from Miami to Chicago. Solve this problem. to Newfrom York Philadelphia Chicago Boston SupplyTampa $ 9 $14 $12 $17 300Miami 11 10 6 10 200Fresno 12 8 15 7 250Demand 160 210 130 180
Pete Morton is planning to go to graduate school in a program of study that will take three years. Pete wants to have $13,000 available each year for various school and living expenses. If he earns 8 percent on his money, how much must be deposited at the start of his studies to be able to withdraw $13,000 a year for three years? (Exhibit 1-A, Exhibit 1-B, Exhibit 1-C, Exhibit 1-D)
Suppose the total flow into a node of a network isrestricted to 10 units or less. How can we represent thisrestriction via an arc capacity constraint? (This still allowsus to use the Ford–Fulkerson method to find the maximumflow.)
A retail chain has 8 stores in a region supplied from 3 supply sources. Trucks have a capacity of 25,000 units and cost $1,200 per load plus $48 per delivery. The cost of holding one unit in inventory at retail for a year is $1.5. The managers will set up milk runs from suppliers to retail stores. Assume that all trucks travel full. Suppliers are considering whether to run a milk run to 2 stores or 4 stores on each truck. Which network should be chosen if annual sales for each product at each retail store are 150,000 units?
Suppose you are planning a road trip (by car) from San Francisco to New York City. You will need to do some research to review distances between the nodes (stops) and the fact that on the way there, you are required to stop in Nashville, Tennessee. Here are other factors to consider when developing your shortest-route: You can only drive at the average speed of 65 MPH The actual driving limit is 9-hour per day You are only allowed to drive during daylight hours Based on your shortest-route model: How many total one-way miles from San Francisco to New York by way of Nashville? How many hours of driving and how many total days? Share a significant take-a-way from this exercise.
According to Colias'a WSJ article in August 17, 2021, Ford and Volkswagen want to shift how they sell vehicles in USA. They are moving toward a model, where customers build and order vehicles through the website and then pick them up at dealerships. This so-called build-to-order model would help cut inventory costs for the company and its dealers. This approach is the norm in Europe, it is unfamiliar to American car shoppers, who are accustomed to picking a vehicle from rows of shiny sheet metal and driving it home that day. Discuss why both companies would like to make changes in how they sell cars? Compare both traditional and build-to-order approaches and evaluate built-to-order approach from the perspectives of (a) Ford, (b) its dealers, and (c) its customers, and let me know if this new approach would be successful its not an essay I need only answer