Tight Cooperation and Its Application in Piecewise Linear Optimization

Many cooperative systems merge a linear constraint solver and a domain reduction solver over finite domains or intervals. The latter handles a high level formulation of the problem and passes domain variable information. The former handles a linear formulation of the problem and computes a relaxed optimal solution. This paper proposes an extension to this framework called tight cooperation where the linear formulation of a high level constraint is restated in a way, as domains are reduced. This approach is illustrated on piecewise linear optimization. Experimental results are given. These show that tight cooperation can give better results than classical cooperation and mixed-integer programming techniques.

[1]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[2]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[3]  Christoph Beierle,et al.  Logic Programming: Formal Methods and Practical Applications , 1994 .

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[5]  G. Nemhauser,et al.  Integer Programming , 2020 .

[6]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[7]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[8]  E. M. L. Beale,et al.  Global optimization using special ordered sets , 1976, Math. Program..

[9]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

[10]  Robert Fourer,et al.  Solving Piecewise-Linear Programs: Experiments with a Simplex Approach , 1992, INFORMS J. Comput..

[11]  Frédéric Benhamou,et al.  Heterogeneous Constraint Solving , 1996, ALP.

[12]  Philippe Refalo.  Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex Method , 1998, PLILP/ALP.

[13]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming III: Computational analysis and applications , 1992, Math. Program..

[14]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[15]  Marcel Mongeau,et al.  Discontinuous piecewise linear optimization , 1998, Math. Program..

[16]  Henri Beringer,et al.  Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers , 1995, Logic Programming: Formal Methods and Practical Applications.

[17]  Christine Solnon,et al.  Concurrent Cooperating Solvers over Reals , 1997, Reliab. Comput..

[18]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.