Parametric Integer Programming

Abstract

A parametric integer linear program (PILP) may be defined as a family of closely related integer linear programs (ILP). Within this definition the author incorporates not only continuous scalar parameterizations but also finite parameterizations. These may include an ILP with a finite number of objective functions or right hand sides or constraint matrices or any combination of these. A general framework for PILP is presented. It begins by outlining the need for PILP algorithms. Basic solution methodologies are explained and two rudimentary approaches for the PILP are stated. Theoretical properties for special parameterizations are proved, and techniques for improving algorithmic efficiency are discussed. The framework concludes with an examination of underlying factors which intimately relate to the scheduling of solution priorities in a PILP algorithm.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1975
Accession Number
ADA006401

Entities

People

  • Robert M. Nauss

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computations
  • Computer Programming
  • Computers
  • Discontinuities
  • Efficiency
  • Evolutionary Algorithms
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Optimization
  • Simplex Method
  • Theses
  • Universities

Readers

  • Aquatic Ecology
  • Computer Programming and Software Development.
  • Theoretical Analysis.