“简单线性规划问题”是在线性约束条件下研究线性目标函数的最值问题。但在各地历年的高考中,线性规划问题已突破“线性”的框架,常常出现“约束条件”非线性,或“目标函数”非线性的情形,形成一系列综合问题。下面主要阐述如何解决“目标函数”非线性问题。一、常规解法,问题提出在线性规划问题中,对于形如z=ax+by的目标函数,可先将其变形为y=-a/bx+z/b,z/b可看做直线在y轴上的 “Simple Linear Programming Problem ” is the most value problem of studying linear objective function under linear constraints. However, in the college entrance examination over the years, the linear programming problem has broken through the framework of “linearity”, often resulting in a series of comprehensive problems such as “constraint ” nonlinearity, or “objective function ” nonlinearity. The following mainly explains how to solve the “objective function” nonlinear problem. First, the conventional solution, the problem raised In the linear programming problem, for the shape of the objective function such as z = ax + by, can be transformed into y = -a / bx + z / b, z / b can be seen as a straight line in on the y axis