Linear Programming using MATLAB? (Springer Optimization and Its Applications) von Ploskas, Nikolaos; Samaras, Nikolaos: New (2017)

Beschreibung

PRINT ON DEMAND pp. 620.

Bestandsnummer des Verk�ufers 18375440354

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Linear Programming using MATLAB? (Springer Optimization and Its Applications)
Verlag: Springer
Ver�ffentlichungsdatum: 2017
Sprache: Englisch
ISBN-10: 3319659170
ISBN-13: 9783319659176
Bindung: Hardcover
Zustand: New

�ber diesen Titel

Inhaltsangabe

This book offers a theoretical and computational presentation of a variety of linear programming algorithms and methods with an emphasis on the revised simplex method and its components. A theoretical background and mathematical formulation is included for each algorithm as well as comprehensive numerical examples and corresponding MATLAB� code. The MATLAB� implementations presented in this book are sophisticated and allow users to find solutions to large-scale benchmark linear programs. Each algorithm is followed by a computational study on benchmark problems that analyze the computational behavior of the presented algorithms.

As a solid companion to existing algorithmic-specific literature, this book will be useful to researchers, scientists, mathematical programmers, and students with a basic knowledge of linear algebra and calculus. The clear presentation enables the reader to understand and utilize all components of simplex-type methods, such as presolve techniques, scaling techniques, pivoting rules, basis update methods, and sensitivity analysis.

Von der hinteren Coverseite

This book offers a theoretical and computational presentation of a variety of linear programming algorithms and methods with an emphasis on the revised simplex method and its components. A theoretical background and mathematical formulation is included for each algorithm as well as comprehensive numerical examples and corresponding MATLAB� code. The MATLAB� implementations presented in this book are sophisticated and allow users to find solutions to large-scale benchmark linear programs. Each algorithm is followed by a computational study on benchmark problems that analyze the computational behavior of the presented algorithms.

As a solid companion to existing algorithmic-specific literature, this book will be useful to researchers, scientists, mathematical programmers, and students with a basic knowledge of linear algebra and calculus. The clear presentation enables the reader to understand and utilize all components of simplex-type methods, such as presolve techniques, scaling techniques, pivoting rules, basis update methods, and sensitivity analysis.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.