please answer within 30 minutes. The AC company decides to open a new factory to satisfy increasing demand.They already have four plants, (A, B, C and D) and want to open a new one in site E or F.FactoryСараcityA20,00050,000C35,00070,000The capacity of the new plant is going to be 40.000 unitsThe company distributes to the following wharehouses:ExpectedWharehouseAnnualDemandW180,000W250,000W370,000The Logistics department compiled the following cost table specifying the cost per unit to ship the product from each plant to each warehouse:PlantWarehouseW1W2W312214C4512E1F54Evaluate wich site E or F is more convenient.

Logistics management is described as the process or means of seamlessly moving raw materials, parcel…

Answered: The AC company decides to open a new…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section: Chapter Questions

Problem 80P

See similar textbooks

Similar questions

A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 25x2 + 15x3+ 35x4s.t. 8x1 + 11x2 + 6x3 + 6x4 ≤ 17 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 25x2 + 15x3+ 35x4s.t. 8x1 + 11x2 + 6x3 + 6x4 ≤ 17 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = 0, 1 Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? Location 1 will Answer Location 2 will Answer Location 3 will Answer Location 4 will Answer What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) Net present value Answer How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.) Available capital Answer
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 15x2 + 15x3+ 30x4s.t. 7x1 + 13x2 + 11x3 + 10x4 ≤ 20 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected?
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 35x1 + 25x2 + 15x3+ 30x4s.t. 7x1 + 8x2 + 7x3 + 13x4 ≤ 18 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions:
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 30x1 + 30x2 + 25x3+ 20x4s.t. 5x1 + 10x2 + 8x3 + 12x4 ≤ 22 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwise xj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)
The Acme Company operates four factories that ship products to five warehouses. The shipping costs, requirements capacities, and optimal allocations are shown below. Factory Shipping Cost per Case to Warehouses Capacity W1 W2 W3 W4 W5 F1 $1.50 $4.50 $6.00 $7.50 $9.00 40,000 30,000 10,000 F2 $3.00 $3.00 $1.50 $6.00 $7.50 30,000 25,000 5,000 F3 $1.50 $7.50 $1.50 $4.50 $1.50 30,000 10,000 20,000 F4 $7.50 $3.00 $6.00 $7.50 $6.00 25,000 25,000 Demand 30,000 35,000 25,000 15,000 20,000 125,000 What is the total cost of the optimal solution? Total cost = $nothing. (Enter your response to the nearest dollar.)
Please do not give solution in image formate thanku. Hoosier Power needs to determine a capacity expansion plan to meet Bloomington’s power needs for the next 20 years. The current capacity is 5,000 kWh. The demand for the current year is 4,000 kWh, and demand is expected to increase by 1,000 kWh in each succeeding year. At the beginning of each year, Hoosier Power must determine the amount of capacity to add, given the following inputs: Any year in which capacity is added, a fixed cost of $120,000 is incurred plus a cost of $120 per kWh of capacity; At most 10,000 kwh of capacity can be added in a single year; It costs $24 per year to maintain a unit of capacity; It costs $12 per year to produce one kWh; If production does not meet demand, a shortage cost of $75 per kWh short is incurred. Hoosier Power wants to determine a capacity expansion plan with the minimal total cost to meet Bloomington’s power needs for the next 20 years. Define the decision variables and write down the…
Formulate a system of equations for the situation below and solve.Cantwell Associates, a real estate developer, is planning to build a new apartment complex consisting of one-bedroom units and two- and three-bedroom townhouses. A total of 204 units is planned, and the number of family units (two- and three-bedroom townhouses) will equal the number of one-bedroom units. If the number of one-bedroom units will be 3 times the number of three-bedroom units, find how many units of each type will be in the complex. one-bedroom units units two-bedroom townhouses units three-bedroom townhouses units
Mr. Smith is a rentier, he lives on renting apartments. However, these days he has to sell one of his apartments to get a big money. He hesitates which of three apartments of his to sell. Help Mr. Smith to make the right decision if you know the following: The present prices per m2 in the three locations equal: A) 4000, B) 5000, C) 6000 goldies, respectively. However, the long-run prices of those real estates are: A) 5000, B) 6000, and C) 7000 goldies, whereas the respective standard deviations are A) 400, B) 500, and C) 250 goldies.
A company has three plants at location A,B and C which produce the same product. It has to supply this to buyers located at P, Q and R. The weekly plant capacities for A, B and C are 250, 800 and 350 units respectively, while the buyer requirements are 700, 200 and 500 for P, Q and R respectively. The unit shipping cost (in Ksh) are given as Plant Buyer P Buyer Q Buyer R A 8 4 10 B 9 7 9 C 6 5 8 Determine the distribution for the company so as to minimize the cost of transportation using least cost method.
The High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows: Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations. a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system? b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?
Paul Bergey is in charge of loading cargo ships for International Cargo Company (ICC) at the port in Newport News, Virginia. Paul is preparing a loading plan for an ICC freighter destined for Ghana. An agricultural commodities dealer wants to transport the following products aboard this ship. Commodity A B C D Amount Available (tons)4,8002,5001,2001,700 Volume per Ton (cubic feet) 40256055 Profit per Ton ($)70506080 Paul can elect to load any and/or all of the available commodities. However, the ship has three cargo holds with the following capacity restrictions. Cargo Hold Forward Center Read Weight Capacity (tons) 3,000 6,000 4,000 Volume Capacity (cubic feet) 145,000 180,000 155,000 More than one type of commodity can be placed in the same cargo hold. However, because of balance considerations, the weight in the forward cargo hold must be within 10% of the weight in the rear cargo hold, and the center cargo hold must be between 40% and 60% of the total…

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS