期刊文献+

大规模线性优化求解系统的设计与实现 被引量:5

Design and implementation of linear optimization solving system
下载PDF
导出
摘要 从建立实用系统出发,以解决实际中各类大规模线性优化问题为目标,研究了大规模线性优化求解技术,设计实现了用于大规模线性规划、整数规划及运输模型的线性优化求解系统LOSS(LinearOptimizationSolvingSystem),并结合具体应用实例做了模拟实验研究。大规模测试数据样例实验结果证明,该系统在求解线性优化类问题时,效果优良,并具有灵活性、友好性、可移植性、可扩充性和可重用性等特点。 In order to solve various practical large scale linear optimization problems efficiently,we examine some large scale linear optimization technologies, then design and implement a LOSS(Linear Optimization Solving System) for linear programming problems, integer programming problems and transportation problems, finally we test it with some application examples. The results of large scale testing data show that LOSS is excellent for solving large-scale linear optimization problems. LOSS is provided with flexible selection, friendly interface, transplantation, expandability, and reusability.
出处 《吉林大学学报(信息科学版)》 CAS 2004年第3期256-262,共7页 Journal of Jilin University(Information Science Edition)
基金 国家自然科学基金资助项目(60273080) 吉林省杰出青年基金资助项目
关键词 线性优化求解系统 线性规划 整数规划 运输模型 linear optimization solving system(LOSS) linear programming integer programming transport problem
  • 相关文献

参考文献11

  • 1MARRIOTT K,STUCKEY P J.Programming with Constraints An Introduction[M].Cambridge:The MIT Press,1998.
  • 2SUHL L M,SUHL U H.A fast LU update for linear programming[J].Annals of Operations Research,1993,43:33-47.
  • 3JOHN J FORREST,DONALD GOLDFARB.Steepest-edge simplex algorithms for linear programming [J].Mathematical Programming 1992,57:341-374.
  • 4BAPTISTE P,PAPE C LE,NUIJTE W N.Constraint-Based Scheduling,Applying Constraint Programming to Scheduling Problems[M].Dordecht:Kluwer Academic Publishers,2001.
  • 5GEORGE B DANTZIG.Linear Programming and Extensions[M].Princeton:Princeton University Press,1963.
  • 6孙吉贵,景沈艳.非二元约束满足问题求解[J].计算机学报,2003,26(12):1746-1752. 被引量:16
  • 7孙吉贵 姜英新 张永刚(SUN Ji-gui JIANG Ying-xin ZHANG Yong-gang).连续论域的CSP约束求解技术与实现(Techniques and implementation of solving constraint problems on continuous domain with CSP approaches)[J].计算机集成制造系统,.
  • 8孙吉贵 景沈艳 姜英新(SUNJi-gui JINGShen-yan JIANGYing-xin).约束求解平台(明月1.0版)详细设计(Platform Design of Constraint Solving(Version1.0))[R]..吉林大学决策支持系统研发中心技术报告(Technical Report of DSS Center of J[C].,..
  • 9朱道立(ZHUDao-li).大系统优化理论与应用(Theory and Application of Large Scale Optimization)[M].上海:上海交通大学出版社(Shanghai:Shanghai Jiaotong University Press),1987..
  • 10钱颂迪(QIANSong-di).运筹学(Operational Research)[M].北京:清华大学出版社(Beijing:Tsinghua University Press),1990..

二级参考文献20

  • 1姜启源.数学模型[M].北京:高等教育出版社,1992..
  • 2[1]Bacchus F, van B P. On the conversion between non-binary and binary constraint satisfaction problems. In: Proceedings of AAAI′98,Madison WI,1998. 311~318
  • 3[2]Dent M J, Mercer R E. Minimal forward checking. In: Proceedings of the 6th IEEE International Conference on Tools with Artificial Intelligence, New Orleans, LA,1994. 432~438
  • 4[3]Haralick R M, Elliot G L. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 1980,14(3) :263~313
  • 5[4]Bessiere C, Meseguer P, Freuder E C, Larrosa J. On forward checking for non-binary constraint satisfaction. Artificial Intelligence, 2002, 141(1/2) :205~224
  • 6[5]Mohr R, Masini G. Good old discrete relaxation. In:Proceed-ings of ECAI′88, Munchen, FRG, 1988. 651~656
  • 7[6]Dechter R, Pearl J. Tree clustering for constraint networks.Artificial Intelligence, 1989, 38(3) :353~366
  • 8[7]Dechter R. On the expressiveness of networks with hidden variables. In: Proceedings of the 8th National Conference on Artificial Intelligence, Boston, Mass,1990. 556~562
  • 9[8]Rossi F, Petrie C, Dhar V. On the equivalence of constraint satisfaction problems. In: Proceedings of ECAI′ 90, Stockholm, Sweden, 1990. 550~556
  • 10[9]Larrosa J,Meseguer P. Adding constraint projections in n-ary csp. In: Proceedings of the ECAI′98 workshop on non-binary constraints, Brighton, UK, 1998. 41~48

共引文献15

同被引文献31

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部