Title
Rand Math. Symposium 1959, notes & papersCatalog Number
102680001Type
DocumentDescription
This folder was in a box labeled, "Mathematical Programming Notes."includes documents:
An algorithm for integer solutions to linear programs
Synopsis of current and planned L.P. program systems for IBM 704-709-7090
Notes: "W. O. H."
Experience with the 704 program for the gradient projection method
An integer linear programming model for machine scheduling
An integer linear programming model for machine scheduling - an example
Convex minimization problems I, Revision I
Convex minimization problems II the transportation problem, Revision I
Convex minimization problems III linear programming, Revision I
Cowles Foundation discussion paper No. 62, Linear programming and sequential decision models
The bottleneck assignment problem - an algorithm
Existence conditions and algorithms for diode-source networks
Non-linear programming for separable objective functions and constraints
Generalized inverse in linear programming
Abstract structure of the Dantzig simplex method "Duality is Orthogonality"
Practical uses of very large linear programs in corporate operational planning
Control program simulation of I factory models
Decomposition principle -- an example
Long term programming of investments in the electric power industry
Techniques for block angular and non linear programming problems
Algorithms for Chebycheff approximations using the ratio of linear-forms
Appendix - computing directions for quadratic programming in the case of nonnegative constraints
Interval solutions of stochastic linear inequalities
Personnel assignment and mathematical programming
The significance of mathematical programming in the business world