All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 32 Next

Displaying 621 – 640 of 3923

Showing per page

An adaptive long step interior point algorithm for linear optimization

Maziar Salahi (2010)

Kybernetika

It is well known that a large neighborhood interior point algorithm for linear optimization performs much better in implementation than its small neighborhood counterparts. One of the key elements of interior point algorithms is how to update the barrier parameter. The main goal of this paper is to introduce an “adaptive” long step interior-point algorithm in a large neighborhood of central path using the classical logarithmic barrier function having O ( n log ( x 0 ) T s 0 ϵ ) iteration complexity analogous to the classical...

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

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

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 multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2006)

RAIRO - Operations Research

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

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 Algorithm For Solving Multiple Objective Integer Linear Programming Problem

Moncef Abbas, Djamal Chaabane (2010)

RAIRO - Operations Research

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.

Currently displaying 621 – 640 of 3923