Definition at line 458 of file solve_result.h.
#include <solve_result.h>
◆ SolveResult()
| operations_research::math_opt::SolveResult::SolveResult |
( |
Termination | termination | ) |
|
|
inlineexplicit |
◆ best_objective_bound()
| double operations_research::math_opt::SolveResult::best_objective_bound |
( |
| ) |
const |
◆ best_primal_solution()
| const PrimalSolution & operations_research::math_opt::SolveResult::best_primal_solution |
( |
| ) |
const |
◆ bounded()
| bool operations_research::math_opt::SolveResult::bounded |
( |
| ) |
const |
◆ constraint_status()
◆ dual_bound()
| double operations_research::math_opt::SolveResult::dual_bound |
( |
| ) |
const |
◆ dual_values()
| const LinearConstraintMap< double > & operations_research::math_opt::SolveResult::dual_values |
( |
| ) |
const |
◆ FromProto()
◆ has_basis()
| bool operations_research::math_opt::SolveResult::has_basis |
( |
| ) |
const |
◆ has_dual_feasible_solution()
| bool operations_research::math_opt::SolveResult::has_dual_feasible_solution |
( |
| ) |
const |
◆ has_dual_ray()
| bool operations_research::math_opt::SolveResult::has_dual_ray |
( |
| ) |
const |
|
inline |
◆ has_primal_feasible_solution()
| bool operations_research::math_opt::SolveResult::has_primal_feasible_solution |
( |
| ) |
const |
◆ has_ray()
| bool operations_research::math_opt::SolveResult::has_ray |
( |
| ) |
const |
|
inline |
◆ objective_value() [1/2]
| double operations_research::math_opt::SolveResult::objective_value |
( |
| ) |
const |
◆ objective_value() [2/2]
| double operations_research::math_opt::SolveResult::objective_value |
( |
Objective | objective | ) |
const |
◆ primal_bound()
| double operations_research::math_opt::SolveResult::primal_bound |
( |
| ) |
const |
◆ Proto()
| absl::StatusOr< SolveResultProto > operations_research::math_opt::SolveResult::Proto |
( |
| ) |
const |
◆ ray_dual_values()
| const LinearConstraintMap< double > & operations_research::math_opt::SolveResult::ray_dual_values |
( |
| ) |
const |
◆ ray_reduced_costs()
| const VariableMap< double > & operations_research::math_opt::SolveResult::ray_reduced_costs |
( |
| ) |
const |
◆ ray_variable_values()
| const VariableMap< double > & operations_research::math_opt::SolveResult::ray_variable_values |
( |
| ) |
const |
◆ reduced_costs()
| const VariableMap< double > & operations_research::math_opt::SolveResult::reduced_costs |
( |
| ) |
const |
◆ solve_time()
| absl::Duration operations_research::math_opt::SolveResult::solve_time |
( |
| ) |
const |
|
inline |
◆ variable_status()
◆ variable_values()
| const VariableMap< double > & operations_research::math_opt::SolveResult::variable_values |
( |
| ) |
const |
◆ dual_rays
| std::vector<DualRay> operations_research::math_opt::SolveResult::dual_rays |
◆ gscip_solver_specific_output
| GScipOutput operations_research::math_opt::SolveResult::gscip_solver_specific_output |
◆ pdlp_solver_specific_output
◆ primal_rays
| * All convex optimization solvers (LP, convex QP) return only one * Only MI(Q)P solvers return more than one solution. MIP solvers do not std std::vector<PrimalRay> operations_research::math_opt::SolveResult::primal_rays |
◆ solve_stats
| SolveStats operations_research::math_opt::SolveResult::solve_stats |
◆ termination
| Termination operations_research::math_opt::SolveResult::termination |
The documentation for this struct was generated from the following files: