Journal: Mathematical Programming (Series A)

Found 506 papers in total
Quadratically constrained minimum cross-entropy analysis
Quadratically constrained minimum cross-entropy analysis
1989,
Quadratically constrained minimum cross-entropy problem has recently been studied by...
Marginal values in mixed integer programming
Marginal values in mixed integer programming
1989,
For a given optimization problem, P, considered as a function of the data, its...
An interior point algorithm for semi-infinite linear programming
An interior point algorithm for semi-infinite linear programming
1989,
The authors consider the generalization of a variant of Karmarkar’s algorithm to...
Interior path following primal-dual algorithms, part I: Linear programming
Interior path following primal-dual algorithms, part I: Linear programming
1989,
The authors describe a primal-dual interior point algorithm for linear programming...
A polynomial-time algorithm for a class of linear complementarity problems
A polynomial-time algorithm for a class of linear complementarity problems
1989,
Given an n × n matrix M and an n -dimensional vector q , the problem of finding...
On strongly degenerate complementary cones and solution rays
On strongly degenerate complementary cones and solution rays
1989,
In this paper the authors show that if A is a matrix in the class of matrices E ( d ),...
Nonlinear programming and nonsmooth optimization by successive linear programming
Nonlinear programming and nonsmooth optimization by successive linear programming
1989,
Methods are considered for solving nonlinear programming problems using an exact l 1...
A robust sequential quadratic programming method
A robust sequential quadratic programming method
1989,
The sequential quadratic programming method developed by Wilson, Han and Powell may...
Interior path following primal-dual algorithms, part II: Convex quadratic programming
Interior path following primal-dual algorithms, part II: Convex quadratic programming
1989,
The authors describe a primal-dual interior point algorithm for convex quadratic...
A constructive proof of a permutation-based generalization of Sperner’s lemma
A constructive proof of a permutation-based generalization of Sperner’s lemma
1989,
In a recent paper, Gale has given an interesting generalization of the KKM lemma in...
Sublinear upper bounds for stochastic programs with recourse
Sublinear upper bounds for stochastic programs with recourse
1989,
Separable sublinear functions are used to provide upper bounds on the recourse...
Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models
Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models
1989,
An iterative method based on the successive overrelaxation (SOR) is proposed to solve...
Fitting maps of the plane to experimental data
Fitting maps of the plane to experimental data
1989,
This paper is motivated by the problem of fitting a differential equation to...
Polyhedra of regular p-nary group problems
Polyhedra of regular p-nary group problems
1989,
The duality for group problems developed earlier is restricted to p -nary group...
On the 0,1 facets of the set covering polytope
On the 0,1 facets of the set covering polytope
1989,
In this paper, the authors consider inequalities of the form Σ α j x j...
On the set covering polytope: I. All the facets with coefficients in {0,1,2}
On the set covering polytope: I. All the facets with coefficients in {0,1,2}
1989,
While the set packing polytope, through its connection with vertex packing, has lent...
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
1989,
The authors study the performance of some rank-two ellipsoid algorithms when used to...
A result in surrogate duality for certain integer programming problems
A result in surrogate duality for certain integer programming problems
1989,
The authors consider linear programming problems with some equality constraints. For...
Affine-scaling for linear programs with free variables
Affine-scaling for linear programs with free variables
1989,
The affine-scaling modification of Karmarkar’s algorithm is extended to solve...
A generalized inverse method for asymptotic linear programming
A generalized inverse method for asymptotic linear programming
1989,
Consider a linear program in which the entries of the coefficient matrix vary linearly...
Conical projection algorithms for linear programming
Conical projection algorithms for linear programming
1989,
The Linear Programming Problem is manipulated to be stated as a Non-Linear Programming...
A combined phase I-phase II projective algorithm for linear programming
A combined phase I-phase II projective algorithm for linear programming
1989,
We devise a projective algorithm which explicitly considers the constraint that an...
A new approach to the analysis of random methods for detecting necessary linear inequality constraints
A new approach to the analysis of random methods for detecting necessary linear inequality constraints
1989,
A new approach is given for the analysis of random methods for detecting necessary...
A new continuation method for complementarity problems with uniform P-functions
A new continuation method for complementarity problems with uniform P-functions
1989,
The complementarity problem with a nonlinear continuous mapping f from the nonnegative...
Papers per page: