Proctoring Enabled: Chapter 6 Network Optimization Pro... OSavedHelpSave & ExXYZ Corporation operates two plants, each of which has a capacity of 200 units per day. Each day, XYZ must ship their product toeach of four customers. Customers A, B, and C each have a demand of 17 units per day while customer D has a demand of 349 unitsper day. The cost of shipping one unit of each product from each of the two plants to each of the customers is shown in the tablebelow.Customer ACustomer BCustomer CCustomer DPlant 113141514Plant 224201412a. How many units should XYZ ship from each plant to each customer? (Leave no cells blank-be certain to enter "O" whereverrequired. Round your answer to the nearest whole number.)Customer ACustomer BCustomer CCustomer DPlant 1Plant 2b. What is the least XYZ will spend on shipping each day? (Round your answers to 2 decimal places.)Least XYZMcGrawHill< Prev5 of 5NersHUAWEIPrtscInsEsc* F2F1F3F4F5F6F7F8F9F10F122#2$&134.6789TabQWERYCapsDHJKL>CVBFnAltAltCtrl

We have to allocate number of units to minimize cost of shipping.

Answered: Proctoring Enabled: Chapter 6 Network…

A First Course in Probability (10th Edition)

10th Edition

ISBN:9780134753119

Author:Sheldon Ross

Publisher:Sheldon Ross

Chapter1: Combinatorial Analysis

Section: Chapter Questions

Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...

See similar textbooks

Similar questions

Answer the question below.
Infotron Inc makes electronic hockey and soccer games. Each hockey game requires 2 labor-hours of assembly and 2 labor-hours of testing. Each soccer game requires 3 labor-hours of assembly and 1 labor-hour of testing. Each day there are 48 labor-hours available for assembly and 36 labor-hours available for testing. How many of each game should Infotron produce each day to maximize its total daily output?
i need the answer quickly
Suppose a furniture builder has two models of a bookcase: standard and artisan. The standard model requires 5 hours to assemble and 1 hours for finishing touches. The artisan model requires 2 hours to assemble and 4 hours for finishing touches. Based on their current staffing, they can manage a maximum number of assembly hours available is 50 per day, and the maximum number of finishing hours available is 64 per day. Let x = the number of standard model bookcases produced per day and y = the number of artisan model bookcases produced per day. Write the system of inequalities that represents the maximum number of bookcases that can be produced in one day. 0 Graph the system of inequalities, remember to include x >0 and y > 0 in your graph to get full credit. You will need to include four lines. 25 24 VI
chocolate manufacture sells three types of chocolate: A, B, and C. All three types require Milk and choco but types 2 & 3 require peanuts also. Each unit of A requires 1 unit of milk and 2 units of choco. Each unit of B needs 1 unit of milk, 3 units of choco, and 40 grams of peanuts. Each unit of C requires 1 unit of milk, 1 unit of choco and 50 grams of peanuts. Each working day, the company has 25 units of milk, 50 units of choco and 1.5 kilograms (Kg) of peanuts. The time required to manufacture each unit of A is 20 minutes, each unit of B is 25 minutes, and each unit of C is 30 minutes. The cost of each unit of milk is $0.5, each unit of choco is $1.5, and each 1 Kg of peanuts is $5. The company sells each unit of A at $4, each unit of B at $6, and each unit of C at $8. Each working day, the manufacture has 4 hours available for making all three types of chocolate. Formulate an LP that can be used to maximize the manufacture daily profit? (DO NOT SOLVE).
A company uses four special tank trucks to deliver four different gasoline products to customers. Eachtank has five compartments with capacities: 500, 750, 1200, 1500, and 1750 gallons. The daily demands forthe four products are 10000, 15000, 12000, and 8000 gallons. Any quantities that cannot be delivered by thecompany’s four trucks must be subcontracted at the additional costs of 5, 12, 8, and 10 cents per gallon forproducts 1, 2, 3, and 4, respectively. The goal is to develop the optimal daily loading schedule for the fourtrucks that will minimize the additional cost of subcontracting. Formulate this problem as an integer linearprogram, and solve it using linear program solver.
A company manufactures a product at its plants in A, B, and C, then ships the product to six customers in G, H, J, K, and L, The monthly capacity of plants A, B, and Care 7400, 7300, and 10000 units, respectively. The monthly demand from customers G, H, J, K, and Lare 3000, 500, 4600, 7500, and 8900 units, respectively. Use Excel Solver to find the optimal distribution plant that will give the lowest total monthly shipping cost if the shipping cost per unit (in dollars per unit) are as follows: - from A to G, H, J, K, and L are 4, 9, 20, 6, and 13 dollars per unit, respectively; from B to G, H, J, K, and L are 12, 7, 3, 10, and 6 dollars per unit, respectively; from C to G, H, J, K, and L are 7, 6, 12, 2, and 9 dollars per unit, respectively. - The optimal total shipping costs is dollars per month.
A bakery gets milk from two dairies then blends the milk to get the desired amount of butterfat for use in the company's best selling product. Milk from dairy I costs $2.10 per gallon, and milk from dairy Il costs $0.70 per gallon. The company has at most $140 available for purchasing milk. Dairy I can supply at most 54 gallons of milk averaging 3.8% butterfat and dairy II can supply at most 88 gallons of milk averaging 3.2% butterfat. The blend can contain no more than 100 gallons of milk and should contain the maximum amount of butterfat. (a) Let x be the number of gallons of milk from dairy I and let y be the number of gallons of milk from dairy II. State the objective function. Maximize z= (b) Excluding nonnegativity constraints, how many constraints are needed for this model? (b) How much milk from each dairy should the bakery use? Round your answers to the nearest integer as needed. gallons from dairy I and gallons from dairy II. (c) What is the maximum amount of butterfat? Round…
Firms Alpha and Beta serve the same market. They have constant average costs of $2 per unit. The firms can choose either a high price ($10) or a low price ($5) for their output. When both firms set a high price, total demand is 10,000 units which is split evenly between the two firms. When both set a low price, total demand is 18,000, which is again split evenly. If one firm sets a low price and the second a high price, the low priced firm sells 15,000 units, the high priced firm only 2,000 units. Analyze the pricing decisions of the two firms as a non-cooperative game. Derive the dominant strategy equilibrium of this game. Explain why this is an example of the prisoners’ dilemma game.
A factory manufactures three products, A, B, and C. Each product requires the use of two machines, Machine I and Machine II. The total hours available, respectively, on Machine I and Machine Il per month are 7,760 and 10,080. The time requirements and profit per unit for each product are listed below. ABC Machine I 7 9 10 Machine II 8 10 16 $12 $16 $22 Profit How many units of each product should be manufactured to maximize profit, and what is the maximum profit? Start by setting up the linear programming problem, with A, B, and C representing the number of units of each product that are produced. Maximize P = subject to: <7,760 s 10,080 Enter the solution below. If needed round numbers of items to 1 decimal place and profit to 2 decimal places. The maximum profit is $ when the company produces: units of product A units of product B units of product c

Recommended textbooks for you

A First Course in Probability (10th Edition)

Probability

ISBN:

9780134753119

Author:

Sheldon Ross

Publisher:

PEARSON

A First Course in Probability

Probability

ISBN:

9780321794772

Author:

Sheldon Ross

Publisher:

PEARSON

A First Course in Probability (10th Edition)

Probability

ISBN:

9780134753119

Author:

Sheldon Ross

Publisher:

PEARSON

A First Course in Probability

Probability

ISBN:

9780321794772

Author:

Sheldon Ross

Publisher:

PEARSON

SEE MORE TEXTBOOKS