Scribd Logo
Upload

Welcome to Scribd!

  • Integer Points in Polyhedra: Spring 2009 Assignment Sheet 11

    Uploaded by

    kr0465
    2 views1 page
    The document contains an assignment sheet from Dr. Gennady Shmonin for his Spring 2009 class on Integer Points in Polyhedra that is due on May 21, 2009. It lists 3 exercises, the first asking to describe an algorithm to compute the maximum difference in an integer program's objective value over all feasible vectors, the second showing when a system has no integer solution, and the third proving when a parametric polyhedron has finite lattice width.

    Original Description:

    Original Title

    Exercise 11

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains an assignment sheet from Dr. Gennady Shmonin for his Spring 2009 class on Integer Points in Polyhedra that is due on May 21, 2009. It lists 3 exercises, the first asking to describe an algorithm to compute the maximum difference in an integer program's objective value over all feasible vectors, the second showing when a system has no integer solution, and the third proving when a parametric polyhedron has finite lattice width.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Integer Points in Polyhedra: Spring 2009 Assignment Sheet 11

    Uploaded by

    kr0465
    The document contains an assignment sheet from Dr. Gennady Shmonin for his Spring 2009 class on Integer Points in Polyhedra that is due on May 21, 2009. It lists 3 exercises, the first asking to describe an algorithm to compute the maximum difference in an integer program's objective value over all feasible vectors, the second showing when a system has no integer solution, and the third proving when a parametric polyhedron has finite lattice width.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Dr.

    Gennady Shmonin

    Due Date: May 21, 2009

    Integer Points in Polyhedra


    Spring 2009 Assignment Sheet 11

    Exercise 1 (Integer programming gaps) Provided an algorithm to decide parametric integer programming, i.e., the sentences of the form b Q /Zp x Zn : Ax b , when p and n are xed, describe an algorithm that, given an integral matrix A and an integral vector c , computes the maximum difference max c T x : Ax b max c T x : Ax b, x integral over all vectors b , for which the integer program is feasible, and runs in polynomial time if the number of variables x is xed. Exercise 2 (Integer programming infeasibility) Show that a system Ax b has no integral solution if and only if there is a subsystem A x b of Ax b with at most 2n inequalities that has no integral solution (n is the number of variables). Exercise 3 (Innite lattice width) Prove that a parametric polyhedron P b = x : Ax b has nite lattice width if and only if the polyhedron P 0 = x : Ax 0 has nite lattice width.

    You might also like