We investigate sample average approximation (SAA) for two-stage stochastic programs without relatively complete recourse, i.e., problems in which there are first-stage feasible solutions that not guaranteed to have a recourse action. As feasibility measure of the SAA solution, we consider "recourse likelihood", is probability solution has For $\epsilon \in (0,1)$, demonstrate likelihood below $...

This study proposes a new approach for single-sampling plan by determining sample size and acceptance number. The proposed approach is based on a two-step methodology. In the first step: quality management step, different single sampling inspection plans were generated by running an optimization model for different possible acceptance numbers. While, in the second step: Multi-Attribute Decision...

Abstract Computing a sample mean of time series under dynamic warping is NP-hard. Consequently, there an ongoing research effort to devise efficient heuristics. The majority heuristics have been developed for the constrained problem that assumes solution predefined length. In contrast, on unconstrained underdeveloped. this article, we propose generic average-compress (AC) algorithm address prob...