A Robust Pricing/Lot-sizing Model and A Solution Method Based on Geometric Programming
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임성묵 | - |
dc.date.accessioned | 2021-09-09T13:23:44Z | - |
dc.date.available | 2021-09-09T13:23:44Z | - |
dc.date.created | 2021-06-17 | - |
dc.date.issued | 2008 | - |
dc.identifier.issn | 2287-2043 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/124583 | - |
dc.description.abstract | The pricing/lot-sizing problem of determining the robust optimal order quantity and selling price is discussed. The uncertainty of parameters characterized by an ellipsoid is explicitly incorporated into the problem. An approximation scheme is proposed to transform the problem into a geometric pro-gram, which can be efficiently and reliably solved using interior-point methods. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | 한국경영과학회 | - |
dc.title | A Robust Pricing/Lot-sizing Model and A Solution Method Based on Geometric Programming | - |
dc.title.alternative | A Robust Pricing/Lot-sizing Model and A Solution Method Based on Geometric Programming | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 임성묵 | - |
dc.identifier.bibliographicCitation | MSFE, v.14, no.2, pp.13 - 23 | - |
dc.relation.isPartOf | MSFE | - |
dc.citation.title | MSFE | - |
dc.citation.volume | 14 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 13 | - |
dc.citation.endPage | 23 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001293194 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Robust Optimization | - |
dc.subject.keywordAuthor | Pricing/Lot-sizing Model | - |
dc.subject.keywordAuthor | Geometric Programming | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.