A NOTE ON LINEAR PROGRAMMING AND INTEGER FEASIBILITY

Abstract

A theorem is given that provides new strategies for solving integer programming problems, based on finding certain types of basic solutions to linear programs. The theorem is motivated by and extends ideas of Cabot and Hurter. An integer programming method based on the theorem is outlined.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1968
Accession Number
AD0675499

Entities

People

  • Fred Glover

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computer Programming
  • Contracts
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Military Research
  • Schools
  • Security
  • Simplex Method
  • Supply Chain Management
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research