This paper discusses the selection and design of heuristic procedures for solving one-dimensional roll trim problems. These are well-defined combinatorial problems which are too large to optimize. Five different roll trim problems from the paper and film industries are described along with the...

We propose and test a new pricing procedure for solving large-scale structured linear programs. The procedure interactively solves a relaxed subproblem to identify potential entering basic columns. The subproblem is chosen to exploit special structure, rendering it easy to solve. The effect of...

As databases grow more prevalent and comprehensive, database administrators seek to limit disclosure of confidential information while still providing access to data. Practical databases accommodate users with heterogeneous needs for access. Each class of data user is accorded access to only...

This paper investigates the solution of the linear programming (LP) relaxation of the multi-commodity flow formulation of the multiple-depot vehicle scheduling problems arising in public mass transit. We develop a column generation technique that makes it possible to solve the huge linear...

Data Envelopment Analysis (DEA) evaluates the relative efficiency of decision-making units (DMUs) but does not allow for a ranking of the efficient units themselves. A modified version of DEA based upon comparison of efficient DMUs relative to a reference technology spanned by all other units is...

We propose and analyze a heuristic that uses region partitioning and an aggregation scheme for customer attributes (load size, time windows, etc.) to create a finite number of customer types. A math program is solved based on these aggregated customer types to generate a feasible solution to the...

Single objective cost minimization linear programming models are used as computerized decision-aids in sausage manufacturing (hot dogs, bologna, salami, etc.). However, sausage blending is clearly a problem with multiple conflicting criteria (cost, color, fat, protein, moisture, etc.) Presented...

This paper presents a proactive strategic methodology for designing dynamic layouts for the expansion (or decline) phase of manufacturing systems. The methodology first estimates probable scenarios of the system requirements at its maturity level, strategically designs mature layouts given the...

The purpose of this note is to present a reformulation of the model presented by Konno and Yamazaki (1991). In their paper, it was claimed that (under the assumption that there is no upper limit on the investment in an asset) the number of nonzero assets in the optimal portfolio is at most 2T +...

This paper describes some rules for combining component models into complete linear programs. The objective is to lay the foundations for systems that give users flexibility in designing new models and reusing old ones, while, at the same time, providing better documentation and better...