{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192043,0.001084679,0.001318489,0.0006258431,0.0004585889,0.001084581,0.00111995,0.0007549936,0.004133264],"category_scores_gemma":[0.001401831,0.0006149782,0.0006055846,0.001263462,0.0005983149,0.001155757,0.001167162,0.001844317,0.001140869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000888322,"about_ca_system_score_gemma":0.001203749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003206668,"about_ca_topic_score_gemma":0.002785248,"domain_scores_codex":[0.9995956,0.0001230098,0.00001623738,0.00006821994,0.0001563312,0.00004061903],"domain_scores_gemma":[0.9997376,0.0001285076,0.0000282153,0.00002829204,0.0000571681,0.00002021703],"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.0001155968,0.00006662058,0.0001322458,0.00008749573,0.00004153267,0.00006212938,0.00007674121,0.7095805,0.00250129,0.06694547,0.003736975,0.2166534],"study_design_scores_gemma":[0.00001471096,0.00001209992,0.00002156175,0.000003699034,0.000003093593,0.00001370494,0.000003229206,0.9898127,0.0002805299,0.008112492,0.001718218,0.00000394413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001569197,0.00007392667,0.9969785,0.00005368814,0.00001639479,0.0000171642,0.00001472039,0.000178495,0.001097919],"genre_scores_gemma":[0.1176944,0.0003550939,0.873807,0.0000653776,0.00005235643,0.000302349,0.000175763,0.0002513471,0.007296409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004133264,"threshold_uncertainty_score":0.01382709,"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."}}