Algorithms

MIP start is the optimal solution and yet I receive "MIP start did not produce a new incumbent solution"

• Monir Sabbaghtorkan
• April 30, 2020 19:37

3 votes 5 comments

Distributed MIP logging & ramp-up question

• Simon Felix
• December 06, 2019 15:08

3 votes 8 comments

Model contains large quadratic objective coefficient range.

• Soufyan Zayou
• January 23, 2020 10:59

2 votes 10 comments

What solution wll GUROBI return when solving an unbounded MILP?

• Yingxiao Ye
• January 10, 2020 12:41

2 votes 1 comment

Parameters: Disconnected and Partition

• Leopold Kuttner
• May 26, 2021 16:17

1 vote 1 comment

same LP solution multiple times in root node, user cuts ignored

• Mario Ruthmair
• May 12, 2021 14:20

1 vote 2 comments

Gurobi stopping criteria

• Dominique Orban
• February 01, 2021 22:45

1 vote 8 comments

Dual simplex VS Barrier for Bender's feasibility cuts

• Marilena Zambara
• January 24, 2025 08:15

0 votes 0 comments

Do LP dual variables exactly match shadow prices?

• Hiroaki Onodera
• December 20, 2024 03:33

0 votes 0 comments

convergence property

• Yali Chen
• June 25, 2024 03:37

0 votes 0 comments

Lagrangian Bound in Column Generation

• Quang Anh Nguyen
• May 24, 2024 22:40

0 votes 0 comments

benders algorithm, the sub-problem is not feasible, use constr.farkas to solve the value of each constraint of the sub-problem at the corresponding position of the polar ray vector

• 涛 何
• May 11, 2024 03:46

0 votes 0 comments

Tolerance Settings in Simplex Method

• Jinwen Yang
• May 04, 2024 22:23

0 votes 0 comments

something problems in Python code

• 汉涛 田
• March 02, 2024 00:21

0 votes 0 comments

How to Leverage MIP to Optimize Resource Allocation at APKBudy?

• APK BUDY
• October 08, 2023 08:16

0 votes 0 comments

dynamic search

• Geoffrey James Kameni Tchokode
• March 22, 2022 08:39

0 votes 0 comments

Branch-cut(-price) node LP warm start

• Gleb Belov
• December 09, 2021 02:39

0 votes 1 comment

Barrier algorithm and Unboundedness detection

• Abdulkerim Benli
• August 25, 2021 17:09

0 votes 1 comment

Help with Implementation of Branch and Benders Cut in GurobiPy

• Amogh Bhosekar
• June 01, 2021 21:21

0 votes 1 comment

Number of Solutions

• Gianluca Sabbatini
• July 13, 2020 05:58

0 votes 5 comments

Ways to improve makespan in MILP

• Matías González
• July 01, 2020 01:43
• Edited

0 votes 1 comment

how to obtain the solution information of sub-problem when using callback

• Peng GUO
• June 16, 2020 21:24

0 votes 4 comments

The objective bounds improve slowly!

• Nazanin Madani
• June 15, 2020 04:00

0 votes 4 comments

Positive GAP interpretation when an optimal solution is found

• Carlos Monardes
• June 09, 2020 22:32

0 votes 3 comments

Cut callback

• Permanently deleted user
• May 13, 2020 22:51

0 votes 2 comments

How does Gurobi compute the IIS for infeasible models with integer variables?

• Gleb Belov
• May 12, 2020 05:34

0 votes 1 comment

Sub-optimal termination for SOCP problem

• Yanan Yu
• May 11, 2020 20:06

0 votes 1 comment

Different results solving the same problem twice with a for loop

• Tianhao Zhang
• May 07, 2020 14:21

0 votes 4 comments

MILP solution taking too long, while the incumbent obj value is at the optimal level from early on

• Makedon Karasavvidis
• May 07, 2020 13:13

0 votes 3 comments

Questions on Gurobi's algorithm

• Simon Kwon
• April 30, 2020 14:01
• Edited

0 votes 2 comments