{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001332256,0.0003808011,0.0003504409,0.0001999863,0.0002267803,0.00009107052,0.0002113547,0.0003219914,0.0003003418],"category_scores_gemma":[0.000007453123,0.0003185515,0.00006769696,0.0002014998,0.00009621224,0.0002524532,0.00002888105,0.0003572856,0.00001444956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945918,"about_ca_system_score_gemma":0.0000585729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260589,"about_ca_topic_score_gemma":0.00003588271,"domain_scores_codex":[0.9985579,0.00002777967,0.0006087723,0.0003813373,0.000216431,0.0002077429],"domain_scores_gemma":[0.9988113,0.00005908593,0.0003688271,0.0003789969,0.0002604252,0.0001213524],"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.00002402759,0.00006034154,0.00001802745,0.0003779924,0.0001948926,9.074837e-7,0.002444747,0.9623023,0.0003340048,0.007261127,0.00008755701,0.0268941],"study_design_scores_gemma":[0.0008203773,0.00007907242,0.0000142708,0.0004988898,0.0001315527,0.00002257625,0.0001086194,0.9862375,0.0003585221,0.0001602291,0.01107568,0.0004927333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007930937,0.00067467,0.9059638,0.0001836428,0.0001138587,0.003027752,0.0003471155,0.0006697571,0.08894013],"genre_scores_gemma":[0.0425356,0.006085805,0.8798378,0.0005416883,0.0004102199,0.001036604,0.00463967,0.0009616168,0.06395105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04245629,"threshold_uncertainty_score":0.9999266,"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."}}