[3.49] The following is the current simplex tableau of a given maximization problem. The objective is to maximize 2x₁ - 4x2, and the slack variables are x3 and x4. The constraints are of the type. Z x3 XI Z 1 0 0 X1 b C d x2 C. d. Is the tableau optimal? x3 1 f 0 1/3 1 e X4 g 1 1/5 0 2 RHS 8 a. Find the unknowns a through g. b. Find B Find ax3/0x2, dz/ab, dz/dx4, x₁ 1 db₂. a m atrict

Use your schools library, the Internet, or some other reference source to find the real-life applications of constrained optimization.

Graph: 3x+2y6.

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…