Mathematical Programming for Operations Researchers and Computer Scientists


Book Description

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.




Mathematical Programming for Operations Researchers and Computer Scientists


Book Description

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.




Julia Programming for Operations Research


Book Description

Last Updated: December 2020 Based on Julia v1.3+ and JuMP v0.21+ The main motivation of writing this book was to help the author himself. He is a professor in the field of operations research, and his daily activities involve building models of mathematical optimization, developing algorithms for solving the problems, implementing those algorithms using computer programming languages, experimenting with data, etc. Three languages are involved: human language, mathematical language, and computer language. His team of students need to go over three different languages, which requires "translation" among the three languages. As this book was written to teach his research group how to translate, this book will also be useful for anyone who needs to learn how to translate in a similar situation. The Julia Language is as fast as C, as convenient as MATLAB, and as general as Python with a flexible algebraic modeling language for mathematical optimization problems. With the great support from Julia developers, especially the developers of the JuMP—Julia for Mathematical Programming—package, Julia makes a perfect tool for students and professionals in operations research and related areas such as industrial engineering, management science, transportation engineering, economics, and regional science. For more information, visit: http://www.chkwon.net/julia




Mathematical Programming


Book Description

This comprehensive work covers the whole field of mathematical programming, including linear programming, unconstrained and constrained nonlinear programming, nondifferentiable (or nonsmooth) optimization, integer programming, large scale systems optimization, dynamic programming, and optimization in infinite dimensions. Special emphasis is placed on unifying concepts such as point-to-set maps, saddle points and perturbations functions, duality theory and its extensions.







Decomposition Techniques in Mathematical Programming


Book Description

Optimization plainly dominates the design, planning, operation, and c- trol of engineering systems. This is a book on optimization that considers particular cases of optimization problems, those with a decomposable str- ture that can be advantageously exploited. Those decomposable optimization problems are ubiquitous in engineering and science applications. The book considers problems with both complicating constraints and complicating va- ables, and analyzes linear and nonlinear problems, with and without in- ger variables. The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others. Heuristic techniques are also considered. Additionally, a comprehensive sensitivity analysis for characterizing the solution of optimization problems is carried out. This material is particularly novel and of high practical interest. This book is built based on many clarifying, illustrative, and compu- tional examples, which facilitate the learning procedure. For the sake of cl- ity, theoretical concepts and computational algorithms are assembled based on these examples. The results are simplicity, clarity, and easy-learning. We feel that this book is needed by the engineering community that has to tackle complex optimization problems, particularly by practitioners and researchersinEngineering,OperationsResearch,andAppliedEconomics.The descriptions of most decomposition techniques are available only in complex and specialized mathematical journals, di?cult to understand by engineers. A book describing a wide range of decomposition techniques, emphasizing problem-solving, and appropriately blending theory and application, was not previously available.




Introduction to Probability Models


Book Description

Vol. 2: CD-ROM contains student editions of: ProcessModel, LINGO, Premium Solver, DecisionTools Suite including @RISK AND RISKOptimizer, Data files.




Nonlinear Integer Programming


Book Description

A combination of both Integer Programming and Nonlinear Optimization, this is a powerful book that surveys the field and provides a state-of-the-art treatment of Nonlinear Integer Programming. It is the first book available on the subject. The book aims to bring the theoretical foundation and solution methods for nonlinear integer programming to students and researchers in optimization, operations research, and computer science.




Linear Programming: Foundations and Extensions


Book Description

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.




Mathematical Programming


Book Description

This classic by a well-known expert explores both theory and applications. It focuses on linear programming, in addition to other programming topics, and features numerous worked-out examples and problems. 1961 edition.




Recent Books