An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function

An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function

0.00 Avg rating0 Votes
Article ID: iaor200947161
Country: France
Volume: 43
Issue: 1
Start Page Number: 1
End Page Number: 12
Publication Date: Jan 2009
Journal: RAIRO Operations Research
Authors: ,
Keywords: programming: parametric
Abstract:

The multiparametric 0–1–Integer Programming (0–1–IP) problem relative to the objective function is a family of 0–1–IP problems which are related by having identical constraint matrix and right–hand–side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.

Reviews

Required fields are marked *. Your email address will not be published.