This paper considers multi-stage optimization problems under uncertainty that involve distinct offline and online phases. In particular it addresses the issue of integrating these phases to show how two are often interrelated in real-world applications. Our methods applicable (fairly general) conditions: 1) is exogenous; 2) possible define a greedy heuristic for phase can be modeled as p...

This paper is of tutorial nature and describes a one-stage dynamic programming algorithm for the problem of connected word recognition. The algorithm to be developed is essentially identical to one presented by Vintsyuk [ I ] and later by Bridle and Brown [2] ;but the notation and the presentation have been clarified. The derivation used for optimally time synchronizing a test pattern, consisti...

data envelopment analysis is a nonparametric technique checking efficiency of dmus using math programming. in conventional dea, it has been assumed that the status of each measure is clearly known as either input or output. kao and hwang (2008) developed a data envelopment analysis (dea) approach for measuring efficiency of decision processes which can be divided into two stages. the first stag...

data envelopment analysis (dea) is a method for measuring the efficiency of peer decision making units (dmus) which uses a set of inputs to produce a set of outputs. in some cases, dmus have a two-stage structure, in which the first stage utilizes inputs to produce outputs used as the inputs of the second stage to produce final outputs. one important issue in two-stage dea is the sensitivity of...

This article aims to investigate the location of dry ports by providing a two-stage GIS-optimization model. At the first stage, the appropriate points for establishing dry ports were identified using GIS and hierarchical analysis process; then, the suitable points were introduced as the potential points to the second stage model. At the second stage, by providing a multi-objective integer model...