Accession Number:

AD0736811

Title:

Intersection Cuts for Separable Programming,

Descriptive Note:

Corporate Author:

WASHINGTON UNIV ST LOUIS MO CONTROL SYSTEMS SCIENCE AND ENGINEERING

Personal Author(s):

Report Date:

1972-01-26

Pagination or Media Count:

21.0

Abstract:

The intersection cuts for integer programming are based on the use of convex functions possessing certain properties. The delta-form and lambda-form of separable programming yield linear programming problems with special restrictions different from integer requirements. Suitable convex functions are presented for construction of intersection cuts in the delta-form and lambda-form of separable programming. Such cuts also represent a way of reducing the gap which arises in the application of the generalized Lagrange multiplier method. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE