How to output all feasible solutions?

回答済み

FEI XUE

2022年05月24日 01:11

• 
• 
• 

from gurobipy import *
import numpy as np
import math
space=gurobipy.Model('matchpattern')
n=6
pij=space.addVars(range(1,n+1), range(1,n+1),vtype=gurobipy.GRB.BINARY)

space.update()
space.setObjective(quicksum(pij[i,j] for i in range (1,n+1) for j in range(1,n+1)),GRB.MINIMIZE)

space.addConstrs(quicksum(pij[i,j] for i in range(1,n+1))==1 for j in range(1,n+1))
space.addConstrs(quicksum(pij[i,j] for j in range(1,n+1))==1 for i in range(1,n+1))

space.addConstrs(pij[i,j]==pij[j,i] for i in range (1,n+1) for j in range(1,n+1))
space.addConstrs(pij[i,i]==0 for i in range (1,n+1))

space.optimize()

 

Here is my code, when n is 6, there should be 15 possible solutions, how can I output all 15 possible solutions as a matrix like this?

Looking forward your reply. Thank you very much.

([[[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]],\
               [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1],[0,0,1,0,0,1],[0,0,0,1,0,0]],\
               [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0]],\
               [[0,0,1,0,0,0],[0,0,0,1,0,0],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]],\
               [[0,0,1,0,0,0],[0,0,0,0,1,0],[1,0,0,0,0,0],[0,0,0,0,0,1],[0,1,0,0,0,0],[0,0,0,1,0,0]],\
               [[0,0,1,0,0,0],[0,0,0,0,0,1],[1,0,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,1,0,0,0,0]],\
               [[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]],\
               [[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1],[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0]],\
               [[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0]],\
               [[0,0,0,0,1,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1],[1,0,0,0,0,0],[0,0,0,1,0,0]],\
               [[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0]],\
               [[0,0,0,0,1,0],[0,0,0,0,0,1],[0,0,0,1,0,0],[0,0,1,0,0,0],[1,0,0,0,0,0],[0,1,0,0,0,0]],\
               [[0,0,0,0,0,1],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[1,0,0,0,0,0]],\
               [[0,0,0,0,0,1],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[1,0,0,0,0,0]],\
               [[0,0,0,0,0,1],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[1,0,0,0,0,0]]])

0

• 正式なコメント

  

  Simranjit Kaur

  • Gurobi Staff

  2025年11月16日 23:36

  This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support.
• 

  Jonasz Staszek

  • Community Moderator

  2022年05月25日 12:51

  • 
  • 
  • 

  If you know upfront that there will be 15 solutions, you can add these two lines before the optimize call:

  space.setParam("PoolSolutions", 15)
  space.setParam("PoolSearchMode", 2)

  Further info can be found here.

  Best regards,
  Jonasz

  0
• 

  FEI XUE

  2022年05月28日 12:59

  • 
  • 
  • 

  Doctor Jonasz

  Thank you very much.

  It helps me a lot.

  0

投稿コメントは受け付けていません。