The main thrust of this research is to develop four solution procedures for the Fixed Charge Problem. All are based on approximating the fixed charge component by strictly polygonal linear components. The first procedure uses the functions technique to approximate the fixed charge; then linear programming with the restricted-basisentry technique is used to arrive at the final solution. Although this method starts with an approximated version of the fixed charge component, it arrives at an exact value to the objective function without the need for re-evaluating the objective function. The other three solution procedures are based on approximating the fixed charge component with a single line. Ordinary linear programming is then applied. All four procedures terminate using specialized Branch-andBound. Applying these solutions to the classical test problems reported in the literature results in substantial savings in the number of sub-problems solved. All four procedures can be used as stand-alone heuristics and are extremely efficient, sometimes performing over 150 times faster than the exact branch-and-bound method. Computational experiences with these procedures on fi xed charge transportation problems and resource allocation problems are reported.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Swart, William W.
Doctor of Philosophy (Ph.D.)
College of Engineering
Industrial Engineering and Management Systems
Length of Campus-only Access
Doctoral Dissertation (Open Access)
Dissertations, Academic -- Engineering; Engineering -- Dissertations, Academic
Moreb, Ahmad Abdulah, "Efficient algorithms for the fixed charge problem" (1988). Retrospective Theses and Dissertations. 4316.