Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
ortools.math_opt.result_pb2 Namespace Reference

Variables

 _sym_db = _symbol_database.Default()
 
 DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n\x1dortools/math_opt/result.proto\x12\x1coperations_research.math_opt\x1a\x1egoogle/protobuf/duration.proto\x1a\x1cortools/pdlp/solve_log.proto\x1a\x19ortools/gscip/gscip.proto\x1a\x1fortools/math_opt/solution.proto\x1a#ortools/math_opt/solvers/osqp.proto\"\xcf\x01\n\x12ProblemStatusProto\x12K\n\rprimal_status\x18\x01 \x01(\x0e\x32\x34.operations_research.math_opt.FeasibilityStatusProto\x12I\n\x0b\x64ual_status\x18\x02 \x01(\x0e\x32\x34.operations_research.math_opt.FeasibilityStatusProto\x12!\n\x19primal_or_dual_infeasible\x18\x03 \x01(\x08\"\xb6\x02\n\x0fSolveStatsProto\x12-\n\nsolve_time\x18\x01 \x01(\x0b\x32\x19.google.protobuf.Duration\x12\x1d\n\x11\x62\x65st_primal_bound\x18\x02 \x01(\x01\x42\x02\x18\x01\x12\x1b\n\x0f\x62\x65st_dual_bound\x18\x03 \x01(\x01\x42\x02\x18\x01\x12L\n\x0eproblem_status\x18\x04 \x01(\x0b\x32\x30.operations_research.math_opt.ProblemStatusProtoB\x02\x18\x01\x12\x1a\n\x12simplex_iterations\x18\x05 \x01(\x03\x12\x1a\n\x12\x62\x61rrier_iterations\x18\x06 \x01(\x03\x12\x1e\n\x16\x66irst_order_iterations\x18\x08 \x01(\x03\x12\x12\n\nnode_count\x18\x07 \x01(\x03\"@\n\x14ObjectiveBoundsProto\x12\x14\n\x0cprimal_bound\x18\x02 \x01(\x01\x12\x12\n\ndual_bound\x18\x03 \x01(\x01\"\xb9\x02\n\x10TerminationProto\x12\x44\n\x06reason\x18\x01 \x01(\x0e\x32\x34.operations_research.math_opt.TerminationReasonProto\x12\x37\n\x05limit\x18\x02 \x01(\x0e\x32(.operations_research.math_opt.LimitProto\x12\x0e\n\x06\x64\x65tail\x18\x03 \x01(\t\x12H\n\x0eproblem_status\x18\x04 \x01(\x0b\x32\x30.operations_research.math_opt.ProblemStatusProto\x12L\n\x10objective_bounds\x18\x05 \x01(\x0b\x32\x32.operations_research.math_opt.ObjectiveBoundsProto\"\xab\x05\n\x10SolveResultProto\x12\x43\n\x0btermination\x18\x02 \x01(\x0b\x32..operations_research.math_opt.TerminationProto\x12>\n\tsolutions\x18\x03 \x03(\x0b\x32+.operations_research.math_opt.SolutionProto\x12\x41\n\x0bprimal_rays\x18\x04 \x03(\x0b\x32,.operations_research.math_opt.PrimalRayProto\x12=\n\tdual_rays\x18\x05 \x03(\x0b\x32*.operations_research.math_opt.DualRayProto\x12\x42\n\x0bsolve_stats\x18\x06 \x01(\x0b\x32-.operations_research.math_opt.SolveStatsProto\x12\x38\n\x0cgscip_output\x18\x07 \x01(\x0b\x32 .operations_research.GScipOutputH\x00\x12?\n\x0bosqp_output\x18\x08 \x01(\x0b\x32(.operations_research.math_opt.OsqpOutputH\x00\x12P\n\x0bpdlp_output\x18\t \x01(\x0b\x32\x39.operations_research.math_opt.SolveResultProto.PdlpOutputH\x00\x1a_\n\nPdlpOutput\x12Q\n\x17\x63onvergence_information\x18\x01 \x01(\x0b\x32\x30.operations_research.pdlp.ConvergenceInformationB\x18\n\x16solver_specific_outputJ\x04\x08\x01\x10\x02*\xa5\x01\n\x16\x46\x65\x61sibilityStatusProto\x12\"\n\x1e\x46\x45\x41SIBILITY_STATUS_UNSPECIFIED\x10\x00\x12#\n\x1f\x46\x45\x41SIBILITY_STATUS_UNDETERMINED\x10\x01\x12\x1f\n\x1b\x46\x45\x41SIBILITY_STATUS_FEASIBLE\x10\x02\x12!\n\x1d\x46\x45\x41SIBILITY_STATUS_INFEASIBLE\x10\x03*\x8a\x03\n\x16TerminationReasonProto\x12\"\n\x1eTERMINATION_REASON_UNSPECIFIED\x10\x00\x12\x1e\n\x1aTERMINATION_REASON_OPTIMAL\x10\x01\x12!\n\x1dTERMINATION_REASON_INFEASIBLE\x10\x02\x12 \n\x1cTERMINATION_REASON_UNBOUNDED\x10\x03\x12.\n*TERMINATION_REASON_INFEASIBLE_OR_UNBOUNDED\x10\x04\x12 \n\x1cTERMINATION_REASON_IMPRECISE\x10\x05\x12\x1f\n\x1bTERMINATION_REASON_FEASIBLE\x10\t\x12(\n$TERMINATION_REASON_NO_SOLUTION_FOUND\x10\x06\x12&\n\"TERMINATION_REASON_NUMERICAL_ERROR\x10\x07\x12\"\n\x1eTERMINATION_REASON_OTHER_ERROR\x10\x08*\x8e\x02\n\nLimitProto\x12\x15\n\x11LIMIT_UNSPECIFIED\x10\x00\x12\x16\n\x12LIMIT_UNDETERMINED\x10\x01\x12\x13\n\x0fLIMIT_ITERATION\x10\x02\x12\x0e\n\nLIMIT_TIME\x10\x03\x12\x0e\n\nLIMIT_NODE\x10\x04\x12\x12\n\x0eLIMIT_SOLUTION\x10\x05\x12\x10\n\x0cLIMIT_MEMORY\x10\x06\x12\x10\n\x0cLIMIT_CUTOFF\x10\x0c\x12\x13\n\x0fLIMIT_OBJECTIVE\x10\x07\x12\x0e\n\nLIMIT_NORM\x10\x08\x12\x15\n\x11LIMIT_INTERRUPTED\x10\t\x12\x17\n\x13LIMIT_SLOW_PROGRESS\x10\n\x12\x0f\n\x0bLIMIT_OTHER\x10\x0b\x42\x1e\n\x1a\x63om.google.ortools.mathoptP\x01\x62\x06proto3')
 
 _globals = globals()
 
 _loaded_options
 
 _serialized_options
 
 _serialized_start
 
 _serialized_end
 

Detailed Description

Generated protocol buffer code.

Variable Documentation

◆ _globals

ortools.math_opt.result_pb2._globals = globals()
protected

Definition at line 24 of file result_pb2.py.

◆ _loaded_options

ortools.math_opt.result_pb2._loaded_options
protected

Definition at line 28 of file result_pb2.py.

◆ _serialized_end

ortools.math_opt.result_pb2._serialized_end
protected

Definition at line 37 of file result_pb2.py.

◆ _serialized_options

ortools.math_opt.result_pb2._serialized_options
protected

Definition at line 29 of file result_pb2.py.

◆ _serialized_start

ortools.math_opt.result_pb2._serialized_start
protected

Definition at line 36 of file result_pb2.py.

◆ _sym_db

ortools.math_opt.result_pb2._sym_db = _symbol_database.Default()
protected

Definition at line 12 of file result_pb2.py.

◆ DESCRIPTOR

ortools.math_opt.result_pb2.DESCRIPTOR = _descriptor_pool.Default().AddSerializedFile(b'\n\x1dortools/math_opt/result.proto\x12\x1coperations_research.math_opt\x1a\x1egoogle/protobuf/duration.proto\x1a\x1cortools/pdlp/solve_log.proto\x1a\x19ortools/gscip/gscip.proto\x1a\x1fortools/math_opt/solution.proto\x1a#ortools/math_opt/solvers/osqp.proto\"\xcf\x01\n\x12ProblemStatusProto\x12K\n\rprimal_status\x18\x01 \x01(\x0e\x32\x34.operations_research.math_opt.FeasibilityStatusProto\x12I\n\x0b\x64ual_status\x18\x02 \x01(\x0e\x32\x34.operations_research.math_opt.FeasibilityStatusProto\x12!\n\x19primal_or_dual_infeasible\x18\x03 \x01(\x08\"\xb6\x02\n\x0fSolveStatsProto\x12-\n\nsolve_time\x18\x01 \x01(\x0b\x32\x19.google.protobuf.Duration\x12\x1d\n\x11\x62\x65st_primal_bound\x18\x02 \x01(\x01\x42\x02\x18\x01\x12\x1b\n\x0f\x62\x65st_dual_bound\x18\x03 \x01(\x01\x42\x02\x18\x01\x12L\n\x0eproblem_status\x18\x04 \x01(\x0b\x32\x30.operations_research.math_opt.ProblemStatusProtoB\x02\x18\x01\x12\x1a\n\x12simplex_iterations\x18\x05 \x01(\x03\x12\x1a\n\x12\x62\x61rrier_iterations\x18\x06 \x01(\x03\x12\x1e\n\x16\x66irst_order_iterations\x18\x08 \x01(\x03\x12\x12\n\nnode_count\x18\x07 \x01(\x03\"@\n\x14ObjectiveBoundsProto\x12\x14\n\x0cprimal_bound\x18\x02 \x01(\x01\x12\x12\n\ndual_bound\x18\x03 \x01(\x01\"\xb9\x02\n\x10TerminationProto\x12\x44\n\x06reason\x18\x01 \x01(\x0e\x32\x34.operations_research.math_opt.TerminationReasonProto\x12\x37\n\x05limit\x18\x02 \x01(\x0e\x32(.operations_research.math_opt.LimitProto\x12\x0e\n\x06\x64\x65tail\x18\x03 \x01(\t\x12H\n\x0eproblem_status\x18\x04 \x01(\x0b\x32\x30.operations_research.math_opt.ProblemStatusProto\x12L\n\x10objective_bounds\x18\x05 \x01(\x0b\x32\x32.operations_research.math_opt.ObjectiveBoundsProto\"\xab\x05\n\x10SolveResultProto\x12\x43\n\x0btermination\x18\x02 \x01(\x0b\x32..operations_research.math_opt.TerminationProto\x12>\n\tsolutions\x18\x03 \x03(\x0b\x32+.operations_research.math_opt.SolutionProto\x12\x41\n\x0bprimal_rays\x18\x04 \x03(\x0b\x32,.operations_research.math_opt.PrimalRayProto\x12=\n\tdual_rays\x18\x05 \x03(\x0b\x32*.operations_research.math_opt.DualRayProto\x12\x42\n\x0bsolve_stats\x18\x06 \x01(\x0b\x32-.operations_research.math_opt.SolveStatsProto\x12\x38\n\x0cgscip_output\x18\x07 \x01(\x0b\x32 .operations_research.GScipOutputH\x00\x12?\n\x0bosqp_output\x18\x08 \x01(\x0b\x32(.operations_research.math_opt.OsqpOutputH\x00\x12P\n\x0bpdlp_output\x18\t \x01(\x0b\x32\x39.operations_research.math_opt.SolveResultProto.PdlpOutputH\x00\x1a_\n\nPdlpOutput\x12Q\n\x17\x63onvergence_information\x18\x01 \x01(\x0b\x32\x30.operations_research.pdlp.ConvergenceInformationB\x18\n\x16solver_specific_outputJ\x04\x08\x01\x10\x02*\xa5\x01\n\x16\x46\x65\x61sibilityStatusProto\x12\"\n\x1e\x46\x45\x41SIBILITY_STATUS_UNSPECIFIED\x10\x00\x12#\n\x1f\x46\x45\x41SIBILITY_STATUS_UNDETERMINED\x10\x01\x12\x1f\n\x1b\x46\x45\x41SIBILITY_STATUS_FEASIBLE\x10\x02\x12!\n\x1d\x46\x45\x41SIBILITY_STATUS_INFEASIBLE\x10\x03*\x8a\x03\n\x16TerminationReasonProto\x12\"\n\x1eTERMINATION_REASON_UNSPECIFIED\x10\x00\x12\x1e\n\x1aTERMINATION_REASON_OPTIMAL\x10\x01\x12!\n\x1dTERMINATION_REASON_INFEASIBLE\x10\x02\x12 \n\x1cTERMINATION_REASON_UNBOUNDED\x10\x03\x12.\n*TERMINATION_REASON_INFEASIBLE_OR_UNBOUNDED\x10\x04\x12 \n\x1cTERMINATION_REASON_IMPRECISE\x10\x05\x12\x1f\n\x1bTERMINATION_REASON_FEASIBLE\x10\t\x12(\n$TERMINATION_REASON_NO_SOLUTION_FOUND\x10\x06\x12&\n\"TERMINATION_REASON_NUMERICAL_ERROR\x10\x07\x12\"\n\x1eTERMINATION_REASON_OTHER_ERROR\x10\x08*\x8e\x02\n\nLimitProto\x12\x15\n\x11LIMIT_UNSPECIFIED\x10\x00\x12\x16\n\x12LIMIT_UNDETERMINED\x10\x01\x12\x13\n\x0fLIMIT_ITERATION\x10\x02\x12\x0e\n\nLIMIT_TIME\x10\x03\x12\x0e\n\nLIMIT_NODE\x10\x04\x12\x12\n\x0eLIMIT_SOLUTION\x10\x05\x12\x10\n\x0cLIMIT_MEMORY\x10\x06\x12\x10\n\x0cLIMIT_CUTOFF\x10\x0c\x12\x13\n\x0fLIMIT_OBJECTIVE\x10\x07\x12\x0e\n\nLIMIT_NORM\x10\x08\x12\x15\n\x11LIMIT_INTERRUPTED\x10\t\x12\x17\n\x13LIMIT_SLOW_PROGRESS\x10\n\x12\x0f\n\x0bLIMIT_OTHER\x10\x0b\x42\x1e\n\x1a\x63om.google.ortools.mathoptP\x01\x62\x06proto3')

Definition at line 22 of file result_pb2.py.