首页> 美国政府科技报告 >PARTITION PROGRAMMING FOR BLOCK DIAGONAL MATRICES
【24h】

PARTITION PROGRAMMING FOR BLOCK DIAGONAL MATRICES

机译:块对角矩阵的分区规划

获取原文

摘要

Progress in this area was initiated by the Dantzig and Wolfe decomposition method [5] for large linear problems with such a structure. Related methods suitable for the solution of large linear problems have recently been described [l, 2]. A method for large nonlinear problems has recently been published [5], and is basically a partitioning method suitable for the solution of large nonlinear problems with a block diagonal structure, where the right hand sides of the constraints may be convex nonlinear functions of a set of decision or coupling variables. Because the blocks are connected through the coupling variables it is natural to consider this as the dual form of a block diagonal problem.

著录项

  • 作者

    J. B. Rosen;

  • 作者单位
  • 年度 1963
  • 页码 1-34
  • 总页数 34
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 工业技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号