{"id":"W4211146157","doi":"10.1017/cbo9781107282094.003","title":"Solving linear programs","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Focus (optics); Reading (process); Selection (genetic algorithm); Point (geometry); Section (typography); Computer science; Mathematics education; Range (aeronautics); Linear algebra; Engineering; Mathematics; Artificial intelligence","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.0007979734,0.001411938,0.0007301651,0.0005963225,0.0007626801,0.003059845,0.001261084,0.001095886,0.04450741],"category_scores_gemma":[0.002415884,0.0006094023,0.001012756,0.00134359,0.001164314,0.002505793,0.00192961,0.002896578,0.01515825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009062911,"about_ca_system_score_gemma":0.001285266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007811498,"about_ca_topic_score_gemma":0.001122382,"domain_scores_codex":[0.9990389,0.000236153,0.00004987375,0.0001593425,0.0004459372,0.00006978765],"domain_scores_gemma":[0.999517,0.0003187212,0.00002656733,0.00004917211,0.00007305616,0.00001554671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001634111,0.00005974868,0.0001716225,0.0008658124,0.00003929378,0.0001268831,0.0002890557,0.01928501,0.001454109,0.631979,0.1018693,0.2438439],"study_design_scores_gemma":[0.00001955715,0.00004679389,0.0001673649,0.0003897365,0.00001736611,0.0002945325,0.000124403,0.03510161,0.001610217,0.4207948,0.5414146,0.00001910072],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002644995,0.01005732,0.7166076,0.003104374,0.0006647931,0.0001834165,0.0009252031,0.001733793,0.2640785],"genre_scores_gemma":[0.07660636,0.02708908,0.6093526,0.00193819,0.001244323,0.0008830791,0.003623614,0.001519777,0.277743],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04450741,"threshold_uncertainty_score":0.1488921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02367097219408535,"score_gpt":0.1927129684925532,"score_spread":0.1690419962984678,"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."}}