Displaying similar documents to “Reverse bridge theorem under constraint partition.”

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

José Luis Quintero, Alejandro Crema (2009)

RAIRO - Operations Research

Similarity:

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.

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

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

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.

An Algorithm For Solving Multiple Objective Integer Linear Programming Problem

Moncef Abbas, Djamal Chaabane (2010)

RAIRO - Operations Research

Similarity:

In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.

Reformulations in Mathematical Programming: Definitions and Systematics

Leo Liberti (2009)

RAIRO - Operations Research

Similarity:

A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...