Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::pdlp::SolverResult Struct Reference

#include <primal_dual_hybrid_gradient.h>

Public Attributes

Eigen::VectorXd primal_solution
 
Eigen::VectorXd dual_solution
 
Eigen::VectorXd reduced_costs
 
SolveLog solve_log
 

Detailed Description

The following table defines the interpretation of the result vectors depending on the value of solve_log.termination_reason: (the TERMINATION_REASON_ prefix is omitted for brevity):

  • OPTIMAL: the vectors satisfy the termination criteria for optimality.
  • PRIMAL_INFEASIBLE: dual_solution and reduced_costs provide an approximate certificate of primal infeasibility; see https://developers.google.com/optimization/lp/pdlp_math#infeasibility_identification for more information.
  • DUAL_INFEASIBLE: primal_solution provides an approximate certificate of dual infeasibility; see https://developers.google.com/optimization/lp/pdlp_math#infeasibility_identification for more information.
  • PRIMAL_OR_DUAL_INFEASIBLE: the problem was shown to be primal and/or dual infeasible but no certificate of infeasibility is available. The primal_solution and dual_solution have no meaning. This status is only used when presolve is enabled.
  • TIME_LIMIT, ITERATION_LIMIT, KKT_MATRIX_PASS_LIMIT, NUMERICAL_ERROR, INTERRUPTED_BY_USER: the vectors contain an iterate at the time that the respective event occurred. Their values may or may not be meaningful. In some cases solution quality information is available; see documentation for solve_log.solution_type.
  • INVALID_PROBLEM, INVALID_PARAMETER, OTHER: the solution vectors are meaningless and may not have lengths consistent with the input problem.

Definition at line 60 of file primal_dual_hybrid_gradient.h.

Member Data Documentation

◆ dual_solution

Eigen::VectorXd operations_research::pdlp::SolverResult::dual_solution

See https://developers.google.com/optimization/lp/pdlp_math for the interpretation of dual_solution and reduced_costs.

Definition at line 64 of file primal_dual_hybrid_gradient.h.

◆ primal_solution

Eigen::VectorXd operations_research::pdlp::SolverResult::primal_solution

Definition at line 61 of file primal_dual_hybrid_gradient.h.

◆ reduced_costs

Eigen::VectorXd operations_research::pdlp::SolverResult::reduced_costs
Note
The definition of reduced_costs changed in OR-tools version 9.8. See https://developers.google.com/optimization/lp/pdlp_math#reduced_costs_dual_residuals_and_the_corrected_dual_objective for details.

Definition at line 69 of file primal_dual_hybrid_gradient.h.

◆ solve_log

SolveLog operations_research::pdlp::SolverResult::solve_log

Definition at line 70 of file primal_dual_hybrid_gradient.h.


The documentation for this struct was generated from the following file: