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

Selecciona una librería:

  • Librería Perelló (Valencia)
  • Librería Aciertas (Toledo)
  • El AlmaZen del Alquimista (Sevilla)
  • Librería Elías (Asturias)
  • Librería Kolima (Madrid)
  • Donde los libros
  • Librería Proteo (Málaga)
Sobre IBD

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

  • Nonlinear Optimization
    William P. Fox
    The study of nonlinear optimization is both fundamental and a key course for applied mathematics, operations research, management science, industrial engineering, and economics at most colleges and universities. ...
    Disponible

    99,51 €

  • Optimization Modelling Using R
    Timothy R. Anderson
    This book covers using R for doing optimization, a key area of operations research, which has been applied to virtually every industry. The focus is on linear and mixed integer optimization. It uses an algebraic modeling approach for creating formulations that pairs naturally with an algebraic implementation in R. ...
    Disponible

    100,06 €

  • 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 €

  • 4th Party Cyber Logistics for Air Cargo
    Lawrence C. Leung / Sung-Chi Chu / Yer Van Hui
    4th Party Cyber Logistics For Air Cargo is a technical discussion for researchers and practitioners to understand the issues, models, and future directions of air cargo logistics in the cyber era. This book introduces the many aspects of planning and control of air cargo logistics processes in an e-Business environment. The authors approach this subje...
    Disponible

    133,09 €