skip to content
Mathematical programming : essays in honor of George B. Dantzig Pt. 2 Preview this item
ClosePreview this item

Mathematical programming : essays in honor of George B. Dantzig Pt. 2

Author: Y P Aneja; Evelyn M Beale; Richard W Cottle; George B Dantzig
Publisher: Amsterdam [u.a.] North-Holland 1985
Series: Mathematical programming study, 25
Edition/Format:   Print book : EnglishView all editions and formats

(not yet rated) 0 with reviews - Be the first.


Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Document Type: Book
All Authors / Contributors: Y P Aneja; Evelyn M Beale; Richard W Cottle; George B Dantzig
ISBN: 0444878548 9780444878540
OCLC Number: 830891185
Description: XIII, 171 S
Contents: Part I (MPS 24): Selected Publications of George B. Dantzig. R.M. Freund: Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients. R.J.-B. Wets: On the continuity of the value of a linear program and of related polyhedral-valued multifunctions. K.G. Murty: Faces of a polyhedron. J.R. Birge: A Dantzig-Wolfe decomposition variant equivalent to basis factorization. R.J. Wittrock: Dual nested decomposition of staircase linear programs. T.C. Hu and M.T. Shing: A decomposition algorithm for circuit routing. S.I. Gass and S.P. Shao: On the solution of special generalized upper bounded problems: The LP/GUB knapsack problem and the l-form separable convex objective function problem. J.L. Nazareth: An efficient algorithm for minimizing a multivariate polyhedral function along a line. J.K. Ho: Relationships among linear formulations of separable convex piecewise linear programs. F. Glover and D. Klingman: Basis exchange characterization for the simplex SON algorithm for LP/embedded networks. B. Korte and L. Lovasz: Basis graphs of greedoids and two-connectivity. J.B. Orlin: On the simplex algorithm for networks and generalized networks. E. Balas: On the facial structure of scheduling polyhedra. P.J. Carstensen, K.G. Murty and C. Perin: Intermediate feasibility in 0-1 integer linear system. Y.P. Aneja, R. Chandrasekaran and K.P. Nair: Classes of linear programs with integral optimal solutions. R.E. Burkard, H.W. Hamacher and J. Tind: On general decomposition schemes in mathematical programming. Part II (MPS 25): O.L. Mangasarian: Simple computable bounds for solutions of linear complementarity problems and linear programs. J.-S. Pang and R. Chandrasekaran: Linear complementarity problems solvable by a polynomially bounded pivoting algorithm. E.M.L. Beale and O.S. Brooker: The use of hypothetical points in numerical optimization. M.J.D. Powell: On the quadratic programming algorithm of Goldfarb and Idnani. R. Rouhani, L. Lasdon, W. Lebow and A.D. Waren: A generalized Benders decomposition approach to reactive source planning in power systems. A.J. Hoffman and P. Wolfe: Minimizing a unimodal function of two integer variables. A.F. Veinott, Jr.: Existence and characterization of minima of concave functions on unbounded convex sets. S.T. Dzuibanm, J.G. Ecker and M. Kupferschmid: Using deep cuts in an ellipsoid algorithm for nonlinear programming. S. Erlander: On the principle of monotone likelihood and log-linear models. B.C. Eaves, A.J. Hoffman, U.G. Rothblum and H. Schneider: Line-sum-symmetric scalings of square nonnegative matrices. L. Qi: Forest iteration method for stochastic transportation problem. R.D. Wollmer: Critical path planning under uncertainty.
Series Title: Mathematical programming study, 25
Responsibility: ed. by R. W. Cottle ...


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data

schema:name"Mathematical programming : essays in honor of George B. Dantzig Pt. 2"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.