Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear
Programming

John Sylva; Alejandro Crema

The search session has expired. Please query the service again.

Displaying similar documents to “Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming”

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 (2002)

RAIRO - Operations Research - Recherche Opérationnelle

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.

An Enumerative Algorithm for Non-Linear Multi-Level Integer Programming Problem

Ritu Narang, S.R. Arora (2009)

The Yugoslav Journal of Operations Research

Similarity:

A Two-Phase Linear Programming Approach for Redundancy Allocation Problems

Yi-Chih Hsieh (2002)

The Yugoslav Journal of Operations Research

Similarity:

A comparative study of redundant constraints identification methods in linear programming problems.

S., Paulraj, P., Sumathi (2010)

Mathematical Problems in Engineering

Similarity:

Integer Programming Formulation of the Bilevel Knapsack Problem

R. Mansi, S. Hanafi, L. Brotcorne (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that ...

On a bicriteria optimal production plan

Dorota Kuchta (2007)

Control and Cybernetics

Similarity: