DECOMP

DECOMP

James K. Ho / Rangaraja P. Sundarraj

67,79 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
1989
ISBN:
9780387971544
67,79 €
IVA incluido
Disponible
Añadir a favoritos

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.

Artículos relacionados

  • Mathematical Introduction to Linear Programming and Game Theory
    Louis Brickman
    Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes alm...
    Disponible

    65,62 €

  • Degeneracy Graphs and the Neighbourhood Problem
    H. -J Kruse
    A few years ago nobody would have anticipated that in connection with degeneracy in Linear Programming quite a new field. could originate. In 1976 a very simple question has been posed: in the case an extreme­ pOint (EP) of a polytope is degenerate and the task is to find all neighbouring EP’s of the degenerate EP, is it necessary to determine all bas...
    Disponible

    66,99 €

  • Approaches to the Theory of Optimization
    J. P. Ponstein / JPPonstein
    ...
    Disponible

    58,16 €

  • The Discrete Ordered Median Problem
    Patricia Dominguez-Marin
    This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems. Several exact and heuristic approaches are developed in this book in order to solve the DOMP. Audience: The book is suitable for researchers in location theory, and graduate students in combinatorial optimization. ...
    Disponible

    65,18 €

  • Facility Location
    Zvi Drezner
    Facility location applications are concerned with the location of one or more facilities in a way that optimizes a certain objective such as mini­ mizing transportation cost, providing equitable service to customers, cap­ turing the largest market share, etc. Facility location problems give rise to challenging geometrical and combinatorial problems. T...
    Disponible

    64,85 €

  • Facility Location
    The book covers both theory and applications of locational analysis (LocAn). The reader will see the power of LocAn models in various real-world contexts, varying from communication design to robotics and mail delivery. It is divided into two parts. The first part contains an overview of some of the LocAn methodologies. The second part describes in th...