线性规划的逆向问题,是指已知目标函数取得最值时的最优解(唯一一个或无限个),要求线性约束条件或目标函数中参数的值或范围.本文将以几个高考题为例,谈谈线性规划取最值的逆向问题,由此归纳出这种题型的一般解法.一、已知最优解无数个...线性规划的逆向问题,是指已知目标函数取得最值时的最优解(唯一一个或无限个),要求线性约束条件或目标函数中参数的值或范围.本文将以几个高考题为例,谈谈线性规划取最值的逆向问题,由此归纳出这种题型的一般解法.一、已知最优解无数个,求目标函数中参数的值例1 已知平面区域 D 由以 A(1,3)、B(5,2)、C(3,1)为顶点的三角形内部和边界组成.展开更多
In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be...In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution withconstraint condition.展开更多
基金Supported by National Science Foundation of China (10771162)Foundation of Shang-hai Municipal Education Commission (071605123)Shanghai Excellent Young Teacher Foundation(SDL08015)
文摘线性规划的逆向问题,是指已知目标函数取得最值时的最优解(唯一一个或无限个),要求线性约束条件或目标函数中参数的值或范围.本文将以几个高考题为例,谈谈线性规划取最值的逆向问题,由此归纳出这种题型的一般解法.一、已知最优解无数个,求目标函数中参数的值例1 已知平面区域 D 由以 A(1,3)、B(5,2)、C(3,1)为顶点的三角形内部和边界组成.
基金Supported by the Natural Science Foundation of Henan Province（0511012000 0511013600） Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province（200512950001）
文摘In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution withconstraint condition.
