{"id":"W2072075444","doi":"10.1007/978-1-4757-3145-3_23","title":"A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Subgradient method; Cutting-plane method; Lagrangian relaxation; Mathematical optimization; Mathematics; Heuristics; Relaxation (psychology); Linear programming relaxation; Integer programming; Plane (geometry); Algorithm; Geometry","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.0008865314,0.0009000131,0.001352141,0.0006254361,0.0004584007,0.001194315,0.001528455,0.001396585,0.007133671],"category_scores_gemma":[0.001730092,0.0008884963,0.0009776391,0.001391892,0.0006288299,0.001200516,0.0008846438,0.002120966,0.001110827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008355153,"about_ca_system_score_gemma":0.001681296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003747163,"about_ca_topic_score_gemma":0.003540594,"domain_scores_codex":[0.9995831,0.0001407328,0.00001328142,0.00005644655,0.0001586566,0.00004789926],"domain_scores_gemma":[0.9995468,0.000284269,0.00003286337,0.0000393992,0.00007612429,0.00002042049],"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.00007690126,0.0001155509,0.000105306,0.0001328622,0.00002242783,0.00005711308,0.00006170374,0.8920653,0.001627664,0.03480849,0.006020654,0.06490595],"study_design_scores_gemma":[0.00001796649,0.00002047981,0.0000432823,0.000009833707,0.000004327526,0.00001456323,0.000007947334,0.9931741,0.000262493,0.005296316,0.001144226,0.000004325303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007059705,0.0001931458,0.9777871,0.0001771871,0.00007043594,0.00006516795,0.0001074044,0.000210308,0.01432949],"genre_scores_gemma":[0.1224993,0.0003452363,0.8671155,0.0001050274,0.00006232293,0.0002345719,0.0003569204,0.0002398927,0.009041195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007133671,"threshold_uncertainty_score":0.02386451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01322765246990476,"score_gpt":0.2059457367271104,"score_spread":0.1927180842572057,"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."}}