Skip to main content
Book cover

Linear Programming Using MATLAB®

  • Book
  • © 2017

Overview

  • Methodically presents all components of the simplex-type methods?
  • Enables readers to experiment with MATLAB® codes that are able to solve large-scale benchmark linear programs?
  • Contains 11 presolve techniques, 11 scaling techniques, 6 pivoting rules, and 4 basis inverse and update methods
  • Includes supplementary material: sn.pub/extras

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 127)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

Keywords

About this book

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.

Authors and Affiliations

  • Department of Applied Informatics, University of Macedonia, Thessaloniki, Greece

    Nikolaos Ploskas, Nikolaos Samaras

Bibliographic Information

Publish with us