find the dual of the given linear programming problem 3. Маximize z%3Dsubject toЗх, + 2х, + 5х; + 7x413x, + 2x2 + X35x, + х, + 2х; + 4x4 3D 7+ X3 – 2x4 S 12x2 2 0, x3 2 0, x4 2 0.4x1-x, 2 0,4. Мaximize z%3D2х, + x, + 3x; + 4x4subject to4х, + 2х, + 5х, + 5x, < 104х, + 2х, + 5xз + 5x4 2 5Зх, + 5х, + 4xз + xа28Зх, + 5х, + 4xз + X4S 15X1 + x2 + x3 + X4 = 20x2 2 0, x3 2 0, x4 2 0.х, 2 0,

Answered: 3. Мaximize z %3 subject to Зх, + 2хz +…

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

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
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…
Each constraint of graphical linear programming problem is plotted as a line in which quadrant
Solve the linear programming problem: maximize: x1 - x3 subject to: x1 1 0 x2 X3 [2 1 1 2 -1 2 and a > 0. You may use information from Question 4. X4 = 42 2
Solve the following linear programming problem. You are taking two dietary supplements daily: Supplement A and Supplement B. An ounce of supplement A contains 9 units of calcium, 8 units of vitamin D, and 5 units of sodium. An ounce of supplement B contains 2 units of calcium, 4 units of vitamin D, and 3 units of sodium. Your goal is to get at least 90 units of calcium and at least 120 units of vitamin D from the supplements daily, while at the same time reducing the amount of sodium that you will get. How many ounces of each supplement should you take daily to reach your goals? Ounces of Supplement A = Blank 1. Fill in the blank, read surrounding text. Ounces of Supplement B = Blank 2. Fill in the blank, read surrounding text. How many units of sodium will you get daily under these circumstances? Units of Sodium = Blank 3. Fill in the blank, read surrounding text.
Formulate a linear programming problem that can be used to solve the following question. A company has three plants that produce three different sizes of their product. The North plant can produce 2000 items in the small size, 2000 in the medium size, and 1000 in the large size. The Center plant can produce 1000 items in the small size, 2000 in the medium size, and 2000 in the large size. The South plant can produce 1000 items in the small size, 1000 in the medium size, and 1000 in the large size. The company needs to produce at least 8000 of the small items, 9000 of the medium items, and 7000 of the large items on a given day. The cost of producing the small item is $3, the medium item $5, and the large item $4. Find the number of items each plant should produce in order to minimize the cost. Let X₁, X₂, and x3 be the number of small, medium, and large items produced by the North Plant, respectively. Let Y₁, 2, and y3 be the number of small, medium, and large items produced by the…
Formulate but do not solve the following exercise as a linear programming problem. A financier plans to invest up to $400,000 in two projects. Project A yields a return of 10% on the investment of x dollars, whereas Project B yields a return of 13% 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 40% of the total investment. How much should she invest in each project to maximize the return on her investment P in dollars? MaximizeP= subject to the constraints ? amount available for investment? allocation of funds?
Formulate a linear programming problem that can be used to solve the following question. An airline has three types of airplanes and has contracted with a tour group to provide transportation for a minimum of 70 first-class, 52 tourist, and 108 economy-class passengers. The first plane costs $4100 for the trip and can accommodate 36 first-class, 16 tourist, and 18 economy-class passengers; the second plane costs $4800 for the trip and can accommodate 8 first-class, 10 tourist, and 42 economy-class passengers; the third plane costs $6300 for the trip and can accommodate 18 first-class, 36 tourist, and 16 economy-class passengers. How many of each type of airplane should be used to minimize the operating cost? X = ---Select--- y = ---Select--- ---Select--- Z |||| ---Select--- | F = AC UB Subject to X ---Select--- 0, y ---Select--- (objective function) (first-class passengers) (tourist passengers) (economy-class passengers) 0, z ---Select--- 0 (nonnegativity constraint)
which options are correct ?
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 44 of the regular model, 32 of the fancy model, and 20 of the super model, and costs $4500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 58 of the super model, and costs $2000 per day to operate. At least 300 of the regular model, 320 of the fancy model, and 680 of the super model are needed. How many days must each plant operate in order to minimize the cost? ---1pəjəs-- = X y = ---Select--- ---Select--- v F = (objective function) Subject to (regular models) (fancy models) (super models) 0A---1pajas--
Formulate a linear programming problem that can be used to solve the following question. A dealer has 8900 pounds of peanuts, 6000 pounds of almonds, and 3800 pounds of cashews to be used to make two mixtures. The first mixture wholesales for $2.40 per pound and consists of 60% peanuts, 30% almonds, and 10% cashews. The second mixture wholesales for $3.20 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 = ---Select--- y = ---Select--- ---Select--- v|F= Subject to (objective function) (pounds of peanuts) (pounds of almonds) (pounds of cashews) x ---Select--- 0, y ---Select--- 0 (nonnegativity constraint)
Please help!!

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