Skip to main content
Log in

Dual row modules and polyhedra of blocking group problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

Corresponding to every group problem is a row module. Duality for group problems is developed using the duality or orthogonality of the corresponding row modules. The row module corresponding to a group problem is shown to include Gomory's fractional cuts for the group polyhedron and all the vertices of the polyhedron of the blocking group problem. The polyhedra corresponding to a pair of blocking group problems are shown to have a blocking nature i.e. the vertices of one include some of the facets of the other and mutatis mutandis. The entire development is constructive. The notions of contraction, deletion, expansion and extension are defined constructively and related to homomorphic liftings and suproblems in a dual setting. Roughly speaking a homomorphic lifting is dual to forming a subproblem. A proof of the Gastou-Johnson generalization of Gomory's homomorphic lifting theorem is given, and dual constructions are discussed. A generalization of Gomory's subadditive characterization to subproblems is given. In the binary case, it is closely related to the work of Seymour on cones arising from binary matroids.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Araoz and E.L. Johnson, “Morphic liftings between pairs of integer polyhedra” IBM Research Report, in preparation.

  2. S. Chopra, “Dual row modules and polyhedra of blocking group problems,” Ph.D. Dissertation, SUNY (Stony Brook, 1986).

    Google Scholar 

  3. S. Chopra, D.L. Jensen and E.L. Johnson, “Polyhedra of regularp-nary group problems,” submitted toMathematical Programming.

  4. D.R. Fulkerson, “Blocking polyhedra,” in: B. Harris, ed.,Graph theory and its applications (Academic Press, NY, 1970) pp. 93–112.

    Google Scholar 

  5. D.R. Fulkerson, “Networks, frames, blocking systems,” in: G.B. Dantzig and A.F. Veinott Jr., eds.Mathematics of the decision sciences, Part 1 (AMS, 1968) pp. 303–334.

  6. G. Gastou, “On Facets of integer programming polyhdra,” Ph.D. thesis, Yale University, 1982.

  7. G. Gastou and E.L. Johnson, “Binary group and Chinese postman polyhedra,”Mathematical Programming 34 (1986) 1–33.

    Article  MATH  MathSciNet  Google Scholar 

  8. R.E. Gomory, “An algorithm for integer solutions to linear programs,” R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming, (McGraw Hill, New York, 1963), pp. 269–302.

    Google Scholar 

  9. R.E. Gomory, “On the relation between integer and noninteger solutions to linear programs,”Proceedings of National Academy of Science 53 (1965) 260–265.

    Article  MATH  MathSciNet  Google Scholar 

  10. R.E. Gomory, “Some polyhedra related to combinatorial problems,”Linear Algebra and its Applications 2 (1969) 451–558.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Hall,The theory of groups (Chelsea publishing Co., NY, 1976).

    MATH  Google Scholar 

  12. B. Hartley and T.O. Hawkes, Rings, modules and linear algebra (Chapman and Hall Ltd., London).

  13. T.C. Hu,Integer programming and network flows (Addison-Wesley, 1970).

  14. E.L. Johnson, “On the generality of the subadditive characterization of facets,”Mathematics of Operations Research 6 (1981) 101–112.

    Article  MATH  MathSciNet  Google Scholar 

  15. E.L. Johnson, “On binary group problems having the Fulkerson property,” IBM RC 10641 (Yorktown Heights, NY, 1984).

  16. E.L. Johnson, “Support functions, blocking pairs, and anti-blocking pairs,”Mathematical Programming Study 8 (1978) 167–196.

    Google Scholar 

  17. E.L. Johnson, “Integer Programming: facets, subadditivity and duality for group and semi-group problems,” IBM RC 7450 (Yorktown Heights, NY, 1978).

  18. S. MacLane and G. Birkhoff,Algebra (The MacMillan Co., NY, 1967).

    MATH  Google Scholar 

  19. P.D. Seymour, “Matroids with the max-flow min-cut property,”Journal of Combinatorial Theory series B 23 (1977) 189–222.

    Article  MATH  MathSciNet  Google Scholar 

  20. P.D. Seymour, “Matroids and multicommodity flows,”European Journal of Combinatorics 2 (1981) 257–290.

    MATH  MathSciNet  Google Scholar 

  21. W.T. Tutte, “Lectures on matroids,”Journal of Research of the National Bureau of Standards Section B 69 (1965) 1–47.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chopra, S., Johnson, E.L. Dual row modules and polyhedra of blocking group problems. Mathematical Programming 38, 229–270 (1987). https://doi.org/10.1007/BF02592014

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592014

Key words

Navigation