Logo Logo

Polyhedra of Regular p-Nary Group Problems, Mathematical Programming

Abstract

The duality for group problems developed in [3] is restricted top-nary group problems. Results for ternary group problems are obtained similar to those obtained by Fulkerson and Lehman for the binary case. A complete facet description of the group polyhedron is available for a group problem having the Fulkerson property. A group problem has the Fulkerson property if its vertices are the facets of the blocking group problem and if its facets are the vertices of the blocking group problem. The Fulkerson property is a generalization of the max-flow min-cut theorem of Ford and Fulkerson which is interpreted as a statement about the pair of row modules arising from a group problem. We show that a group problem has the Fulkerson property if the corresponding row module is regular.

Type

Article

Author(s)

Sunil Chopra, David L. Jensen, Ellis L. Johnson

Date Published

1989

Citations

Chopra, Sunil, David L. Jensen, and Ellis L. Johnson. 1989. Polyhedra of Regular p-Nary Group Problems. Mathematical Programming. 43(1-3): 1-29.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more