Kategoria BISAC: Mathematics >> Linear & Nonlinear Programming

This book is developed for the study of vectorial problems in the calculus of variations. The subject is a very active one and almost half of the book consists of new material. This is a new edition of the earlier book published in 1989 and it is suitable for graduate students. The book has been updated with some new material and examples added. Applications are included.

Optimization under constraints is an essential part of everyday life. Indeed, we routinely solve problems by striking a balance between contradictory interests, individual desires and material contingencies. This notion of equilibrium was dear to thinkers of the enlightenment, as illustrated by Montesquieu s famous formulation: "In all magistracies, the greatness of the power must be compensated by the brevity of the duration."

Astonishingly, natural laws are guided by a similar principle. Variational principles have proven to be surprisingly fertile. For example, Fermat used...

-I would not hesitate to recommend the book.- -- Industrial Engineering
Linear programming is an extremely effective problem-solving tool, with applications in business, agriculture, government, manufacturing, transportation, engineering, and many other areas. This very readable book presents an elementary introduction to linear programming in a refreshing, often humorous style.
Requiring no math beyond high-school algebra, the book shows how linear programming can help anyone reach the optimum solution for a host of diverse problems. Chapter One introduces the basic concepts...

Designed primarily for economists and those interested in management economics who are not necessarily accomplished mathematicians, this text offers a clear, concise exposition of the relationship of linear programming to standard economic analysis. The research and writing were supported by The RAND Corporation in the late 1950s.
Linear programming has been one of the most important postwar developments in economic theory, but until publication of the present volume, no text offered a comprehensive treatment of the many facets of the relationship of linear programming to traditional...

The intention of the authors is to examine the relationship between piecewise linear structure and differential structure: a relationship, they assert, that can be understood as a homotopy obstruction theory, and, hence, can be studied by using the traditional techniques of algebraic topology.

Thus the book attacks the problem of existence and classification (up to isotopy) of differential structures compatible with a given combinatorial structure on a manifold. The problem is completely "solved" in the sense that it is reduced to standard problems of algebraic topology.

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference...