Series parallel composition of greedy linear programming problems Wolfgang W. BeinPeter BruckerAlan J. Hoffman OriginalPaper Pages: 1 - 14
Solving symmetric indefinite systems in an interior-point method for linear programming Robert FourerSanjay Mehrotra OriginalPaper Pages: 15 - 39
Load balancing in the parallel optimization of block-angular linear programs S. Kingsley GnanendranJames K. Ho OriginalPaper Pages: 41 - 67
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality Dorit S. HochbaumNimrod MegiddoArie Tamir OriginalPaper Pages: 69 - 83
On the bigℳ in the affine scaling algorithm Tohru IshiharaMasakazu Kojima OriginalPaper Pages: 85 - 93
Multicommodity network flows: The impact of formulation on decomposition Kim L. JonesIrvin J. LustigWarren B. Powell OriginalPaper Pages: 95 - 117
A primal—dual affine-scaling potential-reduction algorithm for linear programming Shinji MizunoAtsushi Nagasawa OriginalPaper Pages: 119 - 131
On the number of iterations of Karmarkar's algorithm for linear programming M. J. D. Powell OriginalPaper Pages: 153 - 197
Staircase transportation problems with superadditive rewards and cumulative capacities Alan J. HoffmanArthur F. Veinott Jr. OriginalPaper Pages: 199 - 213
The facets of the polyhedral set determined by the Gale—Hoffman inequalities Stein W. WallaceRoger J. -B. Wets OriginalPaper Pages: 215 - 222
A generalized Dantzig—Wolfe decomposition principle for a class of nonconvex programming problems Phan Thien ThachHiroshi Konno OriginalPaper Pages: 239 - 260
Convergence of some algorithms for convex minimization Rafael CorreaClaude Lemaréchal OriginalPaper Pages: 261 - 275
Nonlinear complementarity as unconstrained and constrained minimization O. L. MangasarianM. V. Solodov OriginalPaper Pages: 277 - 297
A rapidly convergent five-point algorithm for univariate minimization Robert MifflinJ. -J. Strodiot OriginalPaper Pages: 299 - 319
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices M. L. OvertonR. S. Womersley OriginalPaper Pages: 321 - 357
A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets Jong-Shi Pang OriginalPaper Pages: 359 - 383
On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems E. Polak OriginalPaper Pages: 385 - 414
Nonsingularity and symmetry for linear normal maps Stephen M. Robinson OriginalPaper Pages: 415 - 425
Local convergence analysis of tensor methods for nonlinear equations Dan FengPaul D. FrankRobert B. Schnabel OriginalPaper Pages: 427 - 459
An approximation algorithm for the generalized assignment problem David B. ShmoysÉva Tardos OriginalPaper Pages: 461 - 474
The least element property of center location on tree networks with applications to distance and precedence constrained problems Arie Tamir OriginalPaper Pages: 475 - 496
Finding an interior point in the optimal face of linear programs Sanjay MehrotraYinyu Ye OriginalPaper Pages: 497 - 515
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming Kurt M. Anstreicher OriginalPaper Pages: 517 - 535
On quadratic and\(O\left( {\sqrt {nL} } \right)\) convergence of a predictor—corrector algorithm for LCP Yinyu YeKurt Anstreicher OriginalPaper Pages: 537 - 551
Using copositivity for global optimality criteria in concave quadratic programming problems Gabriele DanningerImmanuel M. Bomze OriginalPaper Pages: 575 - 580
