Accession Number:

AD0785568

Title:

A Decomposition Method for the Solution of Dual-Angular Integer Programs.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF SYSTEMS OPTIMIZATION LAB

Personal Author(s):

Report Date:

1974-08-01

Pagination or Media Count:

84.0

Abstract:

Integer linear programming problems whose constraint matrices have dual-angular structures arise in several types of applications, particularly those which seek to specify a strategy for future actions based on observed results of previous decisions. An implicit enumeration method for integer linear programming is developed for application to problems with such dual-angular constraint matrices. Modified author abstract

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE