An algorithm for multiparametric min max 0–1-integer programming problems relative to the objective function

An algorithm for multiparametric min max 0–1-integer programming problems relative to the objective function

0.00 Avg rating0 Votes
Article ID: iaor20071462
Country: France
Volume: 39
Issue: 4
Start Page Number: 243
End Page Number: 252
Publication Date: Oct 2005
Journal: RAIRO Operations Research
Authors: ,
Abstract:

The multiparametric min max 0–1-Integer Programming (0–1-IP) problem relative to the objective function is a family of min max 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 the objective function.

Reviews

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