find the dual of the given linear programming problem 5. Maximizesubject to3x1 + x2 + 4x3z =3x1 + 3x, + X3 < 182x1 + 2x2 + 4xz = 12x1 2 0, x3 2 0.6. Minimizez = 5x1 + 2x2 + 6x3subject to4x1 + 2x, + x3 z 12Зx, + 2х, + 3x, s 6х, 2 0, х, 2 0.

We to convert the given linear programming problem in to dual problem. The solution is explained…

Answered: 5. Maximize z = 3x, + x2 + 4x3 subject…

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

Formulate but do not solve the following exercise as a linear programming problem.A financier plans to invest up to $600,000 in two projects. Project A yields a return of 9% on the investment of x dollars, whereas Project B yields a return of 14% on the investment of y dollars. Because the investment in Project B is riskier than the investment in Project A, the financier has decided that the investment in Project B should not exceed 35% of the total investment. How much should she invest in each project to maximize the return on her investment P in dollars? Maximize P = subject to the constraints amount available for investment allocation of funds x ≥ 0 y ≥ 0
Is this constraint linear or able to be included as a constraint in a linear programming problem? 3X12 + 7X2 ≤ 45 True False
Formulate a linear programming problem that can be used to solve the following question. A dealer has 7100 pounds of peanuts, 6600 pounds of almonds, and 4200 pounds of cashews to be used to make two mixtures. The first mixture wholesales for $2.20 per pound and consists of 65% peanuts, 30% almonds, and 5% cashews. The second mixture wholesales for $3.30 per pound and consists of 15% peanuts, 45% almonds, and 40% cashews. How many pounds of each mixture should the dealer make to maximize revenue? x= number of pounds of the first mature v y number of pounds of the second ture ✔ Maximi O✓ F- Subject to 0. y. (objective function) (pounds of peanuts) (pounds of almonds) (pounds of cashews) ✓0 (nonnegativity constraint)
State the linear programming problem in mathematical terms, identifying the objective function and the constraints. A firm makes products A and B. Product A takes 2 hours each on machine L and machine M; product B takes 2 hours on L and 3 hours on M. Machine L can be used for 14 hours and M for 9 hours Profit on product A is $7 and $6 on B. Maximize profit. OA Maximize 7A+68 Subject to: 2A + 2B < 14 2A+3859 AB20 OC. Maximize 7A-68 Subject to: 2A 20214 3A 28 20 ABSO OB. Maximize 7A 68 Subject to: 2A+28s 14 34 2859 AB20 OD. Maximize 6A+78 Subject to 2A 38 14 2A-2059 A, B20
Sometimes in linear programming, if the problem calls for it, it might be necessary to multiply two decision variables together to form a constraint. Ex. 1 X 2 20 True False
Formulate a linear programming problem that can be used to solve the following question. A farmer has two fields in which he grows wheat and corn. Because of different conditions, there are differences in the yield of growing these crops in these two fields. The sizes, yields, and costs are shown in the table; 6,960 bushels of wheat and 19,440 bushels of corn are to be grown. Determine a planting plan that will minimize the cost. Field 2 205 bushels $206 80 bushels $124 80 Corn yield/acre Cost/acre of corn Wheat yield/acre Cost/acre of wheat Acres available X₁ = the number of acres of wheat planted in field 1 Y₁ = the number of acres of corn planted in field 1 x₂ = the number of acres of wheat planted in field 2 y₂ = the number of acres of corn planted in field 2 ---Select---|F= Subject to Field 1 160 bushels $179 110 bushels $143 100 X1 ---Select--- 0, y₁|---Select--- 0, X2 ---Select--- 0, y₂ ---Select--- 0 (objective function) (available acres in Field 1) (available acres in Field 2)…
Solve the linear programming problem a. Mrs. Reyes intense to make 500 boxes of chocolates with brand (or class) A, B, and C. It costs him P 60 for box A, P 40 for box B, and P 20 for box C. He has a maximum of P 20,000 to spend. If he makes a profit of P 40 for box A, P 20 for box B, and P 10 for box C, how many boxes of each kind should he make?
Formulate a linear programming problem that can be used to solve the following question. A firm has plants in Boston and Baltimore that manufacture three models of hot tubs: regular, fancy, and super. In one day the Boston plant can manufacture 32 of the regular model, 24 of the fancy model, and 12 of the super model, and costs $2500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 31 of the super model, and costs $2500 per day to operate. At least 312 of the regular model, 360 of the fancy model, and 456 of the super model are needed. How many days must each plant operate in order to minimize the cost? x = ---Select--- y = ---Select--- ---Select--- ✓| F= Subject to X --Select--- 0, y ---Select--- 0 (objective function) (regular models) (fancy models) (super models)
Let f be the invertible linear transformation represented by the matrix -2 ^-(-²¹) A = 1). 4 4 Find, in terms of and y, the equation of the image f(C) of the unit circle C. The equation is
Which of the following is not true about linear programming? The value of the variables can be negative. The objective is either to maximize or to minimize. The relationship between variables can be expressed in equations or inequalities. The actions are constrained.
Qy: Solve the following linear programming problem graphically Maxz=4x,+5x, Subject to 3x,+1,
State the linear programming problem in mathematical terms, identifying the objective function and the constraints. A car repair shop blends oil from two suppliers. Supplier I can supply at most 48 gal with 3.6% detergent. Supplier II can supply at most 66 gal with 3% detergent. How much can be ordered from each to get at most 100 gal of oil with maximum detergent? OA. Maximize 0.030x + 0.036y Subject to: xs48 y≤ 66 x+y≤ 100 OC. Maximize 48x + 66y Subject to: x248 y266 0.036x +0.03y2 100 OB. Maximize 0.036x+0.03y Subject to: 0≤x≤48 0sys 66 x+ys 100 D. Maximize 48x + 66y Subject to: xs48 y≤ 66 0.036x +0.03y ≤ 100

SEE MORE QUESTIONS

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

5. Maximize z = 3x, + x2 + 4x3 subject to 3x, + 3x2 + xz < 18 2x1 + 2x2 + 4xz = 12 %3D X1 2 0, x3 2 0. 6. Minimize z = 5x, + 2x2 + 6x3 subject to 4x, + 2x, + X3 z 12 3x, + 2x2 + 3x356 X1 2 0, x2 2 0.