|
11 | 11 | */ |
12 | 12 | #include "pdlp/HiPdlpWrapper.h" |
13 | 13 |
|
| 14 | +#include "pdlp/cupdlp/cupdlp_utils.h" |
14 | 15 | #include "pdlp/hipdlp/logger.hpp" |
15 | 16 | #include "pdlp/hipdlp/pdhg.hpp" |
16 | 17 | #include "pdlp/hipdlp/restart.hpp" |
17 | | -#include "pdlp/cupdlp/cupdlp_utils.h" |
18 | 18 |
|
19 | 19 | HighsStatus solveLpHiPdlp(HighsLpSolverObject& solver_object) { |
20 | 20 | return solveLpHiPdlp(solver_object.options_, solver_object.timer_, |
@@ -68,7 +68,9 @@ HighsStatus solveLpHiPdlp(const HighsOptions& options, HighsTimer& timer, |
68 | 68 | } |
69 | 69 |
|
70 | 70 | // print col_value and row_dual |
71 | | - debugPdlpFinalSolutionLog(pdlp.debug_pdlp_log_file_, pdlp_solution.col_value.data(), lp.num_col_, pdlp_solution.row_dual.data(), lp.num_row_); |
| 71 | + debugPdlpFinalSolutionLog(pdlp.debug_pdlp_log_file_, |
| 72 | + pdlp_solution.col_value.data(), lp.num_col_, |
| 73 | + pdlp_solution.row_dual.data(), lp.num_row_); |
72 | 74 | pdlp.solveReturn(); |
73 | 75 | // --- Print Summary --- |
74 | 76 | pdlp.logSummary(); |
@@ -118,15 +120,15 @@ HighsStatus solveLpHiPdlp(const HighsOptions& options, HighsTimer& timer, |
118 | 120 | } |
119 | 121 | assert(termination_status == TerminationStatus::OPTIMAL || |
120 | 122 | termination_status == TerminationStatus::TIMEOUT); |
121 | | - //highs_solution.col_value = x; |
122 | | - //highs_solution.col_value.resize(lp.num_col_); |
123 | | - //highs_solution.row_dual = y; |
124 | | - //lp.a_matrix_.product(highs_solution.row_value, highs_solution.col_value); |
125 | | - //lp.a_matrix_.productTranspose(highs_solution.col_dual, |
126 | | - // highs_solution.row_dual); |
127 | | - //for (HighsInt iCol = 0; iCol < lp.num_col_; iCol++) |
128 | | - // highs_solution.col_dual[iCol] = |
129 | | - // lp.col_cost_[iCol] - highs_solution.col_dual[iCol]; |
| 123 | + // highs_solution.col_value = x; |
| 124 | + // highs_solution.col_value.resize(lp.num_col_); |
| 125 | + // highs_solution.row_dual = y; |
| 126 | + // lp.a_matrix_.product(highs_solution.row_value, highs_solution.col_value); |
| 127 | + // lp.a_matrix_.productTranspose(highs_solution.col_dual, |
| 128 | + // highs_solution.row_dual); |
| 129 | + // for (HighsInt iCol = 0; iCol < lp.num_col_; iCol++) |
| 130 | + // highs_solution.col_dual[iCol] = |
| 131 | + // lp.col_cost_[iCol] - highs_solution.col_dual[iCol]; |
130 | 132 | highs_solution.value_valid = true; |
131 | 133 | highs_solution.dual_valid = true; |
132 | 134 | return HighsStatus::kOk; |
|
0 commit comments