2. A chemical manufacturer produces three chemicals: A, B and C. These chemicals are producedby two processes: Process 1 and Process 2. Running process 1 for 1 hour costs $4 and yields 3units of chemical A, 1 unit of chemical B and 1 unit of chemical C. Running process 2 for 1 hourcosts $1 and produces 1 unit of chemical A, and 1 unit of chemical B (but none of Chemical C).To meet customer demand, at least 10 units of chemical A, 5 units of chemical B and 3 units ofchemical C must be produced daily. Assume that the chemical manufacturer wants to minimizethe cost of production.A. Develop the linear programming model that minimizes the cost.B. Use online graphing tools to determine the feasible solution. Take a screenshot of it.C. What are the corner points of the feasible region?D. How many hours of each process must be used to minimize the cost of production? What isthe minimum cost of production?PROCESS 1PROCESS 2COST/HOUR41CHEMICAL A3110CHEMICALB115CHEMICALC13

Let the process A runs for x hours and process B runs for y hours the objective function is…

Answered: 2. A chemical manufacturer produces…

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

Please clarify which option is correct
8. process consists of two machines only: A firm is producing two brass ornaments, a standard and a deluxe. The manufacturing Machine 1 Machine 2 Standard Model 1 Hour 1 Hour Deluxe Model 2 Hours 5 Hours There are 20 hours available on machine 1 and 35 hours on machine 2. The profit of £0.50 on the standard model and £1.50 on a deluxe model. that would maximise profit. firm makes a Determine the output
5. Next Monday, Concrete Co need to supply concrete to four different building sites. They prefer to use plants 1 and 2 for the production and delivery of the concrete, because they are quite close to the sites, but find it necessary to use plant 3 to satisfy the rest of the demand. The table below shows supply and demand amounts in tonnes, and cost coefficients in $ per tonne. Cij Site 1 70 40 130 75 Plant 1 Plant 2 Plant 3 Demand Site 2 40 50 210 23 Site 3 20 30 80 19 Site 4 50 60 90 25 Supply 80 55 7 Concrete Co wish to minimise their total cost. Treat this as a primal LP problem. (a) Show that Concrete Co have balanced their transportation problem. (b) Use the Least Cost Method to find a basic feasible solution to this primal problem. Verify that you have the correct number of basic variables. [Hint: You should look at 13 first. Then 12 and 21 are both contenders, but it does not matter what order you choose them in.] (c) Use complementary slackness conditions to find a dual…
B. A firm manufactures 2 product, A and B. Each product is processed by machines, M₁ and M2. Each unit of type A requires 1 hour of processing by M₁ and 2 hours in M and each unit type of type B requires 3 hours on M₁ and 1 hour on M₂. The profit on product A is P20 per unit and on product B is P30 per unit. If M₁ is available for 200 hours each month and M₂ for 300 hours, how many units of each type can be manufactured in one month in order to maximize the profits? Requirement: 1) Formulate the linear programming model 2) Solve the linear programming using the graphical method
A company is producing 3 products A ,B and C. BOM of each product is given in the table below. Material Unit Product A Product B Product C Steel Ton 4 Aluminum KG 50 40 60 Wood CFT 10 10 Glass SFT 30 30 Rubber Sealer RFT 100 120 Screws Рack 5 6 4 Nut Bolt Dozen 2 Calculate the material requirements for 6 months production for all the products if monthly demand for A=1000, B=1200 and C=1500 units
i need the answer quickly
Example 12.8. A firm uses milling machines, grinding machines and lathes to pro- duce two motor parts. The machining times required for each part, the machining times avail- able on different machines and the profit on each motor part are given below : Machining time reqd. for the motor part Max. time available per Type of machine (mts) week (minutes) I II 10 2,000 Milling machines Grinding machines Lathes. 2 900 12 3,000 Profit/ unit (Rs.) 100 40 Determine the number of parts I and II to be manufactured per week to maximize the profit. د ه
A tent manufacture produces regular and expedition tents at three branches. Per hour of operation, the Harrogate branch produces 20 regular tents and 10 expedition tents. The Skipton branch produces 0 regular tents and 20 expedition tents, and the York branc h produces 80 regular tents and 20 expedition tents. In order to meet the demand, the company needs to produce exactly 240 regular tents and 100 expedition tents each day. How many hours per day should each branch operate in order to produce the required amounts of tent? Solve using Gauss-Jordan elimination method.
A company is dedicated to the production of different vegetable-flavored milks. Currently the company produces two types of milk: almond and coconut, which it sells at $ 5,000 and $ 2,000 / liter respectively. Milk production is subject to the use of machine hours in the production plant and of water as a fundamental resource. It takes 1 machine-hour and 2 liters of water to produce 1 liter of almond milk, while it takes 3 machine-hours and 1 liter of water to produce 1 liter of coconut milk. The company currently has 100 machine-hours and 50 liters of water to make the milk, and it is also required to make at least 30 liters of milk in total. 1. Set up the linear programming model in standard format.2. Determine all the basic solutions to the problem. Identify which ones are feasible and which ones are not. Analyze what happens graphically.3. Determine an initial feasible basic solution using phase I. In each iteration, write the resulting model in dictionary format and analyze what…

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