A furniture factory has 90m3 square wood and 600m2 plywood, ready to be processed into desks and

Solution: Set up x desks and Y bookcases, and the total profit is ...... yuan1 point.

>z＝80x＋120y. …3 points.

The field <> is made in the Cartesian coordinate plane by making the plane represented by the above group of inequalities

……5 points. Make a straight line l: 80x 120y 0, that is, a straight line l: 2x 3y 0

Translate the line L to the top right to L1

, the line passes through the point M on the feasible domain, where z 80x 120y achieves a maximum value of ......7 points.

> when x 100, y 400, zmax

80 100 120 400 56000 (yuan) ....10 points.

Therefore, the production of 100 desks and 400 bookcases can make the maximum profit of 56,000 yuan.

This test mainly examines the optimal solution of linear programming, and studies the most profitable application test questions in the practical problem, first of all, make a group of inequalities satisfied by the feasible domain, and then make a graph and translate to get the conclusion.