Research Reports from the Department of Operations

Authors

Leon S. Lasdon

Document Type

Report

Publication Date

6-1-1971

Abstract

Generalized Upper Bounding (GUB) is an efficient specialization of the Simplex Method for problems with disjoint rows of ones. The principles of the method are briefly reviewed, and an application to multi-item production scheduling is presented. A multifacility extension of the scheduling model is formulated and solved using GUB in conjunction with Bender's Partitioning algorithm. Application of GUB to integrated production and distribution problems is also discussed.

Keywords

Operations research, Production scheduling, Linear programming, Mathematical optimization, Industrial management--Mathematical models

Publication Title

Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University

Issue

Technical memorandum no. 234

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.