Skip to content

Commit 7855cb8

Browse files
committed
More updates to option definition file [skip ci]
1 parent 664d6e0 commit 7855cb8

1 file changed

Lines changed: 26 additions & 5 deletions

File tree

assets/optcuopt.def

Lines changed: 26 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,17 @@
11
*
22
* optcuopt.def
33
*
4-
presolve boolean 0 0 1 1 Controls whether presolve is enabled. Presolve can reduce problem size and improve solve time. Enabled by default for MIP, disabled by default for LP.
4+
solution_file string 1 "" 1 1 Controls the name of a file where cuOpt should write the solution
5+
user_problem_file string 1 "" 1 1 Controls the name of a file where cuOpt should write the user problem
56
num_cpu_threads integer 0 -1 -1 maxint 1 1 Controls the number of CPU threads used in the LP and MIP solvers (default GAMS Threads)
67
time_limit integer 0 maxint 0 maxint 1 1 Controls the time limit in seconds after which the solver will stop and return the current solution (default GAMS ResLim)
78
prob_read string 1 "" 1 1 Reads a problem from an MPS file
89
pdlp_solver_mode enumint 0 1 1 2 Controls the mode under which PDLP should operate
910
0 1 stable1
1011
1 1 stable2
11-
2 1 stable3
12-
3 1 methodical1
13-
4 1 fast1
12+
2 1 methodical1
13+
3 1 fast1
14+
4 1 stable3
1415
method enumint 0 0 1 2 Controls the method to solve the linear programming problem
1516
0 1 concurrent
1617
1 1 pdlp
@@ -31,14 +32,34 @@ per_constraint_residual boolean 0 0 1 2 Controls whether PDLP should compute the
3132
save_best_primal_so_far boolean 0 0 1 2 Controls whether PDLP should save the best primal solution so far
3233
first_primal_feasible boolean 0 0 1 2 Controls whether PDLP should stop when the first primal feasible solution is found
3334
crossover boolean 0 0 1 2 Controls whether PDLP should crossover to a basic solution after an optimal solution is found
35+
folding enumint -1 1 1 2 Controls whether to fold the linear program. Folding can reduce problem size by exploiting symmetry in the problem
36+
-1 1 automatic (default) cuOpt decides whether to fold based on problem characteristics
37+
0 1 disable folding
38+
1 1 force folding to run
39+
augmented enumint -1 1 1 2 Controls which linear system to solve in the barrier method
40+
-1 1 automatic (default) cuOpt selects the best linear system to solve
41+
0 1 solve the ADAT system (normal equations)
42+
1 1 solve the augmented system
43+
dualize enumint -1 1 1 2 Controls whether to dualize the linear program in presolve. Dualizing can improve solve time for problems, with inequality constraints, where there are more constraints than variables.
44+
-1 1 automatic (default) cuOpt decides whether to dualize based on problem characteristics
45+
0 1 don't attempt to dualize
46+
1 1 force dualize
47+
ordering enumint -1 1 1 2 Controls the ordering algorithm used by cuDSS for sparse factorizations. The ordering can significantly impact solver run time
48+
-1 1 automatic (default) cuOpt selects the best ordering
49+
0 1 cuDSS default ordering
50+
1 1 AMD (approximate minimum degree) ordering
51+
barrier_dual_initial_point boolean 0 0 1 2 Controls the method used to compute the dual initial point for the barrier solver. The choice of initial point will affect the number of iterations performed by barrier
52+
eliminate_dense_columns boolean 1 0 1 2 Controls whether to eliminate dense columns from the constraint matrix before solving. Eliminating dense columns can improve performance by reducing fill-in during factorization. However, extra solves must be performed at each iteration
53+
cudss_deterministic boolean 0 0 1 2 Controls whether cuDSS operates in deterministic mode. Deterministic mode ensures reproducible results across runs but may be slower
54+
presolve boolean 0 0 1 1 Controls whether presolve is enabled. Presolve can reduce problem size and improve solve time. Enabled by default for MIP, disabled by default for LP.
55+
dual_postsolve boolean 1 0 1 2 Controls whether dual postsolve is enabled. Disabling dual postsolve can improve solve time at the expense of not having access to the dual solution. Enabled by default for LP when presolve is enabled. This is not relevant for MIP problems
3456
mip_absolute_tolerance double 0 0.0001 0 maxdouble 1 3 Controls the MIP absolute tolerance
3557
mip_relative_tolerance double 0 0.0001 0 maxdouble 1 3 Controls the MIP relative tolerance
3658
mip_integrality_tolerance double 0 1e-05 0 maxdouble 1 3 Controls the MIP integrality tolerance
3759
mip_absolute_gap double 0 1e-10 0 maxdouble 1 3 Controls the absolute tolerance used to terminate the MIP solve (default GAMS OptCA)
3860
mip_relative_gap double 0 1e-5 0 maxdouble 1 3 Controls the relative tolerance used to terminate the MIP solve (default GAMS OptCR)
3961
mip_scaling boolean 0 1 1 3 Controls if scaling should be applied to the MIP problem
4062
mip_heuristics_only boolean 0 0 1 3 Controls if only the GPU heuristics should be run
41-
barrier_dual_initial_point boolean 0 0 1 2 Controls the method used to compute the dual initial point for the barrier solver. The choice of initial point will affect the number of iterations performed by barrier
4263
*
4364
* Groups
4465
*

0 commit comments

Comments
 (0)