Year: 1984
Type: article
Abstract: A method is developed for solving parametric mixed integer linear programming problems (PMIP). PMIP considered here is a parametric analysis for right-hand-side values of the constraints which are varied continuously. The basic framework of the method is based on the conventional branch-and-bound approach to mixed integer programming.Previously there has existed only one method that could be applied to solve PMIP. Since the previous method is a heuristic approach, true optimal solution is not always obtained. The present method is not based on heuristic approach, and, therefore, the complete optimal solution can be obtained. The characteristic of the present method is that a range set of parameter value is defined for each node, for which the lower bound function has to be calculated. This results in saving of considerate computational efforts. A computational study shows that solution times required by the present method are about 50-60 percent of those by the previous heuristic method.
Authors: Yoshiaki OHTAKE, Naonori NISHIDA
Institution: Tokyo University of Science
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2323790953