SURROGATE DUAL MULTIPLIER SEARCH PROCEDURES IN INTEGER PROGRAMMING

被引：37

作者：

KARWAN, MH ^{[1
]}

RARDIN, RL ^{[1
]}

机构：

[1] PURDUE UNIV,W LAFAYETTE,IN 47907

来源：

OPERATIONS RESEARCH | 1984年 / 32卷 / 01期

关键词：

D O I：

10.1287/opre.32.1.52

中图分类号：

C93 [管理学];

学科分类号：

12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

引用

页码：52 / 69

页数：18

共 22 条

[1]

THE RELAXATION METHOD FOR LINEAR INEQUALITIES [J].

AGMON, S .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1954, 6 (03) :382-392

[2]

DISCRETE PROGRAMMING BY FILTER METHOD [J].

BALAS, E .

OPERATIONS RESEARCH, 1967, 15 (05) :915-+

[3]

BANERJEE K, 1971, ORC7112 U CAL OP RES

[4]

ALGORITHM FOR FINDING SHORTEST ELEMENT OF A POLYHEDRAL SET WITH APPLICATION TO LAGRANGIAN DUALITY [J].

BAZARAA, MS ;

GOODE, JJ ;

RARDIN, RL .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1978, 65 (02) :278-288

[5]

SURVEY OF VARIOUS TACTICS FOR GENERATING LAGRANGIAN MULTIPLIERS IN THE CONTEXT OF LAGRANGIAN DUALITY [J].

BAZARAA, MS ;

GOODE, JJ .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (04) :322-338

[6]

Bazaraa MS., 2008, LINEAR PROGRAMMING N

[7]

FINDING EVERETTS LAGRANGE MULTIPLIERS BY LINEAR PROGRAMMING [J].

BROOKS, R ;

GEOFFRION, A .

OPERATIONS RESEARCH, 1966, 14 (06) :1149-&

[8]

OPTIMAL SOLUTION OF SCHEDULING PROBLEMS USING LAGRANGE MULTIPLIERS .1. [J].

FISHER, ML .

OPERATIONS RESEARCH, 1973, 21 (05) :1114-1127

[9]

FISHER ML, 1975, MATH PROGRAMMING STU, V3, P59

[10]

Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]

← 1 2 3 →