Journal: Mathematical Programming (Series A)

Found 506 papers in total
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q0.
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q0.
1991,
The paper simplifies a result by Mangasarian on the existence of solutions to the...
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions
1992,
Recently, Frank and Tardos presented an algorithm, called the bi-truncation algorithm,...
Solution of large-scale symmetric travelling salesman problems
Solution of large-scale symmetric travelling salesman problems
1991,
In this paper the authors report on a cutting plane procedure with which they solve...
Fixed point theorems for discontinuous mapping
Fixed point theorems for discontinuous mapping
1991,
The authors prove a genrealization of Brouwer’s famous fixed point theorem to...
Contingent derivatives of set-valued maps and applications to vector optimization
Contingent derivatives of set-valued maps and applications to vector optimization
1991,
This paper investigates contingent derivatives of set-valued maps and their lower and...
Global optimization and simulated annealing
Global optimization and simulated annealing
1991,
In this paper the authors are concerned with global optimization, which can be defined...
On rates of convergence and asymptotic normality in the multiknapsack problem
On rates of convergence and asymptotic normality in the multiknapsack problem
1991,
In Meanti et al. an almost sure asymptotic characterization has been derived for the...
An infeasible (exterior point) simplex algorithm for assignment problems
An infeasible (exterior point) simplex algorithm for assignment problems
1991,
The so called Modified Hung-Rom Algorithm, based upon theoretical considerations of...
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
1992,
The authors investigate new bounding strategies based on different relaxations of the...
Euclidean semi-matchings of random samples
Euclidean semi-matchings of random samples
1992,
A linear programming relaxation of the minimal matching probelm is studied for graphs...
Penalization in non-classical convex programming via variational convergence
Penalization in non-classical convex programming via variational convergence
1991,
A penalty method for convex functions which cannot necessarily be extended outside...
A note on d-stability of convex programs and limiting Lagrangians
A note on d-stability of convex programs and limiting Lagrangians
1992,
This paper gives a criterion for d -stability of convex programs and a perturbation...
The relationship between integer and real solutions of constrained convex programming
The relationship between integer and real solutions of constrained convex programming
1991,
The authors prove a theorem which gives a bound on the proximity of the real and the...
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
1991,
The authors consider the continuous trajectories of the vector field induced by the...
Karmarkar’s linear programming algorithm and Newton’s method
Karmarkar’s linear programming algorithm and Newton’s method
1991,
This paper describes a full-dimensional version of Karmarkar’s linear...
Linear programming with spheres and hemispheres of objective vectors
Linear programming with spheres and hemispheres of objective vectors
1991,
Given a linear program with a bounded p- dimensional feasible region let the objective...
A primal projective interior point method for linear programming
A primal projective interior point method for linear programming
1991,
The authors present a new projective interior point for linear programming with...
Unified complexity analysis for Newton LP methods
Unified complexity analysis for Newton LP methods
1992,
The authors show that a theorem of Smale can be used to unify the polynomial-time...
Duality in infinite dimensional linear programming
Duality in infinite dimensional linear programming
1992,
The authors consider the class of linear programs with infinitely many variables and...
An potential reduction algorithm for linear programming
An potential reduction algorithm for linear programming
1991,
The paper describes a primal-dual potential function for linear programming: where , x...
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications
1992,
The first two parts of this paper have developed a simplex algorithm for minimizing...
On the solution of concave knapsack problems
On the solution of concave knapsack problems
1991,
The authors consider a version of the knapsack problem which gives rise to a separable...
Representation for multiple right-hand sides
Representation for multiple right-hand sides
1990,
Finitely many polyhedra defined by a linear constraints are given, using the same...
Value functions, domination cones and proper efficiency in multicriteria optimization
Value functions, domination cones and proper efficiency in multicriteria optimization
1990,
In the absence of a clear ‘objective’ value function, it is still possible...
Papers per page: