A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; componentB requires 3 hours of fabrication and 1 hour of assembly; and component C requires 2 hours of fabrication and 2 hours of assembly. The company has up to 1,100labor-hours of fabrication time and 900 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, $8, and $10, respectively.How many components of each type should the company manufacture each week in order to maximize its profit (assuming that all components manufactured can besold)? What is the maximum profit?Let x, x2, and X3 be the numbers of components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linearprogramming problem.Мaximize P-subject toFabrication time restrictionAssembly time restrictionX1, X2, Хз 20Enter your answer in the edit fields and then click Check Answer.partremaining1Clear AllCheck AnswerVIVI

Let, x1, x2 and x3 be the numbers of components A, B and C. Then total number of components isx1 +…

Answered: A small company manufactures three…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

A company manufactures paring knives and pocket knives. Each paring knife requires 3 labor-hours, 7 units of steel, and 4 units of wood. Each pocket knife requires 6 labor-hours, 5 units of steel, and 3 units of wood. The profit on each paring knife is $3, and the profit on each pocket knife is $5. Each day the company has available 102 labor-hours, 157 units of steel, and 123 units of wood. Suppose that the number of labor-hours that are available each day is increased by h. For what values of h will a change of h labor-hours not change the shadow price of labor? The shadow price of labor will not change for shs. (Simplify your answers.)
erth Mining Company operates two mines for the purpose of extracting gold and silver. The Saddle Mine costs $15,000/day to operate, and it yields 65 oz of gold and 2900 oz of silver each day. The Horseshoe Mine costs $15,500/day to operate, and it yields 70 oz of gold and 1300 oz of silver each day. Company management has set a target of at least 540 oz of gold and 16,800 oz of silver. How many days should each mine be operated so that the target can be met at a minimum cost? Saddle- Days Horseshoe- Days Minimum Cost-
A company wishes to produce two types of souvenirs: Type A and Type B. Each Type A souvenir will result in a profit of $1, and each Type B souvenir will result in a profit of $1.20. To manufacture a Type A souvenir requires 2 minutes on Machine I and 1 minute on Machine II. A Type B souvenir requires 1 minute on Machine I and 3 minutes on Machine II. There are 3 hours available on Machine I and 5 hours available on Machine II. (a) The optimal solution holds if the contribution to the profit of a Type B souvenir lies between $ and $ . (Enter your answers from smallest to largest.)(b) Find the contribution to the profit of a Type A souvenir (with the contribution to the profit of a Type B souvenir held at $1.20), given that the optimal profit of the company will be $208.80.$ (c) What will be the optimal profit of the company if the contribution to the profit of a Type B souvenir is $2.00 (with the contribution to the profit of a Type A souvenir held at $1.00)?$
Kane Manufacturing has a division that produces two models of grates, model A and model B. To produce each model A grate requires 3 pounds of cast iron and 6 minutes of labor. To produce each model B grate requires 4 pounds of cast iron and 3 minutes of labor. The profit for each model A grate is $1.75, and the profit for each model B grate is $1.25. Available for grate production each day are 1000 pounds of cast iron and 20 labor-hours. Because of an excess inventory of model A grates, management has decided to limit the production of model A grates to no more than 180 grates per day. Maximize P = 1.75x + 1.25y subject to 3x + 4y ≤ 1000 Resource 1 6x + 3y ≤ 1200 Resource 2 x ≤ 180 Resource 3 y ≥ 0 x ≥ 0 (a) Find the shadow price for Resource 2. (Round your answer to the nearest cent.)$ (b) Identify the binding and nonbinding constraints. constraint 1 constraint 2 constraint 3
A manufacturer produces two models of toy airplanes. It takes the manufacturer 32 minutes to assemble model A and 8 minutes to package it. It takes the manufacturer 20 minutes to assemble model B and 10 minutes to package it. In a given week, the total available time for assembling is 3200 minutes, and the total available time for packaging is 960 minutes. Model A earns a profit of $10 for each unit sold and model B earns a profit of $8 for each unit sold. Assuming the manufacturer is able to sell as many models as it makes, how many units of each model should be produced to maximize the profit for the given week? Note that the ALEKS graphing calculator can be used to make computations easier. k trol Model A: unit(s) Model B: unit(s) Continue 1 Q A 2 option X NO 2 Z W S 5 # 3 ME P X E H command $ 4 D 9 R C % 5 F T A V 6 FO G Y 8 7 B Submit A © 2023 McGraw HRLLC Al Rights Reserved forms of Use | Plicy Center the # WY 8 U Deft FN J N 3 9 K M O < P 1 g
A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; component B requires 3 hours of fabrication and 1 hour of assembly; and component C requires 2 hours of fabrication and 2 hours of assembly. The company has up to 900 labor-hours of fabrication time and 700 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, $8, and $10, respectively. How many components of each type should the company manufacture each week in order to maximize its profit (assuming that all components manufactured can be sold)? What is the maximum profit? Let x₁, x2, and x3 be the numbers of components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linear programming problem. Maximize P=[ subject to X1, X₂, X3 20 The company should manufacture (Simplify your answers.) Fabrication time restriction Assembly time restriction…
Suppose that a small company produces two different models of kayaks. A larger model and smaller model. The larger model requires 2 hours of manufacturing, 2 hours for assembly and 3 hours for packaging. The smaller model requires 2 hours for manufacturing, 1 hour for assembly and 2 hours for packaging. Each week the company has 120 hours available for manufacturing, 80 hours available for assembly and 132 hours available for packaging. If the company makes a profit of $75 for each of the larger model manufactured and profit of $60 for each smaller model manufactured, how many of each model should the company produce in order to maximize profit ?
Q: The Morton Supply Company produces clothing, footwear, and accessories for dancing and gymnastics. They produce three models of pointe shoes used by ballerinas to balance on the tips of their toes. The shoes are produced from four materials: cardstock, satin, plain fabric, and leather. The number of square inches of each type of material used in each model of shoe, the amount of material available, and the profit/model are shown below: Material (measured in square inches) Model 1 Model 2 Model 3 Material Available Cardstock 12 10 14 1200 Satin 24 20 15 2000 Plain fabric 40 40 30 7500 Leather 11 11 10 1000 Profit per model $50 $44 $40 a) Generate the Answer Report using SOLVER in EXCEL. Then, clearly answer what is the optimal solution? What is the resulting profit? b) Generate the Sensitivity Report for the model that you built. Interpret, in context, the Shadow Price for the Leather and the Satin constraints. Include units in your interpretations.
Sweet-Fit jeans has a factory that makes two styles of jeans; Super-Fit and Super-Hug. Each pair of Super- Fit takes 12 minutes to cut and 30 minutes to sew and finish. Each pair of Super-Hug takes 12 minutes to cut and 40 minutes to sew and finish. The plant has enough workers to provide at most 12,599 minutes per day for cutting and at most 37,999 minutes per day for sewing and finishing. The profit on each pair of Super-Fit is $6.00 and the profit on each pair of Super-Hug is $7.00. How many pairs of each style should be produced per day to obtain maximum profit? Find the maximum daily profit. (Use x for Super-Fit and y for Super-Hug.) Maximize P = < 12,599 ≤37,999 Maximum profit is $ subject to Enter the solution to the simplex matrix below. If there is no solution enter 'DNE' in the boxes below. If more than one solution exists, enter only one of the multiple solutions below. If needed round jeans to 1 decimal place and profit to 2 decimal places. Number of Super-Fit jeans to…

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS