{"id":"W2181811163","doi":"","title":"An elementary approach to linear programming duality with application to capacity constrained transport","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Duality (order theory); Duality gap; Strong duality; Mathematics; Perturbation function; Linear programming; Mathematical optimization; Weak duality; Dual (grammatical number); Dimension (graph theory); Relation (database); Quadratic programming; Applied mathematics; Optimization problem; Computer science; Pure mathematics; Convex 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":[],"consensus_categories":[],"category_scores_codex":[0.0004191731,0.00009274363,0.0001144423,0.00008073018,0.0000990293,0.00005407966,0.0003216392,0.00002381439,0.00001546282],"category_scores_gemma":[0.000005973922,0.00007353174,0.00002665676,0.0006360605,0.00001520703,0.0002484955,0.00001751894,0.00003990818,0.00001657816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002164456,"about_ca_system_score_gemma":0.00002733235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002321367,"about_ca_topic_score_gemma":0.0001250543,"domain_scores_codex":[0.9989733,0.00004631468,0.0001852072,0.0003904683,0.0002574835,0.0001472141],"domain_scores_gemma":[0.9992341,0.00001338393,0.00004038492,0.00036219,0.0001427734,0.0002071318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002801823,0.0008953859,0.01812172,0.00002416937,0.00007453962,2.782568e-7,0.002096866,0.2197958,0.0008258705,0.6988236,0.00007921964,0.05923448],"study_design_scores_gemma":[0.0002374843,0.0001507868,0.009222377,0.000002021854,0.00001547826,0.000001906753,0.00007010053,0.9855149,0.0003799082,0.0001543524,0.004051278,0.0001994254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01192189,1.38076e-7,0.9833679,0.001520728,0.000009283525,0.0003578674,0.000003271606,0.0001620326,0.002656876],"genre_scores_gemma":[0.4914459,3.759925e-8,0.5072137,0.001199866,0.00002133489,0.00004474549,0.0000382858,0.000002456283,0.00003370626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7657191,"threshold_uncertainty_score":0.2998537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01502406048765886,"score_gpt":0.2459886651019219,"score_spread":0.230964604614263,"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."}}