Equivalent Constraints for Discrete Sets.

Abstract

Two types of 'simplifications' are considered for constraints over discrete sets: (1) replacing real data by equivalent rational data, and (2) collapsing a system of linear or nonlinear equations into an equivalent single equation. Such transformations are not only of computational interest, but also provide some interesting insights into stability properties of integer programs. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1977
Accession Number
ADA042725

Entities

People

  • R. R. Meyer

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Coefficients
  • Continents
  • Defense Mechanisms
  • Equations
  • Geographic Regions
  • Hypotheses
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Mathematics
  • Military Research
  • New York
  • North Carolina
  • Optimization
  • United States
  • Wisconsin

Readers

  • Calculus or Mathematical Analysis