Accession Number:

AD0648053

Title:

A NEW FOUNDATION FOR A SIMPLIFIED PRIMAL INTEGER PROGRAMMING ALGORITHM

Descriptive Note:

Research rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1966-11-01

Pagination or Media Count:

20.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE