How does simplex method solve the MIQP problem?

回答済み

Hongmin Zhang

2023年09月04日 02:36

• 
• 
• 

As my model is an MIQP problem, the Gurobi software's log indicates that the simplex method is being utilized. I am perplexed by how the simplex method is applied to an MIQP problem. Is there any comprehensive documentation available that explains the algorithm in detail? Moreover, if the MIQP problem is relaxed, how can this be implemented? I would greatly appreciate it if you could provide documentation or papers that delve into this aspect of the algorithm.

関連

• MIQP

0

• 

  David Torres Sanchez

  • Gurobi Staff

  2023年09月05日 08:13

  Hi Hongmin,

  The parameters: PreMIQCPForm and PreQLinearize control the transformation being used.
  You might want to have a play with these parameters.
  Additionally see MIQCPMethod.

  Cheers, 
  David

  0
• 

  Hongmin Zhang

  2023年09月06日 12:56

  • 
  • 
  • 

  Dear David,

  I believe that the 'PreQLinearize' parameter facilitates the transformation from MIQP (Mixed-Integer Quadratic Programming) to MILP (Mixed-Integer Linear Programming), and I am curious if there is any algorithm documentation that provides a detailed explanation of this process.

  Best wishes,

  Hongmin

  0
• 

  David Torres Sanchez

  • Gurobi Staff

  2023年09月06日 13:14

  Hi Hongmin,

  Apart from the documentation, you can also find more details about this in the Ed Klotz webinar:

  • Video: https://www.youtube.com/watch?v=qGgJ0gBptwY
  • Slides: https://www.gurobi.com/wp-content/uploads/Models-with-Products-of-Binary-Variables.pdf

  Particularly, see slide 12.

  Cheers, 
  David

  0

サインインしてコメントを残してください。