Methods of Mathematical Economics

Linear and Nonlinear Programming, Fixed-Point Theorems

Häftad, Engelska, 2002

AvJoel N. Franklin,Joel N Franklin

1 009 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 099 kr

Skickas inom 10-15 vardagar

Many advances have taken place in the field of combinatorial algorithms since this book first appeared two decades ago. Despite these advances and the development of new computing methods, several basic theories and methods remain important today for understanding mathematical programming and fixed-point theorems. In this easy-to-read classic, readers learn Wolfe's method, which remains useful for quadratic programming, and the Kuhn–Tucker theory, which underlies quadratic programming and most other nonlinear programming methods. In addition, the author presents multiobjective linear programming, which is being applied in environmental engineering and the social sciences.The book presents many useful applications to other branches of mathematics and to economics, and it contains many exercises and examples. The advanced mathematical results are proved clearly and completely. By providing the necessary proofs and presenting the material in a conversational style, Franklin made Methods of Mathematical Economics extremely popular among students. The addition of a list of errata, new to this edition, should add to the book's popularity as well as its usefulness both in the classroom and for individual study.

Produktinformation

Utgivningsdatum2002-01-31
Mått152 x 229 x 16 mm
Vikt437 g
FormatHäftad
SpråkEngelska
SerieClassics in Applied Mathematics
Antal sidor315
FörlagSociety for Industrial & Applied Mathematics,U.S.
ISBN9780898715095

Tillhör följande kategorier

Preface to the Classics EditionPrefaceErrataChapter 1: Linear Programming. Introduction to Linear ProgrammingLinear Programs and Their DualsHow the Dual Indicates OptimalityBasic SolutionsThe Idea of the Simplex MethodsSeparating Planes for Convex SetsFinite Cones and the Farkas AlternativeThe Duality PrinciplePerturbations and Parametric ProgrammingThe Simplex Tableau AlgorithmThe Revised Simplex AlgorithmA Simplex Algorithm for Degenerate ProblemsMultiobjective Linear ProgrammingZero-Sum, Two-Person GamesInteger Programming: Gomory’s MethodNetwork FlowsAssignment and Shortest-Route ProblemsThe Transportation ProblemChapter 2: Nonlinear Programming. Wolfe’s Method for Quadratic ProgrammingKuhn–Tucker TheoryGeometric ProgrammingChapter 3: Fixed-Point Theorems. Introduction to Fixed PointsContraction MappingsGarsia’s Proof of the Brouwer Fixed-Point TheoremMilnor’s Proof of the Brouwer Fixed-Point TheoremBarycentric Coordinates, Sperner’s Lemma, and an Elementary Proof of the Brouwer Fixed-Point TheoremThe Schauder Fixed-Point TheoremKakutani’s Fixed-Point Theorem and Nash’s Theorem for n-Person GamesIndex.