Linear Programming and Extensions

Linear Programming and Extensions

George Dantzig

169,88 €
IVA incluido
Disponible
Editorial:
Princeton University Press
Año de edición:
1998
ISBN:
9780691059136
169,88 €
IVA incluido
Disponible
Añadir a favoritos

In real-world problems related to finance, business, and management, mathematicians and economists frequently encounter optimization problems. In this classic book, George Dantzig looks at a wealth of examples and develops linear programming methods for their solutions. He begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them. Treatments of the price concept, the transportation problem, and matrix methods are also given, and key mathematical concepts such as the properties of convex sets and linear vector spaces are covered. George Dantzig is properly acclaimed as the 'father of linear programming.' Linear programming is a mathematical technique used to optimize a situation. It can be used to minimize traffic congestion or to maximize the scheduling of airline flights. He formulated its basic theoretical model and discovered its underlying computational algorithm, the 'simplex method,' in a pathbreaking memorandum published by the United States Air Force in early 1948. Linear Programming and Extensions provides an extraordinary account of the subsequent development of his subject, including research in mathematical theory, computation, economic analysis, and applications to industrial problems. Dantzig first achieved success as a statistics graduate student at the University of California, Berkeley. One day he arrived for a class after it had begun, and assumed the two problems on the board were assigned for homework. When he handed in the solutions, he apologized to his professor, Jerzy Neyman, for their being late but explained that he had found the problems harder than usual. About six weeks later, Neyman excitedly told Dantzig, 'I’ve just written an introduction to one of your papers. Read it so I can send it out right away for publication.' Dantzig had no idea what he was talking about. He later learned that the 'homework' problems had in fact been two famous unsolved problems in statistics.

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 €

  • DECOMP
    James K. Ho / Rangaraja P. Sundarraj
    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 r...
  • 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. ...
  • 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...