Journal: Mathematical Programming (Series A)

Found 506 papers in total
Gainfree Leontief substitution flow problems
Gainfree Leontief substitution flow problems
1992,
Leontief substitution systems have been studied by economists and operations...
An analogue of Hoffman’s circulation conditions for max-balanced flows
An analogue of Hoffman’s circulation conditions for max-balanced flows
1992,
Let D=(V,A) be a directed graph. A real-valued vector x defined on the arc set A is a...
On finite convergence and constraint identification of subgradient projection methods
On finite convergence and constraint identification of subgradient projection methods
1992,
This paper deals with a continuous time, subgradient projection algorithm, shown to...
Steepest-edge simplex algorithm for linear programming
Steepest-edge simplex algorithm for linear programming
1992,
The authors present several new steepest-edge simplex algorithms for solving linear...
The generalized linear complementarity problem and an algorithm to find all its solutions
The generalized linear complementarity problem and an algorithm to find all its solutions
1992,
Motivated by a number of typical applications, a generalization of the classical...
Almost P0-matrices and the class Q.
Almost P0-matrices and the class Q.
1992,
This paper demonstrates that within the class of those n×n matrices, each of...
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization
1992,
In this paper the problem of stopping the Multistart algorithm for global optimization...
Persistency in quadratic 0-1 optimization
Persistency in quadratic 0-1 optimization
1992,
This paper is concerned with persistency properties which allow the evaluation of some...
Tight integral duality gap in the Chinese Postman problem
Tight integral duality gap in the Chinese Postman problem
1992,
Let G=(V,E) be a graph and let w be a weight function w:E⇒Z’+ . Let...
A polynomial algorithm for an integer quadratic non-separable transportation problem
A polynomial algorithm for an integer quadratic non-separable transportation problem
1992,
The authors study the problem of minimizing the total weighted tardiness when...
Solving combinatorial optimization problems using Karmarkar’s algorithm
Solving combinatorial optimization problems using Karmarkar’s algorithm
1992,
The authors describe a cutting plane algorithm for solving combinatorial optimization...
Extremal points and optimal solutions for general capacity problems
Extremal points and optimal solutions for general capacity problems
1992,
This paper studies the infinite dimensional linear programming problems in the...
On the best case performance of hit and run methods for detecting necessary constraints
On the best case performance of hit and run methods for detecting necessary constraints
1992,
The hit and run methods are probabilistic algorithms that can be used to detect...
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...
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 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...
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...
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,...
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...
Papers per page: