![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Mathematical Programming, Volume 38
Volume 38, Number 1, July 1987
- Gerard van der Laan, A. J. J. Talman:
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds. 1-15 - Michele Conforti, M. R. Rao:
Structural properties and recognition of restricted and strongly unimodular matrices. 17-27 - M. J. D. Powell:
Updating conjugate directions by the BFGS formula. 29-46 - Robert M. Freund:
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. 47-67 - Albertus M. H. Gerards, András Sebö:
Total dual integrality implies local strong unimodularity. 69-73 - Paul H. Calamai, Andrew R. Conn:
A projected newton method for l p norm location problems. 75-109
Volume 38, Number 2, June 1987
- Stein W. Wallace:
A piecewise linear upper bound on the network recourse function. 133-146 - André Bouchet:
Greedy algorithm and symmetric matroids. 147-159 - Mark Broadie, B. Curtis Eaves:
A variable rate refining triangulation. 161-202 - Jerzy Kyparisis:
Sensitivity analysis framework for variational inequalities. 203-213 - Soon-Kiong Sim:
Clarification of certain (α, β)-polarity results of Bachem and Grötschel. 215-218 - Zvi Drezner:
On the complexity of the exchange algorithm for minimax optimization problems. 219-222
Volume 38, Number 3, October 1987
- Sunil Chopra
, Ellis L. Johnson:
Dual row modules and polyhedra of blocking group problems. 229-270 - Bruno Betrò, Fabio Schoen:
Sequential stopping rules for the multistart algorithm in global optimisation. 271-286 - James V. Burke:
Second order necessary and sufficient conditions for convex composite NDO. 287-302 - Paul Tseng, Dimitri P. Bertsekas:
Relaxation methods for problems with strictly convex separable costs and linear constraints. 303-321 - Peter Zencke, Rainer Hettich:
Directional derivatives for the value-function in semi-infinite programming. 323-340
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.