View More View Less
  • 1 University of Pécs Department of Applied Mathematics, Institute of Mathematics and Informatics, Faculty of Science Ifjúság u. 6 H-7624 Pécs Hungary
Restricted access

Purchase article

USD  $25.00

Purchase this article

USD  $387.00

A zero-one linear program is a global discrete optimization problem. Namely, it is a linear programming problem with zero-one variables. The real relaxation of a zero-one program is again a continuous linear programming problem. Simply, the zero-one variables are replaced by continuous variables varying between zero and one independently of each other. If the real relaxation, as a continuous problem, solved with the simplex method happens to have a zero-one optimal solution, then this particular solution is also an optimal solution of the original zero-one programming problem. Suppose that x 1,…,x n are all the variables of a given zero-one linear programming problem. For convenience we introduce further variables y 1,…,y n defined by y 1=1−x 1,…, y n=1−x n respectively. For a unified notation the variables x 1,…,x n and y 1,…, y n together will be denoted by z 1,…,z 2n. These variables will play the roles the nodes of the conflict graph Г associated with the given zero-one linear programming problem. Fixing the variables z i and z j both to be equal to one simultaneously reduces the number of variables in the problem. If the new smaller optimization problem does not have any feasible solution, then the nodes z i and z j will be connected by an edge in the graph Γ. The graph Γ simply records that there is a conflict between the assignments z i =1 and z j =1 which explains the name conflict graph. In other words the non-directed edge between the nodes z i and z j codes the fact that the inequality z i+z j≤1holds. The conflict graph was designed to generate additional constraints the so-called valid inequalities or cuts in order to expedite the solution of the zero-one linear program via its real relaxation. This particular solution strategy is aptly named the branch and cut method. It will be shown that the conflict graph besides its intended use can also be applied in another solution technique the method of implicit enumeration. We will illustrate by examples that the conflict graph provides us with rules to prune the search tree that are not offered by the commonly applied pruning rules. In addition the computations involved can easily be organized into a highly parallel computational scheme.

  • Atamturk A, Savelsbergh M. W. P. Conflict graphs in solving integer programming problems, European Journal of Operational Research Vol. 121, 2000, pp. 40–55.

    Savelsbergh M. W. P. , 'Conflict graphs in solving integer programming problems ' (2000 ) 121 European Journal of Operational Research : 40 -55.

    • Search Google Scholar
  • Balas E. An additive algorithm for solving linear programs with zero-one variables, Operation Research, Vol. 13, 1998, pp. 517–546.

    Balas E. , 'An additive algorithm for solving linear programs with zero-one variables ' (1998 ) 13 Operation Research : 517 -546.

    • Search Google Scholar
  • Dantzig G. B. Linear programming and extensions, Princeton Univ. Press. 1993.

  • Kárteszi F. An Introduction to Finite Geometries (in Hungarian), Akadémia Kiadó 1972.

  • Nemhauser G L, Wolsey L A, Integer and Combinatorial Optimization, Wiley 1999.

  • Vizvári B. Integer Programming (in Hungarian), Typotex 2006.

  • Wolsey L. A. Integer programming, Wiley 1998.

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Aug 2020 4 0 0
Sep 2020 0 0 0
Oct 2020 0 0 0
Nov 2020 2 1 0
Dec 2020 2 0 0
Jan 2021 0 0 0
Feb 2021 0 0 0