Skip to content
Home/ In-Depth Analysis of Linear Programming (2001)
In-Depth Analysis of Linear Programming (2001)

In-Depth Analysis of Linear Programming (2001)

No customer reviews yet ISBN 9781402000850

Along with the traditional material concerning linear programming (the simplex method, the theory of duality, the dual simplex method), In-Depth Analysis of Linear Programming contains new results of research carried out by the authors.
For the first time, the criteria of stability (in the geometrical and algebraic forms) of the general linear programming problem are formulated and proved. New regularization methods based on the idea of extension of an admissible set are proposed for solving unstable (ill-posed) linear programming problems. In contrast to the well-known regularization methods, in the methods proposed in this book the initial unstable problem is replaced by a new stable auxiliary problem. This is also a linear programming problem, which can be solved by standard finite methods. In addition, the authors indicate the conditions imposed on the parameters of the auxiliary problem which guarantee its stability, and this circumstance advantageously distinguishes the regularization methods proposed in this book from the existing methods. In these existing methods, the stability of the auxiliary problem is usually only presupposed but is not explicitly investigated.
In this book, the traditional material contained in the first three chapters is expounded in much simpler terms than in the majority of books on linear programming, which makes it accessible to beginners as well as those more familiar with the area.

About the author

Product details

Pub dateOct 31, 2001
ISBN-101402000855
ISBN-139781402000850
LanguageEnglish
Last updated 2026-03-14 03:45
$114.64
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
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&#x3b; 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