Minimizing two different upper bounds of the matrix which generates search directions of the nonlinear conjugate gradient method proposed by Dai and Liao, two modified conjugate gradient methods are proposed. Under proper conditions, it is briefly shown that the methods are globally convergent...

In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve...

One of the main services of National Statistical Agencies (NSAs) for the current Information Society is the dissemination of large amounts of tabular data, which is obtained from microdata by crossing one or more categorical variables. NSAs must guarantee that no confidential individual...

The computational time required by interior-point methods is often dominated by the solution of linear systems of equations. An efficient specialized interior-point algorithm for primal block-angular problems has been used to solve these systems by combining Cholesky factorizations for the block...

In this paper we consider choice problems under the assumption that the preferences of the decision maker are expressed in the form of a parametric partial weak order without assuming the existence of any value function. We investigate both the sensitivity (stability) of each non-dominated...

Decision making in public and political contexts can be complex. Multi-attribute value/utility theory (MAVT/MAUT) can support such decision processes by providing a transparent framework that helps focusing on objectives and corresponding degrees of achievement by different alternatives.

In this paper we develop a methodology to study the sensitivity and the stability of models built using the Analytic Network Process. We study two types of stability: core and solution stability. The former deals with finding the region of the perturbation space in which the initial solution...

Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the...

In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is...

Using a market share attraction structure of advertising competition and following a supermodular game approach, this article demonstrates for an asymmetric oligopoly, the directional impact of changes in model parameters on the marketing controlled variables of all rivals (advertising budgets)...