(1)(64+ 126)×a=950, ∴a=50(2)① If the carton is packed with X boxes of woven bags * * * and Y bags, then 64x+126y = 7280; 8X+ 18Y= 1000 gives x = 35Y= 40 ② Assuming it can be realized, the rest are the same as above, then; 64X+ 126y = 7280； 8(X+b)+ 18Y = 1000； This is a linear programming problem, and the key point to solve the problem is rounding, because x, y and b are all positive integers. You see, the linear constraint of the objective function b=( 1000- 18Y )/8-X is 64x+126y = 7280; X & gt=0; Y & gt=0; X, Y∈N are all plotted and tested in rectangular coordinate system, that's all. PS: I wonder if you have studied linear programming. If not, there is something wrong with this problem, because it has three variables, not a problem of solving equations, but an optimal choice idea.