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

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)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1974
Accession Number
AD0785568

Entities

People

  • Keven J. Reardon

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Applied Mathematics
  • Computer Programming
  • Contracts
  • Decomposition
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Systems Science

Fields of Study

  • Mathematics

Readers

  • Operations Research