You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Passes multiple linear objective data to HiGHS, clearing any such data already in HiGHS
460
+
461
+
### Parameters
462
+
* `highs`: A pointer to the Highs instance.
463
+
* `weight`: A pointer to the weights of the linear objective, with its positive/negative sign determining whether it is minimized or maximized during lexicographic optimization
464
+
* `offset`: A pointer to the objective offsets
465
+
* `coefficients`: A pointer to the objective coefficients
466
+
* `abs_tolerance`: A pointer to the absolute tolerances used when constructing objective constraints during lexicographic optimization
467
+
* `rel_tolerance`: A pointer to the relative tolerances used when constructing objective constraints during lexicographic optimization
468
+
* `priority`: A pointer to the priorities of the objectives during lexicographic optimization
469
+
### Returns
470
+
A `kHighsStatus` constant indicating whether the call succeeded.
* `weight`: The weight of the linear objective, with its positive/negative sign determining whether it is minimized or maximized during lexicographic optimization
484
+
* `offset`: The objective offset
485
+
* `coefficients`: A pointer to the objective coefficients
486
+
* `abs_tolerance`: The absolute tolerance used when constructing an objective constraint during lexicographic optimization
487
+
* `rel_tolerance`: The relative tolerance used when constructing an objective constraint during lexicographic optimization
488
+
* `priority`: The priority of this objective during lexicographic optimization
489
+
### Returns
490
+
A `kHighsStatus` constant indicating whether the call succeeded.
Get an unbounded dual ray that is a certificate of primal infeasibility.
973
+
Indicates whether a dual ray that is a certificate of primal infeasibility currently exists, and (at the expense of solving an LP) gets it if it does not and dual\\_ray\\_value is not nullptr.
920
974
921
975
### Parameters
922
976
* `highs`: A pointer to the Highs instance.
923
-
* `has_dual_ray`: A pointer to an int to store 1 if the dual ray exists.
977
+
* `has_dual_ray`: A pointer to an int to store 1 if a dual ray currently exists.
924
978
* `dual_ray_value`: An array of length [num\\_row] filled with the unbounded ray.
925
979
### Returns
926
980
A `kHighsStatus` constant indicating whether the call succeeded.
@@ -929,10 +983,24 @@ function Highs_getDualRay(highs, has_dual_ray, dual_ray_value)
Indicates whether a dual unboundedness direction (corresponding to a certificate of primal infeasibility) exists, and (at the expense of solving an LP) gets it if it does not and dual\\_unboundedness\\_direction is not nullptr
990
+
991
+
### Parameters
992
+
* `highs`: A pointer to the Highs instance.
993
+
* `has_dual_unboundedness_direction`: A pointer to an int to store 1 if the dual unboundedness direction exists.
994
+
* `dual_unboundedness_direction_value`: An array of length [num\\_col] filled with the unboundedness direction.
Get an unbounded primal ray that is a certificate of dual infeasibility.
1003
+
Indicates whether a primal ray that is a certificate of primal unboundedness currently exists, and (at the expense of solving an LP) gets it if it does not and primal\\_ray\\_value is not nullptr.
0 commit comments