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.
Similar content being viewed by others
References
J. Araoz and E.L. Johnson, “Morphic liftings between pairs of integer polyhedra” IBM Research Report, in preparation.
S. Chopra, “Dual row modules and polyhedra of blocking group problems,” Ph.D. Dissertation, SUNY (Stony Brook, 1986).
S. Chopra, D.L. Jensen and E.L. Johnson, “Polyhedra of regularp-nary group problems,” submitted toMathematical Programming.
D.R. Fulkerson, “Blocking polyhedra,” in: B. Harris, ed.,Graph theory and its applications (Academic Press, NY, 1970) pp. 93–112.
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.
G. Gastou, “On Facets of integer programming polyhdra,” Ph.D. thesis, Yale University, 1982.
G. Gastou and E.L. Johnson, “Binary group and Chinese postman polyhedra,”Mathematical Programming 34 (1986) 1–33.
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.
R.E. Gomory, “On the relation between integer and noninteger solutions to linear programs,”Proceedings of National Academy of Science 53 (1965) 260–265.
R.E. Gomory, “Some polyhedra related to combinatorial problems,”Linear Algebra and its Applications 2 (1969) 451–558.
M. Hall,The theory of groups (Chelsea publishing Co., NY, 1976).
B. Hartley and T.O. Hawkes, Rings, modules and linear algebra (Chapman and Hall Ltd., London).
T.C. Hu,Integer programming and network flows (Addison-Wesley, 1970).
E.L. Johnson, “On the generality of the subadditive characterization of facets,”Mathematics of Operations Research 6 (1981) 101–112.
E.L. Johnson, “On binary group problems having the Fulkerson property,” IBM RC 10641 (Yorktown Heights, NY, 1984).
E.L. Johnson, “Support functions, blocking pairs, and anti-blocking pairs,”Mathematical Programming Study 8 (1978) 167–196.
E.L. Johnson, “Integer Programming: facets, subadditivity and duality for group and semi-group problems,” IBM RC 7450 (Yorktown Heights, NY, 1978).
S. MacLane and G. Birkhoff,Algebra (The MacMillan Co., NY, 1967).
P.D. Seymour, “Matroids with the max-flow min-cut property,”Journal of Combinatorial Theory series B 23 (1977) 189–222.
P.D. Seymour, “Matroids and multicommodity flows,”European Journal of Combinatorics 2 (1981) 257–290.
W.T. Tutte, “Lectures on matroids,”Journal of Research of the National Bureau of Standards Section B 69 (1965) 1–47.
Author information
Authors and Affiliations
Rights 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
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02592014