{"id":"W2613057276","doi":"","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"RWTH Publications (RWTH Aachen)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Discrete mathematics; Combinatorics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575945,0.002235309,0.001195612,0.002508494,0.0007474002,0.00271358,0.001191187,0.0009745093,0.01837937],"category_scores_gemma":[0.003585433,0.0009872768,0.002103878,0.003091787,0.001691551,0.004339956,0.002265244,0.007072952,0.003836662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618379,"about_ca_system_score_gemma":0.0009109491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001367442,"about_ca_topic_score_gemma":0.001282214,"domain_scores_codex":[0.9992411,0.0002433484,0.00003179743,0.0001323937,0.0002380947,0.0001132407],"domain_scores_gemma":[0.9986448,0.0008611773,0.00007284332,0.0001507691,0.000186155,0.00008425501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004818401,0.00006087278,0.0001260204,0.0002357327,0.0000448343,0.00004998852,0.0001463356,0.005667246,0.0009444722,0.9235285,0.01853584,0.05061197],"study_design_scores_gemma":[0.00002286631,0.00002417072,0.0001907403,0.000063819,0.00002791949,0.0000727477,0.00002628405,0.02167396,0.0004254875,0.9627796,0.01468281,0.000009517727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01169251,0.009652178,0.8232784,0.00300184,0.0007376539,0.00009877756,0.0008544993,0.000598816,0.1500853],"genre_scores_gemma":[0.3795598,0.02231287,0.4311323,0.002516619,0.003000229,0.001387179,0.003852683,0.001764347,0.1544739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01837937,"threshold_uncertainty_score":0.06148511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08614434952072335,"score_gpt":0.4250723901138148,"score_spread":0.3389280405930914,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}