How optimization algorithms work & improving their performance

How does Gurobi determine whether a MIQCQP problem is feasible or not Answered
0 votes 4 comments
Reliable Results ? Answered
1 vote 4 comments
If solver hits time limit, is a solution output? Answered
0 votes 4 comments
Tolerance and constraint parameters Answered
2 votes 4 comments
Solving LPs sequentially versus one large LP with non-interacting variables/constraints Answered
0 votes 4 comments
About parallel programing for QCQP problem Answered
0 votes 4 comments
Order of variables & constraints vs. performance Answered
2 votes 4 comments
Balancing penalty weights when relaxing constraints Answered
0 votes 4 comments
Speeding up zero-objective binary LP Answered
0 votes 4 comments
Controlling cut generation in the root node setting the CutPasses parameter Answered
0 votes 4 comments
Lower bound of non-convex problem not improving Answered
0 votes 3 comments
Objective gap declines so slowly when I use Gurobi to solve my non-convex MIQCP problem Answered
0 votes 3 comments
MIQP Model taking forever to compute Answered
1 vote 3 comments
How does Gurobi handle 'convex-quadratic' variables in nonconvex optimization? Answered
0 votes 3 comments
Memory Issue During Optimization with Gurobi Answered
0 votes 3 comments
Iterative Approach change the optimal result Answered
0 votes 3 comments
Advice on performance tuning of MILP Answered
0 votes 3 comments
How to define the "lower bound" in the "ObjBound" Answered
0 votes 3 comments
How to describe SQL IN statement using Gurobi constraints Answered
0 votes 3 comments
Speeding up Gurobi adding Constraint time Answered
0 votes 3 comments
Algorithm Answered
0 votes 3 comments
MIP - Time limit - Extracting best feasible solution in given time limit Answered
0 votes 3 comments
BestBdStop for feasibility problems Answered
0 votes 3 comments
Lazy constraints can not be added to the model. Answered
0 votes 3 comments
Infeasible Step Answered
0 votes 3 comments
Configuration for binary LP feasibility check Answered
0 votes 3 comments
Node exploration takes too long when constraints increase Answered
0 votes 3 comments
How does simplex method solve the MIQP problem? Answered
0 votes 3 comments
Parameters for finding a single feasible solution of an MIP problem Answered
0 votes 3 comments