Linear Nonlilear Programming

Peter Kall and János Mayer are distinguished scholars and professors of Operations Research and their research interest is particularly devoted to the area of stochastic optimization. Stochastic Linear Programming: Models, Theory, and Computation is a definitive presentation and discussion of the theoretical properties of the models, the conceptual algorithmic approaches, and the computational issues relating to the implementation of these methods to solve problems that are stochastic in nature. The application area of stochastic programming includes portfolio analysis, financial optimization, energy problems, random yields in manufacturing, risk analysis, etc. In this book, models in financial optimization and risk analysis are discussed as examples, including solution methods and their implementation.

This book summarizes years of research in the field of fuzzy relational programming, with a special emphasis on geometric models. It discusses the state-of-the-art in fuzzy relational geometric problems, together with key open issues that must be resolved to achieve a more efficient application of this method. Though chiefly based on research conducted by the authors, who were the first to introduce fuzzy geometric problems, it also covers important findings obtained in the field of linear and non-linear programming. Thanks to its balance of basic and advanced concepts, and its wealth of practical examples, the book offers a valuable guide for both newcomers and experienced researcher in the fields of soft computing and mathematical optimization.

With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.

Comprehensive linear algebra course that covers all the important topics from theory to applications

Learn Python, NumPy, Pandas, Matplotlib, PyTorch, and Linear Algebra—the foundations for building your own neural network.

Linear Regression analysis in Excel. Analytics in Excel includes regression analysis, Goal seek and What-if analysis

Learn the theory and math behind Linear and Logistic regression and also learn to code them from scratch

Build Strong Foundation of Optimization Techniques to Apply in Business