Proceedings of the Princeton Symposium on Mathematical Programming
This volume contains thirty-three selected general research papers devoted to the theory and application of the mathematics of constrained optimization, including linear programming and its extensions to convex programming, general nonlinear programming, integer programming, and programming under uncertainty.
Originally published in 1971.
ThePrinceton Legacy Libraryuses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
You do not have access to this book on JSTOR. Try logging in through your institution for access.
Log in to your personal account or through your institution.
Table of Contents
Export Selected Citations
Export to NoodleTools
Export to RefWorks
Export to EasyBib
Export a RIS file
(For EndNote, ProCite, Reference Manager, Zotero, Mendeley...)
Export a Text file