Mathematical programming : essays in honor of George B. Dantzig
著者
書誌事項
Mathematical programming : essays in honor of George B. Dantzig
（Mathematical programming study, 24,
North-Holland , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985
- pt. 1
- pt. 2
大学図書館所蔵 件 / 全22件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographies
内容説明・目次
内容説明
These two Studies comprise 28 papers dedicated to Professor George B. Dantzig on the occasion of his 70th birthday. They represent virtually every major topic in the field of mathematical programming: linear and nonlinear programming, discrete and continuous programming, conventional and large-scale programming, deterministic and stochastic programming, theory, applications, network optimization, and complementarity.
目次
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.
「Nielsen BookData」 より
