Suppose an organisation is manufacturing two products Pjand P2. The profit per tonneof the two products are Rs. 50 and Rs. 60 respectively. Both the products requireprocessing in three types of machine. The following Table indicates the availablemachine hours per week and the time required on each machine for one tonne of P1 andP2. Formulate this product mix problem in the linear programmingform.Table Showing the available machine capacitiesand machine hour requirement of the two productsProduct 2Profit/tonneProduct 1Total availableRs. 50Rs. 60Machine hours/weeksMachine 1300Machine 234509Machine 34812

Answered: types of machine. The following Table…

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

Linear Programming A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1 and F2 are available. Food F1, cost Php4 per unit food and F2 costs Php6 per unit. One unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2, contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem. Find the minimum cost for diet that consist of mixture of these two foods and meets the minimal nutritional requirements.
The question is in the screenshot and the answers are listed below: A. 700 small copiers and 1,050 large copiers. B. 1,025 small copiers and 825 large copiers. C. 975 small copiers and 875 large copiers. D. 900 small copiers and 925 large copiers.
Q1/1) what is the general form of linear programming problems. 2) Numerate the functions of management. 92/ Sugges 1 Functions of Manggment having the Sha
An investor has $621,000 to invest in bonds. Bond A yields an average of 8% and the bond B yields 7%. The investor requires that at least 5 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. This can be set up as a linear programming problem. Introduce the decision variables: x= dollars invested in bond Ay= dollars invested in bond B Compute x+y. $ . Round to the nearest cent. Investor Matt has $152,000 to invest in bonds. Bond A yields an average of 9.2% and the bond B yields 8.4%. Matt requires that at least 4 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. What is the maximum return? $ per year. Round to the nearest cent. Investor Dan has $607,000 to invest in bonds. Bond A yields an average of 8.5% and the bond B yields 8.4%. Dan requires that at least 4 times as much money be invested in bond A as in…
Write the above transportation problem as a LPP and Solve the LPP using graphical method
R.H.S X1 X2 Хз S1 S2 S3 -4 -3 12 1 4 9. 1 4 R.H.S X1 X2 X3 S1 S2 S3 1 In the following, two Consecutive simplex Tableaus for a linear programming problem are shown. What is the value of b. 지기23 4
Formulate but do not solve the following exercise as a linear programming problem.A division of the Winston Furniture Company manufactures x dining tables and y chairs. Each table requires 40 board feet of wood and 2 labor-hours. Each chair requires 16 board feet of wood and 4 labor-hours. In a certain week, the company has 2800 board feet of wood available and 560 labor-hours.If the profit for each table is $50 and the profit for each chair is $18, how many tables and chairs should Winston manufacture to maximize its profits P in dollars? Maximize P = subject to the constraints board feet labor-hours x ≥ 0 y ≥ 0
The supplies, demands, and transportation costs per unit are shown on the network. (a)Develop a linear programming model for this problem; be sure to define the variables in your model. Let x11 = amount shipped from Jefferson City to Des Moines x12 = amount shipped from Jefferson City to Kansas City x13 = amount shipped from Jefferson City to St. Louis x21 = amount shipped from Omaha to Des Moines x22 = amount shipped from Omaha to Kansas City x23 = amount shipped from Omaha to St. Louis Min ???????? s.t. From Jefferson City ?????? From Omaha ??????? To Des Moines ??????? To Kansas City ???????? To St. Louis ???????????? x11, x12, x13, x21, x22, x23 ≥ 0 (b)Solve the linear program to determine the optimal solution. Amount Cost Jefferson City–Des Moines Jefferson City–Kansas City Jefferson City–St. Louis Omaha–Des Moines Omaha–Kansas City Omaha–St. Louis Total

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