Skip to main content
SpringerLink
Log in

DECOMP: an Implementation of Dantzig-Wolfe Decomposition for Linear Programming

  • Book
  • © 1989

Overview

Authors:
  1. James K. Ho

    1. College of Business Administration, Management Science Program, The University of Tennessee, Knoxville, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Rangaraja P. Sundarraj

    1. Graduate School of Management, Clark University, Worcester, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 338)

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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 (5 chapters)

  1. Front Matter

    Pages I-VI
    Download chapter PDF

  2. Introduction

    • James K. Ho, Rangaraja P. Sundarraj
    Pages 1-4

  3. Specifications for a Robust Code

    • James K. Ho, Rangaraja P. Sundarraj
    Pages 5-32

  4. Program Subroutines

    • James K. Ho, Rangaraja P. Sundarraj
    Pages 33-167

  5. Portability Issues

    • James K. Ho, Rangaraja P. Sundarraj
    Pages 168-171

  6. User’s Guide

    • James K. Ho, Rangaraja P. Sundarraj
    Pages 172-202

  7. Back Matter

    Pages 203-206
    Download chapter PDF
Back to top

Keywords

About this book

For linear optimization models that can be formulated as linear programs with the block-angular structure, i.e. independent subproblems with coupling constraints, the Dantzig-Wolfe decomposition principle provides an elegant framework of solution algorithms as well as economic interpretation. This monograph is the complete documentation of DECOMP: a robust implementation of the Dantzig-Wolfe decomposition method in FORTRAN. The code can serve as a very convenient starting point for further investigation, both computational and economic, of parallelism in large-scale systems. It can also be used as supplemental material in a second course in linear programming, computational mathematical programming, or large-scale systems.

Authors and Affiliations

  • College of Business Administration, Management Science Program, The University of Tennessee, Knoxville, USA

    James K. Ho

  • Graduate School of Management, Clark University, Worcester, USA

    Rangaraja P. Sundarraj

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation