Description

Book Synopsis
Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples.Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm. Study Guide here

Table of Contents
Introduction; Basics; The Double Description Method; Closed Convex Sets; Convex Functions of One Variable; Differentiable Functions of Several Variables; Convex Functions of Several Variables; Convex Optimization.

Undergraduate Convexity: From Fourier And Motzkin

    Product form

    £75.05

    Includes FREE delivery

    RRP £79.00 – you save £3.95 (5%)

    Order before 4pm tomorrow for delivery by Fri 26 Jun 2026.

    A Hardback by Niels Lauritzen

    Out of stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Undergraduate Convexity: From Fourier And Motzkin by Niels Lauritzen

      Publisher: World Scientific Publishing Co Pte Ltd
      Publication Date: 06/05/2013
      ISBN13: 9789814412513, 978-9814412513
      ISBN10: 9814412511

      Description

      Book Synopsis
      Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples.Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm. Study Guide here

      Table of Contents
      Introduction; Basics; The Double Description Method; Closed Convex Sets; Convex Functions of One Variable; Differentiable Functions of Several Variables; Convex Functions of Several Variables; Convex Optimization.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account