{"id":"W2081059316","doi":"10.2298/yjor0202157h","title":"A separable approximation dynamic programming algorithm for economic dispatch with transmission losses","year":2002,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Lagrange multiplier; Economic dispatch; Mathematical optimization; Separable space; Convergence (economics); Quadratic equation; Quadratic programming; Dynamic programming; Multiplier (economics); Mathematics; Transmission (telecommunications); Stability (learning theory); Iterative method; Computer science; Algorithm; Electric power 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008118919,0.000121198,0.0002003894,0.0004263858,0.0002688336,0.0002530985,0.0001919762,0.0000730751,0.0001011071],"category_scores_gemma":[0.00002711765,0.00009917255,0.00005919501,0.0003310042,0.00003515539,0.0006625919,0.000006711613,0.0002880253,0.00002118939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003877919,"about_ca_system_score_gemma":0.00009716332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493097,"about_ca_topic_score_gemma":0.00003773367,"domain_scores_codex":[0.9986541,0.00008785616,0.0004410924,0.0001304588,0.0003468714,0.0003396039],"domain_scores_gemma":[0.9991988,0.0001059734,0.00004013321,0.0001457376,0.0003975799,0.0001117768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001621241,0.00008815315,0.00003544415,0.00009487592,0.00008564202,0.000006905625,0.0007537541,0.7798139,0.001014143,0.00006788078,0.001126914,0.2168962],"study_design_scores_gemma":[0.0006910196,0.0003852186,0.00001637344,0.0001011175,0.00001669331,0.0001322815,0.0001194251,0.9935906,0.001486784,0.00002063473,0.00332579,0.0001140782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02026873,0.001360039,0.9768718,0.0002335679,0.00009620444,0.0007492017,0.000009628568,0.00004475869,0.0003660259],"genre_scores_gemma":[0.6909832,0.0006999504,0.3072808,0.00000296578,0.0001239809,0.000154836,0.00002280463,0.00006129532,0.0006701472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6707145,"threshold_uncertainty_score":0.4044139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02603753094713742,"score_gpt":0.3059293978766998,"score_spread":0.2798918669295624,"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."}}