{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002244748,0.0002869268,0.0003838532,0.0002823368,0.0002981736,0.0002394548,0.001441546,0.0001401579,0.0003211619],"category_scores_gemma":[0.0003836767,0.0002149419,0.00009517514,0.0004967945,0.0006863655,0.0002068053,0.001264178,0.0007580728,0.00005047193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001890154,"about_ca_system_score_gemma":0.0005077927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002445844,"about_ca_topic_score_gemma":0.00001484536,"domain_scores_codex":[0.9968525,0.00007771779,0.0004971871,0.0008056423,0.001218623,0.0005483351],"domain_scores_gemma":[0.9970404,0.001060621,0.0002197386,0.001107159,0.0004474029,0.0001247111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001993475,0.00003345289,9.753168e-7,0.00005190774,0.00001145797,0.00007058356,0.0003706091,0.005752022,0.000001703611,0.1987827,0.0007130735,0.7942095],"study_design_scores_gemma":[0.0002155341,0.00005058052,0.000002463669,0.0003402594,0.00001112954,0.00005738666,0.00001086456,0.4980275,0.00008139955,0.1675855,0.3331838,0.0004336137],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002247903,0.0001504866,0.978889,0.0004190215,0.0003930554,0.0005899368,0.000005117523,0.0001013492,0.01944977],"genre_scores_gemma":[0.000009519778,0.00005248072,0.9140573,0.0001969704,0.0003871455,0.00002300804,0.000004865779,0.00004715543,0.08522158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7937759,"threshold_uncertainty_score":0.8765076,"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."}}