Displaying similar documents to “Binary integer programming solution for troubleshooting with dependent actions”

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research

Similarity:

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of...

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 ...

Column-Generation in Integer Linear Programming

Nelson Maculan, Marcos de Mendonça Passini, José André de Moura Brito, Irene Loiseau (2010)

RAIRO - Operations Research

Similarity:

We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application...

Multiobjective De Novo Linear Programming

Petr Fiala (2011)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

Mathematical programming under multiple objectives has emerged as a powerful tool to assist in the process of searching for decisions which best satisfy a multitude of conflicting objectives. In multiobjective linear programming problems it is usually impossible to optimize all objectives in a given system. Trade-offs are properties of inadequately designed system a thus can be eliminated through designing better one. Multiobjective De Novo linear programming is problem for designing...