Accession Number : AD0723088

Title :   A Class of Cuts and Related Algorithms in Integer Programming.

Descriptive Note : Research rept.,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s) : Burdet,Claude-Alain

Report Date : SEP 1970

Pagination or Media Count : 46

Abstract : A new family of intersection cuts is obtained from a class of convex polyhedra (generalized octahedra). It is shown that these cuts can also be obtained as convex combinations of the Gomory mixed integer cuts. A constructive approach to obtain improved (i.e. deeper) cuts is then presented and discussed. (Author)

Descriptors :   (*MATHEMATICAL PROGRAMMING, ALGORITHMS), MATRICES(MATHEMATICS), SET THEORY, INEQUALITIES, ITERATIONS, OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE