| |||||||||||
| |||||||||||
Create a problem with logical constraints Description Create a simple problem using the modelling methods max for creating general constraints. Further explanation of this example: 'Xpress Python Reference Manual'
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
general_constraints_logic.py
# Here we use the and/or operators of the Python interface to create a
# new optimization problem.
#
# (C) Fair Isaac Corp., 1983-2024
# Solve a simple SAT problem by finding the solution with the fewest
# True variables that satisfy all clauses
import xpress as xp
p = xp.problem()
N = 10
k = 5
x = [xp.var(vartype=xp.binary) for _ in range(N)]
# At most one of each pair can be True
con0 = [(x[i] & x[i+1]) == 0 for i in range(0, N-1, 2)]
# At least a quarter of all OR clauses on continuous groups of k
# clauses must be True
con1 = xp.Sum(xp.Or(*(x[i:i+k])) for i in range(N-k)) >= N/4
p = xp.problem(x, con0, con1)
# Set time limit to 5 seconds
p.controls.timelimit = 5
p.optimize()
print("solution: x = ", p.getSolution())
| |||||||||||
| © Copyright 2023 Fair Isaac Corporation. |
