论文信息 - Generalized Lagrange Multipliers in Integer Programming

Generalized Lagrange Multipliers in Integer Programming

This paper combines the theory of generalized Lagrange multipliers with a reformulation of the integer-programming problem due to group theory. The use of multipliers enhances the algorithmic efficiency of group theory in a variety of ways. One particular application is the approximation of generalized Lagrange multipliers by generalized linear programming as suggested by Brooks and Geoffrion. This procedure is shown to be closely related to the cutting-plane method of Gomory.

Jeremy F. Shapiro | J. Shapiro

[1] Arthur M. Geoffrion,et al. Letter to the Editor - Finding Everett's Lagrange Multipliers by Linear Programming , 1966, Operational Research.

[2] A. Klevorick,et al. A Note on the Dual Prices of Integer Programs , 1966 .

[3] Claude Berge,et al. The Theory Of Graphs , 1962 .

[4] Arthur M. Geoffrion,et al. An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[5] Ralph E. Gomory,et al. INTEGER PROGRAMMING AND PRICING , 1960 .

[6] Harvey J. Everett. Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[7] Egon Balas,et al. DUALITY IN DISCRETE PROGRAMMING , 1967 .

[8] H. Weingartner. Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[9] J. Shapiro. Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem , 1968 .

[10] Seymour Kaplan. Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method , 1966, Oper. Res..