Skip to content

All SAP systems will be unavailable on Saturday 10th December 2022 from 0800-1800 UK Time.

If you can’t place an order, please contact Customer Services to complete your order.

UK/ROW +44 (0) 1223 326050 | US 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Register Sign in Wishlist
Methods of Mathematical Economics

Methods of Mathematical Economics
Linear and Nonlinear Programming, Fixed-Point Theorems

$67.00 (P)

Part of Classics in Applied Mathematics

  • Date Published: January 1987
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Paperback
  • isbn: 9780898715095

$ 67.00 (P)

This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Unavailable Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Many advances have taken place in the field of combinatorial algorithms since Methods of Mathematical Economics 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 1987
    • format: Paperback
    • isbn: 9780898715095
    • length: 315 pages
    • dimensions: 227 x 154 x 16 mm
    • weight: 0.439kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    Preface to the Classics Edition
    1. Linear Programming. Introduction to Linear Programming
    Linear Programs and Their Duals
    How the Dual Indicates Optimality
    Basic Solutions
    The Idea of the Simplex Methods
    Separating Planes for Convex Sets
    Finite Cones and the Farkas Alternative
    The Duality Principle
    Perturbations and Parametric Programming
    The Simplex Tableau Algorithm
    The Revised Simplex Algorithm
    A Simplex Algorithm for Degenerate Problems
    Multiobjective Linear Programming
    Zero-Sum, Two-Person Games
    Integer Programming. Gomory's Method
    Network Flows
    Assignment and Shortest-Route Problems
    The Transportation Problem
    2. Nonlinear Programming. Wolfe's Method for Quadratic Programming
    Kuhn-Tucker Theory
    Geometric Programming
    3. Fixed-Point Theorems. Introduction to Fixed Points
    Contraction Mappings
    Garsia's Proof of the Brouwer Fixed-Point Theorem
    Milnor's Proof of the Brouwer Fixed-Point Theorem
    Barycentric Coordinates, Sperner's Lemma, and an Elementary Proof of the Brouwer Fixed-Point Theorem
    The Schauder Fixed-Point Theorem
    Kakutani's Fixed-Point Theorem and Nash's Theorem for n-Person Games

  • Author

    Joel N. Franklin, California Institute of Technology

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.