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 basic solutions of the corresponding equalities system associated with the degenerate EP -in order to be certain to determine all neighbours of this EP? This question implied another one: Does there exists a subset of the mentioned set of basic solutions such that it suffices to find such a subset in order to determine all neighbours? The first step to solve these questions (which are motivated in the first Chapter of this book) was to define a graph (called degeneracy graph) the nodes of which correspond to the basic solutions. It turned out that such a graph has some special properties and in order to solve the above questions firstly these properties had to be investigated. Also the structure of degeneracy graphs playes hereby an important role. Because the theory of degeneracy graphs was quite new, it was necessary to elaborate first a completely new terminology and to define new notions. Dr.
"synopsis" may belong to another edition of this title.
US$ 18.79 shipping from Germany to U.S.A.
Destination, rates & speedsSeller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020160882
Quantity: Over 20 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540160496
Quantity: Over 20 available
Seller: Antiquariat Bookfarm, Löbnitz, Germany
138 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7992 3540160493 Sprache: Englisch Gewicht in Gramm: 900. Seller Inventory # 2347690
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540160496_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540160496
Quantity: 10 available
Seller: moluna, Greven, Germany
Condition: New. Seller Inventory # 4882897
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 1986 edition. 144 pages. 9.25x6.10x0.31 inches. In Stock. Seller Inventory # x-3540160493
Quantity: 2 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 basic solutions of the corresponding equalities system associated with the degenerate EP -in order to be certain to determine all neighbours of this EP This question implied another one: Does there exists a subset of the mentioned set of basic solutions such that it suffices to find such a subset in order to determine all neighbours The first step to solve these questions (which are motivated in the first Chapter of this book) was to define a graph (called degeneracy graph) the nodes of which correspond to the basic solutions. It turned out that such a graph has some special properties and in order to solve the above questions firstly these properties had to be investigated. Also the structure of degeneracy graphs playes hereby an important role. Because the theory of degeneracy graphs was quite new, it was necessary to elaborate first a completely new terminology and to define new notions. Dr. 144 pp. Englisch. Seller Inventory # 9783540160496
Quantity: 2 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 basic solutions of the corresponding equalities system associated with the degenerate EP -in order to be certain to determine all neighbours of this EP This question implied another one: Does there exists a subset of the mentioned set of basic solutions such that it suffices to find such a subset in order to determine all neighbours The first step to solve these questions (which are motivated in the first Chapter of this book) was to define a graph (called degeneracy graph) the nodes of which correspond to the basic solutions. It turned out that such a graph has some special properties and in order to solve the above questions firstly these properties had to be investigated. Also the structure of degeneracy graphs playes hereby an important role. Because the theory of degeneracy graphs was quite new, it was necessary to elaborate first a completely new terminology and to define new notions. Dr.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 144 pp. Englisch. Seller Inventory # 9783540160496
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 basic solutions of the corresponding equalities system associated with the degenerate EP -in order to be certain to determine all neighbours of this EP This question implied another one: Does there exists a subset of the mentioned set of basic solutions such that it suffices to find such a subset in order to determine all neighbours The first step to solve these questions (which are motivated in the first Chapter of this book) was to define a graph (called degeneracy graph) the nodes of which correspond to the basic solutions. It turned out that such a graph has some special properties and in order to solve the above questions firstly these properties had to be investigated. Also the structure of degeneracy graphs playes hereby an important role. Because the theory of degeneracy graphs was quite new, it was necessary to elaborate first a completely new terminology and to define new notions. Dr. Seller Inventory # 9783540160496
Quantity: 1 available