在应用题中,“最近、最省、最短、最佳”等最优化问题逐渐担当了“主角”.现归纳两类,供同学们复习之用.一、运用一次函数及一元一次不等式组解决的问题例1现计划把甲种货物1240吨和乙种货物880吨用一列货车运往某地.已知这列货车挂有A、B两种不同规格的车厢共40节,使用A型车厢每节费用为6000元,使用B型车厢每节费用为8000元. In the application title, the “most recent, most provincial, shortest, best,” and other optimization problems gradually took on the “protagonist”. They are now classified into two categories for students to review. First, use a function and a yuan Problems solved by an inequality group Example 1 Now plans to transport 1,240 tons of A-type cargo and 880 tons of B-type cargo to a place with a lorry. It is known that this truck has 40 sections of A, B, and two different specifications, and it is used. The cost of each type of A-car is 6,000 yuan, and the cost of using a B-type car is 8,000 yuan.