Country: Netherlands

Found 18376 papers in total
Long steps in an O(n3L) algorithm for linear programming
Long steps in an O(n3L) algorithm for linear programming
1992,
The authors consider partial updating in Ye’s affine potential reduction...
A polynomial method of approximate centers for linear programming
A polynomial method of approximate centers for linear programming
1992,
The authors present a path-following algorithm for the linear programming problem with...
On Anstreicher’s combined phase I-phase II projective algorithm for linear programming
On Anstreicher’s combined phase I-phase II projective algorithm for linear programming
1992,
Anstreicher has proposed a variant of Karmarkar’s projective algorithm that...
Prior reduced fill-in in solving equations in interior point algorithms
Prior reduced fill-in in solving equations in interior point algorithms
1992,
The efficiency of interior-point algorithms for linear programming is related to the...
Todd’s low-complexity algorithm is a predictor-corrector path-following method
Todd’s low-complexity algorithm is a predictor-corrector path-following method
1992,
The authors show that Todd’s low-complexity algorithm for linear programming...
On interior algorithms for linear programming with no regularity assumptions
On interior algorithms for linear programming with no regularity assumptions
1992,
The linear programming algorithm of Karmarkar, and all interior methods subsequently...
A lexicographic minimax algorithm for multiperiod resource allocation
A lexicographic minimax algorithm for multiperiod resource allocation
1992,
Resource allocation problems are typically formulated as mathematical programs with...
A projective algorithm for linear programming with no regularity condition
A projective algorithm for linear programming with no regularity condition
1992,
The combined phase I-phase II projective algorithm of de Ghellinck and Vial solves any...
Strict monotonicity in Todd’s low-complexity algorithm for linear programming
Strict monotonicity in Todd’s low-complexity algorithm for linear programming
1992,
The authors propose a strictly monotone algorithm in the true objective for linear...
A hierarchical algorithm for making sparse matrices sparser
A hierarchical algorithm for making sparse matrices sparser
1992,
If A is the (sparse) coefficient matrix of linear equality constraints, for what...
On the use of rational iterative methods for solving large sparse linear systems
On the use of rational iterative methods for solving large sparse linear systems
1992,
In this paper the authors describe some work which is being carried on in the Center...
A globally and quadratically convergent affine scaling method for linear .
A globally and quadratically convergent affine scaling method for linear .
1992,
Recently, various interior point algorithms related to the Karmarkar algorithm have...
Generalized convexity on affine subspaces with an application to potential functions
Generalized convexity on affine subspaces with an application to potential functions
1992,
Second order conditions for the (pseudo-) convexity of a function restricted to an...
On affine scaling and semi-infinite programming
On affine scaling and semi-infinite programming
1992,
The authors consider an extension of the affine scaling algorithm for linear...
Stochastic optimization of reservation systems
Stochastic optimization of reservation systems
1991,
An optimal access strategy for managing reservation systems with Poisson arrivals is...
A finite algorithm for solving the Generalized Lattice Point Problem
A finite algorithm for solving the Generalized Lattice Point Problem
1991,
The paper deals with the nonconvex program called Generalized Lattice Point Problem....
The equivalence of an LCP to a parametric linear program with a scalar parameter
The equivalence of an LCP to a parametric linear program with a scalar parameter
1991,
In this paper, solving a linear complementarity problem is shown to be equivalent to...
Crashing a maximum-weight complementary basis
Crashing a maximum-weight complementary basis
1992,
The authors consider the problem of finding a maximum-weight complementary basis of an...
Finite dimensional approximation in infinite dimensional mathematical programming
Finite dimensional approximation in infinite dimensional mathematical programming
1992,
The authors consider the problem of approximating an optimal solution to a separable,...
On a global error bound for a class of monotone affine variational inequality problems
On a global error bound for a class of monotone affine variational inequality problems
1992,
The authors give, for a class of monotone affine variational inequality problems, a...
Weak duality theorem and complementary slackness theorem for linear matrix programming problems
Weak duality theorem and complementary slackness theorem for linear matrix programming problems
1992,
In this paper the authors present a weak duality theorem and a complementary slackness...
A linear programming approach to solving bilinear programmes
A linear programming approach to solving bilinear programmes
1992,
This paper discusses the maximization of a bilinear function over two independent...
Solution behavior for parametric implicit complementarity problems
Solution behavior for parametric implicit complementarity problems
1992,
In this paper the authors study the solution behavior for a special class of...
A note on scalarizing functions under changing sets of criteria
A note on scalarizing functions under changing sets of criteria
1991,
The paper shows that a scalarizing function widely used with the reference point...
Papers per page: