Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Methods for solution to the integer linear programming problem
Details

Methods for solution to the integer linear programming problem

Date Issued
June 1976
Author(s)
Hassell, David F.
Advisor(s)
Yuen-er Kuo
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/60943
Abstract

The purpose of this thesis is to consider methods for the solution to the integer constrained linear programming problem (ILP). To be considered are the method of reducing the feasible solution set by introduction of cutting plane constraints, and the method of reducing the ILP to a knapsack formulation.

Chapter I introduces the ILP and the theoretical basis for the cutting plane approach, along with a method for choosing the cutting plane. The all-integer algorithm with its special choice of cutting planes is then presented in Chapter II.

The knapsack problem, a special case of the ILP, is discussed in Chapter III. Following in Chapter IV is a proof that any ILP in bounded variables can be reduced to a knapsack problem in bounded variables. Finally, an algorithm is presented for solution of the knapsack problem in bounded variables.

 
Degree
Master of Science
Major
Mathematics
File(s)
Thumbnail Image
Name

Thesis76.H288.pdf

Size

2.06 MB

Format

Adobe PDF

Checksum (MD5)

8db15f3a801b3c95a6dc886b0aa81bad


University Libraries

1015 Volunteer Boulevard
Knoxville, TN 37996
865-974-4351

Map & Directions
Donate to the Libraries
  • About
  • John C. Hodges Society
  • Speaking Volumes magazine
  • Outreach
  • Directory
  • Employment
  • Policies
  • Library Intranet
University of Tennessee power T logo

The University of Tennessee, Knoxville
Knoxville, Tennessee 37996
865-974-1000

Events
A-Z
Apply
Privacy
Map
Directory
Give to UT
Accessibility

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science