What do you mean by Degeneracy in linear programming problem?

Consider the following integer nonlinear programming problem. Маximize Z = xx3x3, XX2X3 , subject to X1 + 2x2 + 3x3< 10 x121, x 2 1, xz 2 1, and X1, X2, X3 are integers. Use dynamic programming to solve this problem. Please show your steps (show your tables).

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…

Can you help solve this problem with general linear programming and no technology?