{"id":"W2985000958","doi":"10.1007/978-3-030-19462-8_6","title":"Methods for Linearly Constrained Problems","year":2019,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Quadratic programming; Nonlinear programming; Quadratically constrained quadratic program; Mathematical optimization; Second-order cone programming; Sequential quadratic programming; Mathematics; Linear programming; Quadratic equation; Differentiable function; Convex optimization; Linear-fractional programming; Optimization problem; Active set method; Regular polygon; Computer science; Nonlinear system","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.002144545,0.001854114,0.001300692,0.001521796,0.0006541447,0.001763298,0.002354895,0.001767947,0.0207783],"category_scores_gemma":[0.008208361,0.00101575,0.001569599,0.002037909,0.001500029,0.00235442,0.003418413,0.003983263,0.006358345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008289957,"about_ca_system_score_gemma":0.0008874544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002077449,"about_ca_topic_score_gemma":0.002536533,"domain_scores_codex":[0.9983585,0.0007487681,0.00008801134,0.0002434448,0.0004935777,0.00006754998],"domain_scores_gemma":[0.9969403,0.002065098,0.0001154764,0.0004274882,0.000378843,0.0000727375],"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.0001006589,0.0001075253,0.0002687305,0.0007753604,0.0001861472,0.00009227108,0.0001597664,0.1200523,0.002723845,0.4204732,0.05270731,0.402353],"study_design_scores_gemma":[0.0000365089,0.00002822446,0.0001457411,0.0001211133,0.00003366467,0.0000853048,0.00002826152,0.6427974,0.00107413,0.3049,0.05072413,0.00002556105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004361485,0.002070222,0.9853241,0.0002949831,0.0003147364,0.00003510373,0.0001057964,0.0002496437,0.01116915],"genre_scores_gemma":[0.03921539,0.003919589,0.8813864,0.0007312166,0.001069406,0.0006980349,0.0008220169,0.001299744,0.07085816],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0207783,"threshold_uncertainty_score":0.06951034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.10434789328692,"score_gpt":0.4908927643642119,"score_spread":0.386544871077292,"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."}}