Page Cuts for Integer Interval Linear Programming.

Abstract

In this paper a cutting plane algorithm is developed to solve Integer Interval Linear Programming (IILPs). As in other cutting plane algorithms the integer restrictions are dropped first and the resulting interval programming problem is solved. The cuts which are constructed are valid cuts since an optimal noninteger solution will be eliminated but all feasible integer solutions will satisfy the cut constraint.

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1975
Accession Number
ADA022689

Entities

People

  • Abraham Charnes
  • Francis R. Phillips
  • R. Armstrong

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Intervals
  • Linear Programming
  • Mathematics
  • Simplex Method

Readers

  • Operations Research