𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Matrices and Simplex Algorithms: A Textbook in Mathematical Programming and Its Associated Mathematical Topics

✍ Scribed by A. R. G. Heesterman (auth.)


Publisher
Springer Netherlands
Year
1982
Tongue
English
Leaves
799
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This is a textbook devoted to mathematical programming algorithms and the mathematics needed to understand such algorithms. It was mainly written for economists, but the mathematics itself obviously has relevance for other disciplines. It is a textbook as well a~ in parts, a contribution to new knowledge. There is, accordingly, a broad ordering of climbing sophistication, the earlier chapters being purely for the student, the later chapters being more specialist and containing some element of novelty on certain points. The book is edited in five parts. Part I deals with elementary matrix operations, matrix inversion, determinants, etc. Part II is mainly devoted to linear programming. As far as students' readability is concerned, these two parts are elementary undergraduate material. However, I would claim, in particular with respect to linear programming, that I do things more efficiently than the standard textbook approach has it. This refers mainly to the search for a feasible solution i.e. Chapter 9, and to upper and lower limits, i.e. Chapter 10. I have also argued that the standard textbook treatment of degeneracy misses a relevant problem, namely that of accuracy. In short, I would invite anyone who has the task of writing or designing an LP-code, to first acquaint himself with my ideas. viii INTRODUCTION Parts III and IV are concerned with nonlinear programming.

✦ Table of Contents


Front Matter....Pages i-x
Front Matter....Pages 1-2
Equations-Systems and Tableaux....Pages 3-4
Matrix Notation....Pages 5-32
Block-Equations and Matrix-Inversion....Pages 33-61
Some Operators and their Use....Pages 62-67
Determinants and Rank....Pages 68-111
Front Matter....Pages 112-114
Vectors and Coordinate-Spaces....Pages 115-143
Some Basic Linear Programming Concepts....Pages 144-148
Outline of the Simplex Algorithm....Pages 149-180
The Search for a Feasible Solution....Pages 181-204
Mixed Systems, Upper and Lower Bounds....Pages 205-222
Duality....Pages 223-241
Linear Programming on the Computer....Pages 242-272
Parametric Variat t of the Lp Problem....Pages 273-317
Front Matter....Pages 318-318
Topology of Feasible Space Areas and its Relation to Definiteness....Pages 319-362
Optimality Conditions....Pages 363-399
Front Matter....Pages 400-401
Quadratic Programming with Linear Restrictions....Pages 402-515
Parametric Methods In Quadratic Programming....Pages 516-555
General Quadratic Programming....Pages 556-635
Front Matter....Pages 636-636
Integer Programming and Some of its Applications....Pages 637-655
Branching Methods....Pages 656-701
Front Matter....Pages 636-636
The Use of Cuts....Pages 702-772
Back Matter....Pages 773-790

✦ Subjects


Mathematics of Computing; Data Structures; Economics general


πŸ“œ SIMILAR VOLUMES


Basics of Programming and Algorithms, Pr
✍ Roberto Mantaci, Jean-Baptiste YunΓ¨s πŸ“‚ Library πŸ“… 2024 πŸ› BirkhΓ€user 🌐 English

<p><span>This textbook offers an introduction to topics in algorithms and programming with python. It is originally intended for mathematical students not sufficiently aware about these computer science fields seeking a deeper understanding. It addresses fundamental questions on how to analyze the p

Cones, Matrices and Mathematical Program
✍ Dr. Abraham Berman (auth.) πŸ“‚ Library πŸ“… 1973 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>This monograph is a revised set of notes on recent applications of the theory of cones, arising from lectures I gave during my stay at the Centre de recherches mathematiques in Montreal. It consists of three chapters. The first describes the basic theory. The second is devoted to applications to

Cones, Matrices and Mathematical Program
✍ Abraham Berman πŸ“‚ Library πŸ“… 1973 πŸ› Springer 🌐 English

This monograph is a revised set of notes on recent applications of the theory of cones, arising from lectures I gave during my stay at the Centre de recherches mathematiques in Montreal. It consists of three chapters. The first describes the basic theory. The second is devoted to applications to mat

Algorithms and Model Formulations in Mat
✍ Ellis L. Johnson (auth.), Stein W. Wallace (eds.) πŸ“‚ Library πŸ“… 1989 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>The NATO Advanced Research Workshop (ARW) "Algorithms and Model Formulations in Mathematical Programming" was held at Chr. Michelsen Institute in Bergen, Norway, from June 15 to June 19, 1987. The ARW was organized on behalf of the Committee on Algorithms (COAL) of the Mathematical Programming So

Graph Theory and Its Applications (Textb
✍ Jonathan L. Gross, Jay Yellen, Mark Anderson πŸ“‚ Library πŸ“… 2018 πŸ› Chapman and Hall/CRC 🌐 English

<p><strong><em>Graph Theory and Its Applications, Third Edition</em></strong>Β is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible