A NEW FOUNDATION FOR A SIMPLIFIED PRIMAL INTEGER PROGRAMMING ALGORITHM

Abstract

Following the approach underlying the Pseudo Primal-Dual Integer Programming Algorithm, new foundation for the Young Simplified Primal Integer Programming Algorithm is given. Simplifications in conception and presentation are developed to produce a primal integer algorithm that is particularly easy to justify and implement. In addition, new choice rules are prescribed which guarantee finite convergence, and a criterion of optimality is introduced that permits the algorithm to terminate before dual feasibility is achieved.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1966
Accession Number
AD0648053

Entities

People

  • Fred Glover

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Air Platforms
  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Computer Programming
  • Contractors
  • Contracts
  • Convergence
  • Equations
  • Governments
  • Heuristic Methods
  • Instructions
  • Integer Programming
  • Intervals
  • Linear Programming
  • Security
  • Simplex Method
  • United States Government

Readers

  • Operations Research