An Algorithm for Solving Integer Interval Linear Programming Problems: A New Method for Mixed Integer Programming.

Abstract

The paper presents a new algorithm for solving integer linear programming problems. First the problem is transformed into an equivalent integer interval linear programming problem; and then a branch and bound method is applied to solve the equivalent problem. At each stage an interval linear programming problem of the most trivial type is to be solved. Gains in solution efficiency over other integer programming methods are anticipated. The method is equally valid for mixed integer problems. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1973
Accession Number
AD0779137

Entities

People

  • Abraham Charnes
  • F. Granot

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Efficiency
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Interdisciplinary Science
  • Intervals
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Operations Research