Journal: Mathematical Programming (Series A)

Found 506 papers in total
The least element property of center location on tree networks with applications to distance and precedence constrained problems
The least element property of center location on tree networks with applications to distance and precedence constrained problems
1993,
In the classical p- center location model on a network there is a set of customers,...
Laplacian eigenvalues and the maximum cut problem
Laplacian eigenvalues and the maximum cut problem
1993,
The authors introduce and study an eigenvalue upper bound ℝrsquo;(G) on the...
Efficient enumeration of the vertices of polyhedra associated with network LPs
Efficient enumeration of the vertices of polyhedra associated with network LPs
1994,
Algorithms are given to list the vertices of polyhedra associated with network linear...
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
1994,
A new generalized Farkas theorem of the alternative is presented for systems involving...
Representations of quasi-Newton matrices and their use in limited memory methods
Representations of quasi-Newton matrices and their use in limited memory methods
1994,
The authors derive compact representations of BFGS and symmetric rank-one matrices for...
Global minimization by reducing the duality gap
Global minimization by reducing the duality gap
1994,
The authors derive a general principle demonstrating that by partitioning the feasible...
Inexact subgradient methods with applications in stochastic programming
Inexact subgradient methods with applications in stochastic programming
1994,
In many instances, the exact evaluation of an objective function and its subgradients...
Using copositivity for global optimality criteria in concave quadratic programming problems
Using copositivity for global optimality criteria in concave quadratic programming problems
1993,
In this note the authors specify a necessary and sufficient condition for global...
Bounding multi-stage stochastic programs from above
Bounding multi-stage stochastic programs from above
1993,
The purpose of this paper is to present general approaches for bounding some...
Stochastic programming with simple integer recourse
Stochastic programming with simple integer recourse
1993,
Stochastic integer programs are notoriously difficult. Very few properties are known...
A new technique for generating quadratic programming test problems
A new technique for generating quadratic programming test problems
1993,
This paper describes a new technique for generating convex, strictly concave and...
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
1993,
For a given pair of finite point set P and Q in some Euclidean space the authors...
An primal-dual potential reduction algorithm for solving convex quadratic programs
An primal-dual potential reduction algorithm for solving convex quadratic programs
1993,
In this paper the authors combine partial updating and an adaptation of Anstreicher's...
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
1993,
The paper analyses several examples where the maximum entropy solution to a system of...
A class of ‘onto’ multifunctions
A class of ‘onto’ multifunctions
1993,
A convex valued, upper continuous multifunction with pointed closed convex domain is...
Testing balancedness and perfection of linear matrices
Testing balancedness and perfection of linear matrices
1993,
A (0,1) matrix is linear if it does not contain a 2×2 submatrix of all ones. In...
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
1993,
The authors give a new polynomial bound on the complexity of approximating the maximal...
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game
1993,
Given a non-zero sum discounted stochastic game with finitely many states and actions...
Cyclical games with prohibitions
Cyclical games with prohibitions
1993,
The authors consider a certain combinatorial game on a digraph for two cases of the...
A copositive Q-matrix which is not R0.
A copositive Q-matrix which is not R0.
1993,
Jeter and Pye gave an example to show that Pang’s conjecture, that L 1...
Ky Fan’s N-matrices and linear complementarity problems
Ky Fan’s N-matrices and linear complementarity problems
1993,
The paper considers the linear complementarity problem (LCP), w=Az+q, w≥0,...
A note on sufficient conditions for Q 0 and
A note on sufficient conditions for Q 0 and
1993,
The paper settles an open problem posed by Al-Khayyal on a condition being sufficient...
Some new results regarding spikes and a heuristic for spike construction
Some new results regarding spikes and a heuristic for spike construction
1993,
This paper addresses the problem of minimizing the number of columns with...
A general descent framework for the monotone variational inequality problem
A general descent framework for the monotone variational inequality problem
1993,
The authors present a framework for descent algorithms that solve the monotone...
Papers per page: