default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 41
Volume 41, Numbers 1-3, May 1988
- Richard H. F. Jackson, Garth P. McCormick:
Second-order sensitivity analysis in factorable programming: Theory and applications. 1-27 - Patrick T. Harker:
Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. 29-59 - David F. Shanno:
Computing Karmarkar projections quickly. 61-71 - Hidefumi Kawasaki:
An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems. 73-96 - Michael J. Todd:
Exploiting special structure in Karmarkar's linear programming algorithm. 97-113 - Bernard Cornet, Van Hien Nguyen, Jean-Pierre Vial:
Mathematical programming study 30 - Nonlinear Analysis and Optimization. 119-121 - Jean-Baptiste Hiriart-Urruty, Hoang Tuy:
Note From the Editor. 125-126 - Dominique Azé:
An example of stability for the minima of a sequence of dc functions: Homogenization for a class of nonlinear Sturm-Liouville problems. 127-140 - Mireille L. Bougeard:
Morse theory for some lower-C2 functions in finite dimension. 141-159 - Hoang Tuy, Reiner Horst:
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems. 161-183 - Hiroshi Konno:
Minimum concave cost production system: A further generalization of multi-echelon model. 185-193 - Jean-Paul Penot, Mireille L. Bougeard:
Approximation and decomposition properties of some classes of locally D.C. functions. 195-227 - Phan Thien Thach:
The design centering problem as a D.C. programming problem. 229-248 - Tran Vu Thieu:
A note on the solution of bilinear programming problems by reduction to concave minimization. 249-260 - Michel Volle:
Concave duality: Application to problems dealing with difference of functions. 261-278 - Robert Fourer:
A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy. 281-315 - Thomas L. Magnanti, James B. Orlin
:
Parametric linear programming and anti-cycling pivoting rules. 317-325 - Hidefumi Kawasaki:
The upper and lower second order directional derivatives of a sup-type function. 327-339 - Ramon E. Moore, Helmut Ratschek:
Inclusion functions and global optimization II. 341-356 - Philip C. Jones, James L. Zydiak, Wallace J. Hopp:
Stationary dual prices and depreciation. 357-366 - Kurt M. Anstreicher:
Linear programming and the newton barrier flow. 367-373 - Jean-Marie Bourjolly:
An extension of the könig-egerváry property to node-weighted bidirected graphs. 375-384 - David M. Ryan, Michael R. Osborne:
On the solution of highly degenerate linear programmes. 385-392 - I. I. Dikin:
Letter to the editor. 393-394 - Karla L. Hoffman, Richard H. F. Jackson, Jan Telgen:
Mathematical programming study 31 - Computational Mathematical Programming. 395-398
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-04 22:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
