{"id":"W3205360536","doi":"10.1007/978-1-0716-0843-2_12","title":"Linear Programming Part II: Interior-Point Methods","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Interior point method; Polyhedron; Iterated function; Linear programming; Simplex algorithm; Simplex; Vertex (graph theory); Mathematics; Mathematical optimization; Boundary (topology); Algorithm; Computer science; Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002459495,0.0003775405,0.0005913012,0.0005850671,0.0002753855,0.0002113155,0.001264051,0.0001993401,0.000658882],"category_scores_gemma":[0.000527355,0.0003670794,0.0001238968,0.0004846741,0.0008245824,0.0003477176,0.002600875,0.0008410484,0.00004263555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003599809,"about_ca_system_score_gemma":0.0005207467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001698987,"about_ca_topic_score_gemma":0.000006984723,"domain_scores_codex":[0.9965426,0.00008330483,0.000717982,0.001069952,0.0009612585,0.0006249389],"domain_scores_gemma":[0.997412,0.0004821539,0.0002803851,0.001077985,0.0005421164,0.0002053666],"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.000004309441,0.00005574869,0.000001106337,0.0001121373,0.00001609288,0.0001222348,0.000637414,0.001075106,0.00001748161,0.09138044,0.0004637608,0.9061142],"study_design_scores_gemma":[0.0005435785,0.0003002827,0.000002358439,0.00208902,0.00002063506,0.0001406864,0.00001948791,0.545386,0.0008787107,0.1951163,0.2543225,0.001180466],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001214847,0.000202025,0.9746424,0.00017023,0.0008528256,0.0005371056,0.000004187345,0.0001588748,0.02342019],"genre_scores_gemma":[0.000008452094,0.00007067195,0.8979383,0.0001108384,0.0002463243,0.00002428023,0.00000555044,0.00006098091,0.1015346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9049337,"threshold_uncertainty_score":0.9998781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1071997704363108,"score_gpt":0.4330292003760061,"score_spread":0.3258294299396953,"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."}}