Intersection Cuts for Separable Programming,

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 26, 1972
Accession Number
AD0736811

Entities

People

  • Philip B. Zwart

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Construction
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Systems Science

Fields of Study

  • Mathematics

Readers

  • Operations Research