Nir Halman

Nir Halman

Auto-generated profile, based on publicly available information

Nir Halman

Faculty of Engineering, Bar-Ilan University, Ramat-Gan, Israel

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 April 2012 in Operations Research
Verified
Journal Article
Open access
NHNir Halman
Nir Halman
JOJames B. Orlin
James B. Orlin
DSDavid Simchi-Levi
David Simchi-Levi
The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review and finite time horizon. A closely related problem is the single-period newsvendor model. It is well known that the newsvendor problem admits a closed formula for the optimal order quantity whenever the revenue and salvage values are linear increasing functions and the procurement (ordering) cost is fixed plus linear. The optimal policy for the single-item lot-sizing model is also well known under similar assumptions. In this paper we show that the classical (single-period) newsvendor model with fixed plus linear ordering cost cannot be approximated to any degree of accuracy when either the demand distribution or the cost functions are given by an oracle. We provide a fully polynomial time approximation scheme for the nonlinear single-item stochastic lot-sizing problem, when demand distribution is given by an oracle, procurement costs are provided as nondecreasing oracles, holding/backlogging/disposal costs are linear, and lead time is positive. Similar results exist for the nonlinear newsvendor problem. These approximation schemes are designed by extending the technique of K-approximation sets and functions.

11 December 2018 in OR Spectrum
Verified
Journal Article
Closed access
PDF file
NHNir Halman
Nir Halman
MKMikhail Y. Kovalyov
Mikhail Y. Kovalyov
AQAlain Quilliot
Alain Quilliot
DSDvir Shabtay
Dvir Shabtay
MZMoshe Zofi
Moshe Zofi

1 January 2019 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
NHNir Halman
Nir Halman
GNGiacomo Nannicini
Giacomo Nannicini
We propose a fully polynomial-time approximation scheme (FPTAS) for stochastic dynamic programs with multidimensional action, scalar state, convex costs, and linear state transition function. The action spaces are polyhedral and described by parametric linear programs. This type of problem finds applications in the area of optimal planning under uncertainty, and can be thought of as the problem of optimally managing a single nondiscrete resource over a finite time horizon. We show that under a value oracle model for the cost functions this result for one-dimensional state space is the “best possible,” because a similar dynamic programming model with two-dimensional state space does not admit a polynomial-time approximation scheme. The FPTAS relies on the solution of polynomial-sized linear programs to recursively compute an approximation of the value function at each stage. Our paper enlarges the class of dynamic programs that admit an FPTAS by showing, under suitable conditions, how to deal with multidim...

18 September 2007 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
NHNir Halman
Nir Halman

23 March 2018 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
FDFabián Díaz-Núñez
Fabián Díaz-Núñez
NHNir Halman
Nir Halman
ÓVÓscar C. Vásquez
Óscar C. Vásquez