Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Transportation problems and assignment problems
Details

Transportation problems and assignment problems

Date Issued
May 1, 2000
Author(s)
Mukherjee, Jayosree
Advisor(s)
Yueh-er Kuo
Additional Advisor(s)
S. Lenhart
X. Feng
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/46069
Abstract

Special computation techniques have been developed for certain types of linear programming problems that are widely used in mathematical modeling of real life situations. One of the most useful of these special purpose algorithms is transportation method. In a classical transportation problem the cost is minimized by selecting the optimal path for transporting goods from a set of origins to a set of destinations. Assignment method is a special case of more general transportation problem. A discussion of linear programming in general, theory supporting transportation method, methods of finding optimal solution, applications of transportation and assignment problems are presented. Transportation and assignment methods are found to offer significant computational efficiency over the simplex method for certain types of linear problems.

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

Thesis2000M84.pdf

Size

3.38 MB

Format

Unknown

Checksum (MD5)

d74fc253e376b23e383bcf751268efa5

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

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify