Author bio Daniel Solow - book author

Daniel Solow is the author of books: How to read and do proofs, The Keys to Advanced Mathematics: Recurrent Themes in Abstract Reasoning, Linear Programming: An Introduction to Finite Improvement Algorithms: Second Edition, Proof techniques for advanced mathematics, Linear Programming: An Introduction to Finite Improvement Algorithms, Thinking In Pascal: A Systematic Approach, I/M Reasong Comptr Pasca, Reasoning with a Computer in Pascal, Reading Writing and Doing Mathematical Proofs: Proof Techniques for Geometry, Book One, Fundamental Ideas Of Analysis And How To Read And Do Proofs: An Introduction To Mathematical Thought Processes, Second Edition Set Author books

#
Title
Description
01
An easy-to-use guide that shows how to read, understand, and do proofs.
Shows how any proof can be understood as a sequence of techniques. Covers the full range of techniques used in proofs, such as the contrapositive, induction, and proof by contradiction. Explains how to identify which techniques are used and how they are applied in the specific problem. Illustrates how to read written proofs with many step-by-step examples. Includes new, expanded appendices related to discrete mathematics, linear algebra, modern algebra and real analysis.
03
Suitable for undergraduate students of mathematics and graduate students of operations research and engineering, this text covers the basic theory and computation for a first course in linear programming. In addition to substantial material on mathematical proof techniques and sophisticated computation methods, the treatment features numerous examples and exercises.
An introductory chapter offers a systematic and organized approach to problem formulation. Subsequent chapters explore geometric motivation, proof techniques, linear algebra and algebraic steps related to the simplex algorithm, standard phase 1 problems, and computational implementation of the simplex algorithm. Additional topics include duality theory, issues of sensitivity and parametric analysis, techniques for handling bound constraints, and network flow problems. Helpful appendixes conclude the text, including a new addition that explains how to use Excel to solve linear programming problems.