Abstract
This paper considers the set packing problem max{wx: Ax ⩽ b, x ⩾ 0 and integral}, whereA is anm × n 0–1 matrix,w is a 1 ×n weight vector of real numbers andb is anm × 1 vector of ones. In equality form, its linear programming relaxation is max{wx: (x, y) ∈P(A)} whereP(A) = {(x, y):Ax +I m y =b, x⩾0,y⩾0}. Letx 1 be any feasible solution to the set packing problem that is not optimal and lety 1 =b − Ax 1; then (x 1,y 1) is an integral extreme point ofP(A). We show that there exists a sequence of simplex pivots from (x 1,y 1) to (x*,y*), wherex* is an optimal solution to the set packing problem andy* =b − Ax*, that satisfies the following properties. Each pivot column has positive reduced weight and each pivot element equals plus one. The number of pivots equals the number of components ofx* that are nonbasic in (x 1,y 1).
Similar content being viewed by others
References
E. Balas and M. Padberg, “On the set covering problem,”Operations Research 20 (1972) 1152–1161.
V. Chvátal, “On certain polytopes associated with graphs,”Journal of Combinatorial Theory B 18 (1975) 138–154.
R. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
Y. Ikura and G.L. Nemhauser, “An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs,”Annals of Discrete Mathematics 16 (1982) 149–168.
V.A. Trubin, “On a method of solution of integer linear programming problems of a special kind,”Soviet Mathematics Doklady 10 (1969) 1544–1546.
Author information
Authors and Affiliations
Additional information
This research was supported by NSF Grants ECS-8005360 and ECS-8307473 to Cornell University.
Rights and permissions
About this article
Cite this article
Ikura, Y., Nemhauser, G.L. Simplex pivots on the set packing polytope. Mathematical Programming 33, 123–138 (1985). https://doi.org/10.1007/BF01582240
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582240