861 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

This self-contained book provides a systematic account of the main algorithms derived from the simplex method and the means by which they may be organized into effective procedures for solving practical linear programming problems on a computer. The book begins by characterizing the problem and the method used to solve it, and goes on to deal with the practicalities of the subject, emphasizing concerns of implementation. The final section of the book discusses the basic principles of optimization: duality, decomposition, and homotopy. In conjunction with the simplex method, they each lead to other key algorithms of linear programming. The author's approach is distinguished by his detailed exploration of ideas and issues that centre on the need to structure data suitably, and to organize calculations in an efficient and numerically stable manner. Unlike many linear programming texts, the author's overall perspective is grounded in nonlinear programming rather than combinatorics.

Produktinformation

Utforska kategorier

Recensioner i media

Innehållsförteckning

Hoppa över listan

Mer från samma serie

Hoppa över listan

Du kanske också är intresserad av

Kopfschmerzen

Hans Tilscher, Peter Wessely, Manfred Eder, Paul Porges, Fritz L. Jenkner

Häftad

821 kr

Michael Atiyah Collected Works

Michael Atiyah, University of Oxford) Atiyah, Michael (Royal Society Research Professor, Mathematical Institute, Royal Society Research Professor, Mathematical Institute

Inbunden

4 576 kr

Arms Transfer Limitations and Third World Security

Thomas Ohlson, Mozambique) Ohlson, Thomas (former Researcher and Project Leader for Arms Trade Project at SIPRI; now Researcher, former Researcher and Project Leader for Arms Trade Project at SIPRI; now Researcher, Centre for African Studies, Maputo

Inbunden

1 464 kr