METHOD OF DECOMPOSITION FOR INTEGER PROGRAMS

被引：28

作者：

SWEENEY, DJ

MURPHY, RA

机构：

来源：

OPERATIONS RESEARCH | 1979年 / 27卷 / 06期

关键词：

D O I：

10.1287/opre.27.6.1128

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is discussed and some computational results are reported.

引用

页码：1128 / 1141

页数：14

共 14 条

[1] BEALE EML, 1969, 5TH P INT C OP RES, P447
[2] DANTZIG GB, 1963, LINEAR PROGRAMMING E, pCH24
[3] FISHER ML, 1975, MATHEMATICAL PROGRAM, V3, P56
[4] PRACTICAL SOLUTION OF LARGE MIXED INTEGER PROGRAMMING PROBLEMS WITH UMPIRE
FORREST, JJH
HIRST, JPH
TOMLIN, JA
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05): : 736 - 773
[5] Garfinkel R. S., 1972, INTEGER PROGRAMMING
[6] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[7] PARAMETRIC AND POSTOPTIMALITY ANALYSIS IN INTEGER LINEAR-PROGRAMMING
GEOFFRION, AM
NAUSS, R
[J]. MANAGEMENT SCIENCE, 1977, 23 (05) : 453 - 466
[8] INTEGER PROGRAMMING ALGORITHMS - FRAMEWORK AND STATE-OF-ART SURVEY
GEOFFRION, AM
MARSTEN, RE
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09): : 465 - 491
[9] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[10] LASDON L, 1970, OPTIMIZATION THEORY

← 1 2 →