Mathematical programming : essays in honor of George B. Dantzig, part II
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Mathematical programming studies
25 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Mélanges :, Dantzig |
| Edition sous un autre format: | • Mathematiacl Programming Essays in Honor of George B. Dantzig Part II, Texte imprimé, 9783642009204 • Mathematiacl Programming Essays in Honor of George B. Dantzig Part II, Texte imprimé, 9783662310885 • Mathematiacl Programming Essays in Honor of George B. Dantzig Part II, Texte imprimé, 9783662310892 |
Sisällysluettelo:
- Simple computable bounds for solutions of linear complementarity problems and linear programs
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- The use of hypothetical points in numerical optimization
- On the quadratic programming algorithm of Goldfarb and Idnani
- A generalized Benders decomposition approach to reactive source planning in power systems
- Minimizing a unimodal function of two integer variables
- Existence and characterization of minima of concave functions on unbounded convex sets
- Using deep cuts in an ellipsoid algorithm for nonlinear programming
- On the principle of monotone likelihood and log-linear models
- Line-sum-symmetric scalings of square nonnegative matrices
- Forest iteration method for stochastic transportation problem
- Critical path planning under uncertainty.