Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
478955 | European Journal of Operational Research | 2008 | 8 Pages |
Abstract
Integer linear programming (ILP) problems occur frequently in many applications. In practice, alternative optima are useful since they allow the decision maker to choose from multiple solutions without experiencing any deterioration in the objective function. This study proposes a general integer cut to exclude the previous solution and presents an algorithm to identify all alternative optimal solutions of an ILP problem. Numerical examples in real applications are presented to demonstrate the usefulness of the proposed method.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jung-Fa Tsai, Ming-Hua Lin, Yi-Chung Hu,