Çok aileli dinamik parti büyüklüğü belirleme problemleri ve çözüm önerileri

Basit Öğe Kaydı
dc.contributor.advisorMercan, H. Murat
dc.contributor.authorBilgen, Rafet
dc.date.accessioned2021-01-16T18:54:51Z
dc.date.available2021-01-16T18:54:51Z
dc.date.issued1996
dc.departmentKKÜ, Sosyal Bilimler Enstitüsü, Sayısal Yöntemler Anabilim Dalı
dc.description.abstractABSTRACT In this dissertation a Lagrangean relaxation algorithm for Multi-Family Capacitated Dynamic Lot Sizing Problem with Coordinated Replenishments (MFCDLC) was developed. Furthermore, the dissertation includes the surveys about the dynamic lot sizing problems and the solution algorithms developed for them. As MFCDLC has the capacity constraints which have nonlinear structure, there are some difficulties in solving this problem. A Lagrangean problem, therefore, was created by dualizing the capacity constraints which are the side constraints. Using the subgradient optimization the Lagrangean multipliers were updated and the Lagrangean dual was solved. The Lagrangean relaxation algorithm was tested over randomly generated 10 problems. Computational experience shows that the foregoing algorithm is very efficient and provides near-optimal solutions to the problem.en_US
dc.identifier.endpage100en_US
dc.identifier.startpage1en_US
dc.identifier.uri
dc.identifier.urihttps://hdl.handle.net/20.500.12587/14299
dc.identifier.yoktezid61150
dc.language.isotr
dc.publisherKırıkkale Üniversitesien_US
dc.relation.publicationcategoryTezen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectİstatistiken_US
dc.subjectStatisticsen_US
dc.subjectDergileren_US
dc.subjecten_US
dc.subjecten_US
dc.titleÇok aileli dinamik parti büyüklüğü belirleme problemleri ve çözüm önerilerien_US
dc.title.alternativeMulti-family capacitated dynamic lot sizing with coordinated replenishmentsen_US
dc.typeMaster Thesisen_US

Dosyalar

Koleksiyon

Sosyal Bilimler Enstitüsü Tez Koleksiyonu