{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790794,0.001255241,0.001070735,0.001577361,0.0007754327,0.001997346,0.001405426,0.001312108,0.008535962],"category_scores_gemma":[0.004061374,0.0005865686,0.001435774,0.001047848,0.00236125,0.002377852,0.003383653,0.00479107,0.001305259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132029,"about_ca_system_score_gemma":0.001072571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009501564,"about_ca_topic_score_gemma":0.000892471,"domain_scores_codex":[0.9992078,0.000338901,0.00003142389,0.0001150542,0.0002327707,0.0000740589],"domain_scores_gemma":[0.9989051,0.0006013634,0.00006674096,0.0001145358,0.0002497247,0.00006260377],"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.00001011809,0.0000408834,0.00008999329,0.00006589296,0.00001460519,0.00005349508,0.00005392694,0.03591908,0.001168985,0.9480862,0.001986187,0.01251062],"study_design_scores_gemma":[0.000008681917,0.00003624988,0.0001248813,0.00003366033,0.000010294,0.0001077791,0.00002971381,0.334748,0.001494688,0.6469195,0.01646458,0.00002191761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001139979,0.0001847536,0.9861714,0.0003305556,0.0001130548,0.00002261151,0.00004289065,0.00005499611,0.01193971],"genre_scores_gemma":[0.2814028,0.00290314,0.6650851,0.00107404,0.001449334,0.0005939902,0.0002899342,0.000585438,0.0466163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008535962,"threshold_uncertainty_score":0.02855563,"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."}}