Back to search

University of British Columbia

On properties of the order-based cost function in assemble-to-order systems

Abstract

dc:description

One of the main results of "Order-Based Cost Optimization in Assemble-to-Order Systems" [1] by Y. Lu and J-S. Song, Operations Research, 53, 151-169 (2005) is Proposition 1 (c), which states that the cost function of an assemble-to-order inventory system satisfies a discrete convexity property called L♮-convexity. Based on this result, Lu and Song proposed two types of L♮-convex minimization algorithms for finding the optimum policy. We construct a simple assemble-to-order system for which the cost function fails to satisfy L♮-convexity. Using a similar system, we further show that the cost function may not enjoy a more general notion of discrete convexity property called D-convexity. Yet, because of some other properties of the cost function, one can still solve the cost optimization problem using other methods from the literature.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Business - MScB
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Business Administration
Grantor dc:publisher
University of British Columbia
Year dc:date
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Bolandnazar, Mohammadreza

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/45386

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Bolandnazar, Mohammadreza. On properties of the order-based cost function in assemble-to-order systems. master's thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/45386