lorem ipsum dolor sit amet ...
Tidsskrift
5
The simple method
An introductory example
Exception handling : unboundedness
Exception handling : degeneracy
Exception handling : infeasibility
Simplex tableaus in general
The simplex method in general
Pivot rules
The struggle against cycling
Efficiency of the simplex method
Summary
Duality of linear programming
The duality theorem
Dualization for everyone
Proof of duality from the simplex method
Proof of duality from the Farkas lemma
Farkas lemma : an analytic proof
Farkas lemma from minimally infeasible systems
Farkas lemma from the Fourier-Motzkin elimination
Not only the simplex method
The ellipsoid method
Interior point methods
More applications
Zero-sum games
matchings and vertex covers in bipartite graphs
Machine scheduling
Upper bounds for codes
Sparse solutions of linear systems
Transversals of d-intervals
Smallest balls and convex programming
Software and further reading
Appendix : Linear algebra
Glossary
Index
