Skip to content

Fix handling zero sized array in case of presolve #491

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
rapids-bot merged 4 commits into from
Oct 14, 2025
Merged

Fix handling zero sized array in case of presolve #491

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
65fa997
Fix return on size mismatch in Barrier
hlinsen Oct 13, 2025
f6e6e6c
Merge branch 'barrier-return' of github.com:hlinsen/cuopt into py_fix
rgsl888prabhu Oct 14, 2025
bdee0a9
handle corner case with zero sized arrays
rgsl888prabhu Oct 14, 2025
929a2fa
Merge branch 'branch-25.10' into py_fix
rgsl888prabhu Oct 14, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 6 additions & 2 deletions python/cuopt/cuopt/linear_programming/problem.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1232,13 +1232,17 @@ def populate_solution(self, solution):
if len(primal_sol) > 0:
for var in self.vars:
var.Value = primal_sol[var.index]
if not IsMIP:
if (
not IsMIP
and reduced_cost is not None
and len(reduced_cost) > 0
):
var.ReducedCost = reduced_cost[var.index]
dual_sol = None
if not IsMIP:
dual_sol = solution.get_dual_solution()
for i, constr in enumerate(self.constrs):
if dual_sol is not None:
if dual_sol is not None and len(dual_sol) > 0:
constr.DualValue = dual_sol[i]
constr.Slack = constr.compute_slack()
self.ObjValue = self.Obj.getValue()
Expand Down