Proceedings of the Princeton Symposium on Mathematical Programming

Proceedings of the Princeton Symposium on Mathematical Programming PDF

Author: Harold William Kuhn

Publisher: Princeton University Press

Published: 2015-03-08

Total Pages: 627

ISBN-13: 1400869935

DOWNLOAD EBOOK →

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. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover 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.

Integer Programming and Related Areas

Integer Programming and Related Areas PDF

Author: C. Kastning

Publisher: Springer Science & Business Media

Published: 2013-11-11

Total Pages: 504

ISBN-13: 3662022842

DOWNLOAD EBOOK →

Integer Prograw~ing is one of the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~konometrie und Operations Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by 11839 descriptor entries.

Linear Programming

Linear Programming PDF

Author: Saul I. Gass

Publisher: Courier Corporation

Published: 2003-01-01

Total Pages: 545

ISBN-13: 048643284X

DOWNLOAD EBOOK →

Comprehensive, well-organized volume, suitable for undergraduates, covers theoretical, computational, and applied areas in linear programming. Expanded, updated edition; useful both as a text and as a reference book. 1995 edition.

Mathematical Programming

Mathematical Programming PDF

Author: Melvyn Jeter

Publisher: Routledge

Published: 2018-05-03

Total Pages: 360

ISBN-13: 135143313X

DOWNLOAD EBOOK →

This book serves as an introductory text in mathematical programming and optimization for students having a mathematical background that includes one semester of linear algebra and a complete calculus sequence. It includes computational examples to aid students develop computational skills.

Integer and Combinatorial Optimization

Integer and Combinatorial Optimization PDF

Author: Laurence A. Wolsey

Publisher: John Wiley & Sons

Published: 2014-08-28

Total Pages: 782

ISBN-13: 1118626869

DOWNLOAD EBOOK →

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.

Mathematical Programming for Operations Researchers and Computer Scientists

Mathematical Programming for Operations Researchers and Computer Scientists PDF

Author: Albert G. Holzman

Publisher: CRC Press

Published: 2020-11-26

Total Pages: 393

ISBN-13: 100014612X

DOWNLOAD EBOOK →

This book covers the fundamentals of linear programming, extension of linear programming to discrete optimization methods, multi-objective functions, quadratic programming, geometric programming, and classical calculus methods for solving nonlinear programming problems.