Publications by IORA

Ying Cui, Ling Liang, Defeng Sun, Kim-Chuan Toh
The doubly nonnegative (DNN) cone, being the set of all positive semidefinite matrices whose elements are nonnegative, is a popular approximation of the computationally intractable completely positive cone. The major difficulty for implementing a Newton-type method to compute the projection of a given large scale matrix onto the DNN…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Mathematics of Operations Research
Ying Cui, Ling Liang, Defeng Sun, Kim-Chuan Toh
The doubly nonnegative (DNN) cone, being the set of all positive semidefinite matrices whose elements are nonnegative, is a popular approximation of the computationally intractable completely positive cone. The major difficulty for implementing a Newton-type method to compute the projection of a given large scale matrix onto the DNN…
Mathematics of Operations Research
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Ling Liang, Defeng Sun, Kim-Chuan Toh
In this paper, we adopt the augmented Lagrangian method (ALM) to solve convex quadratic second-order cone programming problems (SOCPs). Fruitful results on the efficiency of the ALM have been established in the literature. Recently, it has been shown in [Cui, Sun, and Toh, {\em Math. Program.}, 178 (2019), pp….
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
SIAM J. Optimization
Ling Liang, Defeng Sun, Kim-Chuan Toh
In this paper, we adopt the augmented Lagrangian method (ALM) to solve convex quadratic second-order cone programming problems (SOCPs). Fruitful results on the efficiency of the ALM have been established in the literature. Recently, it has been shown in [Cui, Sun, and Toh, {\em Math. Program.}, 178 (2019), pp….
SIAM J. Optimization
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Meixia Lin, Defeng Sun, Kim-Chuan Toh
Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a unified framework for computing the least squares estimator of a multivariate shape-constrained convex regression function in ℝd. We…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Mathematical Programming Computation
Meixia Lin, Defeng Sun, Kim-Chuan Toh
Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a unified framework for computing the least squares estimator of a multivariate shape-constrained convex regression function in ℝd. We…
Mathematical Programming Computation
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Zhenzhen Yan, Karthik Natarajan, Chung Piaw Teo, Cong Cheng
We develop a data-driven approach for the multi-product pricing problem, using the theory of a represen- tative consumer in discrete choice. We establish a set of mathematical relationships between product prices and demand for each product in the system, including that of the outside option. We provide identification conditions…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Management Science
Zhenzhen Yan, Karthik Natarajan, Chung Piaw Teo, Cong Cheng
We develop a data-driven approach for the multi-product pricing problem, using the theory of a represen- tative consumer in discrete choice. We establish a set of mathematical relationships between product prices and demand for each product in the system, including that of the outside option. We provide identification conditions…
Management Science
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Zheng Wang, Jiuh-Biing Sheu, Chung-Piaw Teo, Guiqin Xue
Intelligent part-to-picker systems are spreading across a broad range of industries as preferred solutions for agile order fulfillment, wherein mobile racks are carried by robots and moved to stations where human pickers can pick items from them. Such systems raise the challenge of designing good work schedules for human…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Production and Operations Management
Zheng Wang, Jiuh-Biing Sheu, Chung-Piaw Teo, Guiqin Xue
Intelligent part-to-picker systems are spreading across a broad range of industries as preferred solutions for agile order fulfillment, wherein mobile racks are carried by robots and moved to stations where human pickers can pick items from them. Such systems raise the challenge of designing good work schedules for human…
Production and Operations Management
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Minglong Zhou, Gar Goei Loke, Chaithanya Bandi, Zi Qiang Glen Liau, Wilson Wang
Problem definition: We consider the intraday scheduling problem in a group of Orthopaedic clinics where the planner schedules appointment times given a sequence of appointments. We consider patient re-entry – where patients may be required to go for an X-ray examination, returning to the same doctor they have seen…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Manufacturing & Service Operations Management.
Minglong Zhou, Gar Goei Loke, Chaithanya Bandi, Zi Qiang Glen Liau, Wilson Wang
Problem definition: We consider the intraday scheduling problem in a group of Orthopaedic clinics where the planner schedules appointment times given a sequence of appointments. We consider patient re-entry – where patients may be required to go for an X-ray examination, returning to the same doctor they have seen…
Manufacturing & Service Operations Management.
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Taozeng Zhu, Jingui Xie, Melvyn Sim.
Many real-world optimization problems have input parameters estimated from data whose inherent imprecision can lead to fragile solutions that may impede desired objectives and/or render constraints infeasible. We propose a joint estimation and robustness optimization (JERO) framework to mitigate estimation uncertainty in optimization problems by seamlessly incorporating both the…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Management Science
Taozeng Zhu, Jingui Xie, Melvyn Sim.
Many real-world optimization problems have input parameters estimated from data whose inherent imprecision can lead to fragile solutions that may impede desired objectives and/or render constraints infeasible. We propose a joint estimation and robustness optimization (JERO) framework to mitigate estimation uncertainty in optimization problems by seamlessly incorporating both the…
Management Science
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Guodong Lyu, Mabel Chou, Chung-Piaw Teo, Zhichao Zheng, Yuanguang Zhong.
A key challenge in the resource allocation problem is to find near-optimal policies to serve different customers with random demands/revenues, using a fixed pool of capacity (properly configured). In this paper, we study the properties of three classes of allocation policies—responsive (with perfect hindsight), adaptive (with information updates), and…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Operations Research
Guodong Lyu, Mabel Chou, Chung-Piaw Teo, Zhichao Zheng, Yuanguang Zhong.
A key challenge in the resource allocation problem is to find near-optimal policies to serve different customers with random demands/revenues, using a fixed pool of capacity (properly configured). In this paper, we study the properties of three classes of allocation policies—responsive (with perfect hindsight), adaptive (with information updates), and…
Operations Research
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Peng Liu, Ying Chen, Chung-Piaw Teo
The limousine service in luxury hotels is an integral component of the whole customer journey in the hospitality industry. One of the largest hotels in Singapore manages a fleet of both in-house and outsourced vehicles around the clock, serving 9000 trips per month on average. The need for vehicles…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
INFORMS Journal on Applied Analytics
Peng Liu, Ying Chen, Chung-Piaw Teo
The limousine service in luxury hotels is an integral component of the whole customer journey in the hospitality industry. One of the largest hotels in Singapore manages a fleet of both in-house and outsourced vehicles around the clock, serving 9000 trips per month on average. The need for vehicles…
INFORMS Journal on Applied Analytics
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Jinjia Huang, Mabel Chou and Chung-Piaw Teo.
Motivated by the Bike Angels Program in New York’s Citi Bike and Boston’s Blue Bikes, we study the use of (registered) volunteers to re-position empty bikes for riders in a bike sharing system. We propose a method that can be used to deploy the volunteers in the system, based…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Proceedings of the AAAI Conference on Artificial Intelligence
Jinjia Huang, Mabel Chou and Chung-Piaw Teo.
Motivated by the Bike Angels Program in New York’s Citi Bike and Boston’s Blue Bikes, we study the use of (registered) volunteers to re-position empty bikes for riders in a bike sharing system. We propose a method that can be used to deploy the volunteers in the system, based…
Proceedings of the AAAI Conference on Artificial Intelligence
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Will Ma, David Simchi-Levi and Chung-Piaw Teo
In this paper we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejecting different fare classes, Ball and Queyranne (2009) have established the tight competitive ratio for this problem using booking limit policies, which raise…
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Operations Research
Will Ma, David Simchi-Levi and Chung-Piaw Teo
In this paper we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejecting different fare classes, Ball and Queyranne (2009) have established the tight competitive ratio for this problem using booking limit policies, which raise…
Operations Research
This research is supported by the Ministry of Education, Singapore, under its 2019 Academic Research Fund Tier 3 grant call (Award ref: MOE-2019-T3-1-010)
Xudong Li, Defeng Sun, Kim Chuan Toh
We develop a fast and robust algorithm for solving large-scale convex composite optimization models with an emphasis on the 1-regularized least squares regression (lasso) problems. Despite the fact that there exists a large number of solvers in the literature for the lasso problems, we found that no solver can…
SIAM Journal on Optimization
Xudong Li, Defeng Sun, Kim Chuan Toh
We develop a fast and robust algorithm for solving large-scale convex composite optimization models with an emphasis on the 1-regularized least squares regression (lasso) problems. Despite the fact that there exists a large number of solvers in the literature for the lasso problems, we found that no solver can…
SIAM Journal on Optimization