For a primal-unbounded LP (i.e. dual-infeasible), returns the primal unbounded ray: a certificate of unboundedness, with one entry per variable (column).
hi_solver_get_primal_ray(solver)A list with `status` (integer, 0 = OK), `has_primal_ray` (logical), and `primal_ray` (numeric vector of length `n_col`, or `NULL` when no ray exists).
An object of class "highs_solver".
As with the dual ray, this is a simplex-method certificate; requesting it may solve an auxiliary LP.