{"id":"W3205964799","doi":"10.1007/978-1-0716-0843-2_11","title":"Linear Programming Part I: The Simplex Method","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Maxima and minima; Simplex algorithm; Linear programming; Mathematical optimization; Simplex; Range (aeronautics); Linear-fractional programming; Computation; Computer science; Revised simplex method; Function (biology); Mathematics; Algorithm; Combinatorics; Engineering","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.0005480227,0.001360848,0.001276518,0.0008830652,0.0005582708,0.002721861,0.001053774,0.001035089,0.0466163],"category_scores_gemma":[0.001458277,0.0005967683,0.0008432231,0.002812547,0.001439348,0.001867391,0.001117994,0.003886112,0.02762916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009196163,"about_ca_system_score_gemma":0.001282062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001213191,"about_ca_topic_score_gemma":0.00126813,"domain_scores_codex":[0.999378,0.000163309,0.00002344968,0.00009793063,0.0003023206,0.00003492936],"domain_scores_gemma":[0.9996132,0.0002055539,0.00002103078,0.00005309269,0.00008545855,0.00002180113],"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.0000258283,0.00006410109,0.00009533772,0.0007568555,0.00003720055,0.00004294623,0.00009881359,0.0226233,0.001600447,0.5108364,0.1927039,0.2711149],"study_design_scores_gemma":[0.00001044817,0.00003189308,0.0002575312,0.0003444993,0.00001632673,0.0001590204,0.00005844179,0.02632092,0.001447174,0.4214076,0.5499165,0.00002963833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001013696,0.04042063,0.485368,0.002074162,0.002857463,0.00009391917,0.0008843233,0.0008124969,0.4664753],"genre_scores_gemma":[0.0434703,0.06855138,0.2946495,0.002401947,0.004170273,0.0006357943,0.001620014,0.003069066,0.5814317],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0466163,"threshold_uncertainty_score":0.155947,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1179781230737881,"score_gpt":0.4203340627107622,"score_spread":0.3023559396369741,"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."}}