This is a simple linear programming problem, so I won't write those steps for you. You can refer to the excellent papers in the next few years to write, and now write out the problem-solving process:

Suppose that product A X is produced and product B Y is produced.

Maximum 20x+30y

x+2y & lt； =20

5x+4y & lt； =70

The above is the model of this problem, so let's use LINGO to solve it (LINGO is a software for solving linear programming problems, and LINDO can solve this problem, but I don't have LINDO, so I use LINGO).

Procedure:

Model:

max = 20 * x+30 * y；

x+2 * y & lt； 20;

5 * x+4 * y & lt； 70;

The result of running the program is:

Finding the global optimal solution in iteration: 0 Target value: 350.0000.

Variable value reduces cost

X 10.00000

Y 5.000000 0.000000

Line slack or excess double price

1 350.0000 1.000000

2 0.000000 1 1.66667

3 0.000000 1.666667

This problem is relatively simple. It is a better choice to solve it with LINDO, and you can directly check the shadow price and so on.

If you want to write according to the paper format of mathematical modeling, you should go to China of Mathematics to find excellent papers for reference. Moreover, this topic is similar to the production and sales of dairy products in chapter 4. 1 of the third edition of Jiang Qiyuan's Mathematical Model. You can look for it.