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 23 Next

Displaying 441 – 460 of 612

Showing per page

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2006)

RAIRO - Operations Research

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers' travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...

An accurate active set Newton algorithm for large scale bound constrained optimization

Li Sun, Guoping He, Yongli Wang, Changyin Zhou (2011)

Applications of Mathematics

A new algorithm for solving large scale bound constrained minimization problems is proposed. The algorithm is based on an accurate identification technique of the active set proposed by Facchinei, Fischer and Kanzow in 1998. A further division of the active set yields the global convergence of the new algorithm. In particular, the convergence rate is superlinear without requiring the strict complementarity assumption. Numerical tests demonstrate the efficiency and performance of the present strategy...

An active set strategy based on the multiplier function or the gradient

Li Sun, Liang Fang, Guoping He (2010)

Applications of Mathematics

We employ the active set strategy which was proposed by Facchinei for solving large scale bound constrained optimization problems. As the special structure of the bound constrained problem, a simple rule is used for updating the multipliers. Numerical results show that the active set identification strategy is practical and efficient.

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.

Currently displaying 441 – 460 of 612