1. Give the dual of each of the following linear programs:(b)minimize 3x₁ +7x3 + 9x₁subject to-₁ + 3x₂ - 32x1 +52 +8x3 +974 ≥ 1,10x₁ < -12,x₁ + 4x₂ + 8x32 -4,I1, I₂ ≥ 0,X3 ≤ 0,T4 unrestricted

Answered: Image /qna-images/answer/fb48c2a7-44f4-4370-8429-291413b8c991.jpg

Answered: 1. Give the dual of each of the…

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

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.
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…
1. Give the dual of each of the following linear programs: maximize 5x1 + 8x2 + x3 + 2x4 subject to (b) minimize subject to 3x1 + 3x2 + 7x3 + 8x4 ≤ 15, 2x28x3-7x4 ≥ 10, 9x16x22x3+4x4 = 5, X1, X2, X3 ≥ 0, 4 unrestricted 3x1 + 7x3 + 9x4 -x1 + 3x2x3 - 10x4≤-12, 2x1 +5x2 + 8x3 +9x4 ≥ 1, x1 +4x2+8x3 -x4, X1, X2 ≥ 0, X3 ≤ 0, 4 unrestricted Hint: Remember to first rewrite all the constraints and variables into the correct forms for minimisation!
The approximated value for e using the Maclaurin series expansion considering a true relative error that is conforming to one significant figure is: O a. 4.052 O b. 3,885 Oc3414 O d. 2414
A division of the Winston Furniture Company manufactures dining tables and chairs. Each table requires 40 board feet of wood and 5 labor-hours. Each chair requires 16 board feet of wood and 4 labor-hours. The profit for each table is $45, and the profit for each chair is $20. In a certain week, the company has 3200 board feet of wood available and 520 labor-hours availabl How many tables and chairs should Winston manufacture to maximize its profit? tables chairs What is the maximum profit? $
company manufactures bamboo toy chairs and chess sets. Each bamboo toy chair yields a profit of $3, and each chess set, $5. A bamboo toy chair requires 5 hours of processing at Machine A and three hours at Machine B, and one hour at Machine C, while a chess set requires seven hours at Machine A, sixhours at Machine B, and two hours at Machine C.Machine A has a maximum of 130 hours of available capacity per day. Machine B has 90 hours, and Machine C has 25 hours.If the company wishes to maximize profit, how many bamboo toy chairs and chess sets should be produced per day?
Use Excel to solve the linear programming problem.At one of its factories, a manufacturer of televisions makes one or more of four models of HD units (without cases): a 20-in. LCD, a 42-in. LCD, a 42-in. plasma, and a 50-in. plasma. The assembly and testing time requirements for each model are shown in the table, together with the maximum amounts of time available per week for assembly and testing. In addition to these constraints, the supplier of cases indicated that it would supply no more than 290 cases per week and that of these, no more than 40 could be for the 20-in. LCD model.Use the profit for each television shown in the table to find the number of completed models of each type that should be produced to obtain the maximum profit for the week. Find the maximum profit. 20-in. LCD sets 42-in. LCD sets 42-in. plasma sets 50-in. plasma sets profit $ 20-in.LCD 42-in.LCD 42-in.Plasma 50-in.Plasma TotalAvailable Assembly time…
10. Solve the following linear programming model graphically: minimize Z = 5x + x2 subject to 3x, + 4x, = 24 %3D X + 3x, s 12 X1, X2 2 0
Muir Manufacturing produces two popular grades of commercial carpeting among its many other products. In the coming production period, Muir needs to decide how many rolls of each grade should be produced in order to maximize profit. Each roll of Grade X carpet uses 50 units of synthetic fiber, requires 25 hours of production time, and needs 20 units of foam backing. Each roll of Grade Y carpet uses 40 units of synthetic fiber, requires 28 hours of production time, and needs 15 units of foam backing. The profit per roll of Grade X carpet is $200, and the profit per roll of Grade Y carpet is $160. In the coming production period, Muir has 3000 units of synthetic fiber available for use. Workers have been scheduled to provide at least 1800 hours of production time (overtime is a possibility). The company has 1500 units of foam backing available for use. What are the binding constraints of the feasible region of the optimal solution? Constraint 2 only Constraint 1 only…
Example 5.1 Find the dependent and independent variables of the following system 0. + 3x2 201 + 6x2 2.x3 5x3 + 2x5 2.x4 + 4x5 3x6 -1 + 15x6 8x4 + 4x5 + 18x6 5x3 + 10x4 +. 2.x1 + 6x2 9. Solution
Why must there be a minimum of two rows and two columns in a two-way table?
Identify which BFS are degenerate (if any) and which BFS are non-degenerate. Among all BFS, identify one with largest objective function value.

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

1. Give the dual of each of the following linear programs: (b) minimize subject to 3x₁ + 7x3 + 9x₁ −₁+3x₂-x3-10x4≤-12, 2x1 + 5x2 +8x3 + 9x₁ ≥ 1, x₁ + 4x2 + 8x32 -4, x1, x₂ > 0,