浅谈线性规划问题最优解

下载PDF

导出

摘要高中数学知识点多,出题比较灵活,能行之有效的解题方法显得尤为重要,一线教师可以总结同类题型的解题方法,为学生高考解题节省时间,在有限的竞争时间内赢得宝贵的时间。

作者姬成虎

机构地区武威第七中学

出处《文理导航》 2017年第35期10-10,共1页

关键词可行域最值

参考文献3

1Wei Li. Learning from Data by Interval Linear Programming [ J ]. Key Engineering Materials, 2010,43 (9) :710 - 714.
2Wei Li, Xiaoli Tian. Fault Detection in Discrete Dynamic Systems with Uncertainty Based on Interval Optimization[ J ]. Mathematical Modelling and Analysis,2011,16(4) :549 -557. W.
3ei Li, Xiaoli Tian. Numerical solution method for general interval quadratic programming[ J]. Applied Mathematics and Computation,2008,20 (2) :589 - 595.
4Soleimani-damaneh M, Jahanshahlo G R. Optimal and strongly optimal solutions for linear programming models with varia- ble parameters[J]. Applied Mathematics Letters,2007,20(10) :1 052 - 1 056.
5Fiedler M, nedoma J, ramik J, etal. linear optimization problems with inexact data[ M ]. New York: Springer,2006:35 - 74.
6Serafini P. Linear programming with variable matrix entries [ J ]. Oper Res Lett,2005,33 (2) : 165 - 170.
7Jahanshahloo G R, Foroughi A A. Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems [ J ]. Appl Math Comput,2004,15 ( 1 ) :203 - 211.
8Tu T V . Optimization over the efficient set of a parametric multiple objective linear programming problem[ J]. European J Oper Res ,2000,22(3 ) :570 - 583.
9Bazaraa M S, Jarvis J J, Sherali H D. Linear Programming and Network Flows [ M ]. Canada: John Wiley and Sons, 1990: 68 - 69.
10Ralph Steuer. Algorithms for linear programming problems with interval objective function coecients [ J ]. Mathematics Operational Research, 1981,6 (3) : 333 -348.

文理导航

2017年第35期

内容加载中请稍等...