A chemical manufacturing plant can produce z units of chemical Z given p units of chemical P and r unitsof chemical R, where:2=Chemical P costs $200 a unit and chemical R costs $800 a unit. The company wants to produce as manyunits of chemical Z as possible with a total budget of $240,000.Units of chemical R, r =A) How many units each chemical (P and R) should be "purchased" to maximize production of chemical Zsubject to the budgetary constraint?Units of chemical P, p =140p.80.2Max production, z=B) What is the maximum number of units of chemical Z under the given budgetary conditions? (Round youranswer to the nearest whole unit.)units

Answered: Image /qna-images/answer/094feb79-f95d-4b74-8d96-c3dd1af14750.jpg

Answered: A chemical manufacturing plant can…

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

QUESTION 12 A mining company owns 3 different mines (North, South, and West mines) that produce 3 different grades of iron (low-grade, medium-grade, and high-grade). The company requires at least 25 tons of low-grade Iron, 18 tons of medium-grade iron, and 12 tons of high-grade iron in order to meet its supply requirements. The North Mine costs $10,000 per day of mining and in a day of mining it produces 4 tons of low-grade iron, 1 ton of medium-grade iron, and 1 ton of high-grade iron. The South Mine costs $15,000 per day of mining and in a day of mining it produces 1 ton of low-grade iron, 3 tons of medium grade iron, and 2 tons of high-grade iron. The West Mine costs $18,000 per day of mining and in a day of mining it produces 3 tons of low-grade iron, 3 tons of medium-grade iron, and no high-grade iron. Suppose x is the number of days that the North Mine is operational, y is the number of days that the South Mine is operational, and z is the number of days that the West Mine is…
(b) Let xij be the amount shipped from source i to destination j in a 5X5 transportation problem, and let Cij be the corresponding transportation cost per unit. The amounts of supply at sources 1,2,3,4 and 5 are 210, 150,250,190 and 150 units respectively and the demands at destinations 1,2,3,4 and 5 are 205, 220,180,180 and 165 units respectively. The cost of shipping from source 1 to destinations 1,2,3,4 and 5 are 29, 28, 31, 27 and 32 respectively. The cost of shipping from source 2 to destinations 1,2,3,4 and 5 are 26, 27, 30, 37 and 31 respectively. The cost of shipping from source 3 to destinations 1,2,3,4 and 5 are 32, 38, 29, 27 and 35 respectively. The cost of shipping from source 4 to destinations 1,2,3,4 and 5 are 33, 39, 27, 29 and 33 respectively. The cost of shipping from source 5 to destinations 1,2,3,4 and 5 are 35,31, 34, 23 and 35 respectively. (i)Find the associated optimal cost. (ii)Determine each non basic variable.
wawb grutsgrad Beorge cit OXOL VW 5 batay ow! doily Howing GL CELLAM? Csberic y = vol od or assovo odl 1 + 11) Foxes were introduced to an area that did not naturally contain them. Based on other similar areas, the carrying capacity for this area is 130 foxes. The number of foxes was said to reach 65 (half the carrying capacity) in 38 years (which is C). Using this information and a value of B = -2.3, estimate the number of foxes in 54 years. Round to the nearest whole number. labour ho avus iedW A (1) do bas avode diger sit (0) В
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
A chemical manufacturing plant can produce z units of chemical Z given p units of chemical P and r units of chemical R, where: z = 100p-75,0.25 Chemical P costs $100 a unit and chemical R costs $700 a unit. The company wants to produce as many units of chemical Z as possible with a total budget of $112,000. A) How many units each chemical (P and R) should be "purchased" to maximize production of chemical Z subject to the budgetary constraint? Units of chemical P, p = Units of chemical R, r = B) What is the maximum number of units of chemical Z under the given budgetary conditions? (Round your answer to the nearest whole unit.) Max production, z= units
A logistics company wants to transport wood from 3 forestry centers to 5 demand centers. Transportation costs (in euros) are shown in the following table along with production and demand at each center: F1 F2 F3 Demand D1 100 350 300 10 D2 200 300 200 20 D3 400 600 450 16 D4 350 700 300 20 D5 Production 150 500 200 7 30 20 28 What is the transportation program that minimizes the total transportation cost? Obtain an initial solution with the least cost method. Find the transportation schedule that minimizes the total transportation cost. Report the minimum total transportation cost. Indicate whether there are alternative optimal solutions, and if so, it obtains them. Please be as clear as possible. Explain all the steps of the problem. Answer all the points requested. Thank you very much.|

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