Skip to content
Home/ Degeneracy Graphs and the Neighbourhood Problem (1986)
Degeneracy Graphs and the Neighbourhood Problem (1986)
Save Ask us

Degeneracy Graphs and the Neighbourhood Problem (1986)

No customer reviews yet ISBN 9783540160496
Published
Jan 1986
Language
English
$57.47
In stock
Most orders arrive within 3 weeks. Shipping policy
Qty
Sign in to Add to Saved list
Free delivery over $35 · 15-day returns

Condition

Brand New

An unread, unused copy: no writing or highlighting, and no missing or damaged pages. Every book we sell is brand new, including our lowest-priced titles.

About this book

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.

Specifications

PublishedJan 1, 1986
ISBN-103540160493
ISBN-139783540160496
LanguageEnglish

Buying from Saanjhi

  • Ships from the USA. Delivery to US addresses only.
  • Free delivery on orders over $35.
  • 15-day returns. Unless we send the wrong book or it arrives damaged, you pay return shipping and a 15% restocking fee.
  • Secure checkout. We never store card details.

Readers who bought this also bought

More from Linear & Nonlinear Programming
See all
Multicriteria Optimization in Engineering and in the Sciences (1988)
We are rarely asked to. make decisions based on only one criterion; most often, decisions are based on several usually confticting, criteria. In nature, if the design of a system evolves to some final, optimal state, then it must include a balance for the interaction of the system with its surroundings- certainly a design based on a variety of criteria. Furthermore, the diversity of nature's designs suggests an infinity of such optimal states. In another sense, decisions simultaneously optimize a finite number of criteria, while there is usually an infinity of optimal solutions. Multicriteria optimization provides the mathematical framework to accommodate these demands. Multicriteria optimization has its roots in mathematical economics, in particular, in consumer economics as considered by Edgeworth and Pareto. The critical question in an exchange economy concerns the "equilibrium point" at which each of N consumers has achieved the best possible deal for hirnself or herself. Ultimately, this is a collective decision in which any further gain by one consumer can occur only at the expense of at least one other consumer. Such an equilibrium concept was first introduced by Edgeworth in 1881 in his book on mathematical psychics. Today, such an optimum is variously called "Pareto optimum" (after the Italian-French welfare economist who continued and expanded Edgeworth's work), "effi. cient," "nondominated," and so on.
$177.01