Three Intermediate Optimization Problems with a CSU-Based Data Set
Directory : Faculty : Intellectual Contributions
Intellectual Contribution by Robert Saltzman
Contribution Title
Three Intermediate Optimization Problems with a CSU-Based Data Set
Publication
California Journal of Operations Management
Co-author
Year
2004
Description
This article presents three medium-sized optimization problems using data from the California State University (CSU) system. These problems reference a matrix of distances between the system's 23 campuses and are formulated and solved in OPL Studio, an optimization software package that combines features of traditional mathematical programming with those of constraint programming. Problem 1 considers how the CSU campuses should be divided into three major regions so as to minimize the total distance between all campuses within a region, while Problem 2 develops an optimal lecture tour of the 23 CSU campuses. Finally, Problem 3 finds a mixed-mode distribution plan that minimizes a text publisher's total shipping costs to the campuses. It would be appropriate to present these problems in an intermediate course in operations management, decision sciences, or related course.
Complete Citation
Saltzman, R., "Three Intermediate Optimization Problems with a CSU-Based Data Set," California Journal of Operations Management, Vol. 2, No. 1, pp. 6-11, Feb. 2004.
Website
See Faculty: Robert Saltzman




