Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of British Columbia

$45,000.00

Approximation algortihms for stochastic inventory models

EF 2011-12

Résumé
Stochastic inventory management is one of the fundamental areas of research and practice in operations management and management science. The main research questions of interest in this field are about determining optimal inventory and capacity related decisions in a wide set of instances which are of great significance to the economy. These decisions enable firms to hold the right inventory at the right location at the right time. The importance of such decisions cannot be underestimated as almost 11% of the Canadian GNP is spent on logistical activities that involve moving and storing physical inventory. In today's economic climate with rising fuel prices, making optimal decisions and reducing waste is particularly crucial. Thus, good research in this field often directly helps practitioners cut costs and improve profitability and improve social surplus. Despite its maturity as a research area, as of today, there are large classes of problem settings which pose significant theoretical and practical challenges. In this research, I propose to study a set of inventory problems, for which little is known in terms of the structure or algorithms that compute the near-optimal policies. For these problems, my research will construct approximation algorithms which will result in policies that are relatively easy to implement, that will yield close to optimal performance under a wide set of realistic instances and often offer an understanding of the worst case performance. In this process, important properties of the optimal policy will also be understood. The settings I am particularly interested include multiple sourcing, perishable products, large scale multi stage capacitated systems, multiple products which are partial substitutes of each other and with capacity constraints and settings with random yield.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
299193-2009
Name nom
Nagarajan, Mahesh
Department département
Sauder School of Business
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2009
Award amount
45000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
20
Committee name en
Industrial Engineering
Committee name fr
Génie industriel
Area of application code
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
Research subject code
1600
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Industrial engineering
Research subject fr
Génie industriel
Partie
3
Nb partie
5
Application title
Approximation algortihms for stochastic inventory models
Keyword
NSERC
Application summary
Stochastic inventory management is one of the fundamental areas of research and practice in operations management and management science. The main research questions of interest in this field are about determining optimal inventory and capacity related decisions in a wide set of instances which are of great significance to the economy. These decisions enable firms to hold the right inventory at the right location at the right time. The importance of such decisions cannot be underestimated as almost 11% of the Canadian GNP is spent on logistical activities that involve moving and storing physical inventory. In today's economic climate with rising fuel prices, making optimal decisions and reducing waste is particularly crucial. Thus, good research in this field often directly helps practitioners cut costs and improve profitability and improve social surplus. Despite its maturity as a research area, as of today, there are large classes of problem settings which pose significant theoretical and practical challenges. In this research, I propose to study a set of inventory problems, for which little is known in terms of the structure or algorithms that compute the near-optimal policies. For these problems, my research will construct approximation algorithms which will result in policies that are relatively easy to implement, that will yield close to optimal performance under a wide set of realistic instances and often offer an understanding of the worst case performance. In this process, important properties of the optimal policy will also be understood. The settings I am particularly interested include multiple sourcing, perishable products, large scale multi stage capacitated systems, multiple products which are partial substitutes of each other and with capacity constraints and settings with random yield.