D-optimal regression designs under random block-e ects models are considered. In addition to selecting design points, an experimenter also needs to specify how they are grouped into blocks. We rst consider minimum-support designs, which are supported on the minimum number of design points. In this case, it is shown that a D-optimal design can be obtained by combining a D-optimal block design (f...

This paper studies the properties of discrete time stochastic optimal control problems associated with portfolio selection. We investigate if optimal continuous time strategies can be used effectively for a discrete time market after a straightforward discretization. We found that Merton’s strategy approximates the performance of the optimal strategy in a discrete time model with the sufficient...

In this research we used forward-backward sweep method(FBSM) in order to solve optimal control problems. In this paper, one hybrid method based on ERK method of order 4 and 5 are proposed for the numerical approximation of the OCP. The convergence of the new method has been proved .This method indicate more accurate numerical results compared with those of ERK method of order 4 and 5 for solvin...

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

This paper presents a segmented optimal multi-degree reduction approximation method for Bézier curve based on the combination of optimal function approximation and segmentation algorithm. In the proposed method, each Bernstein basis function is optimally approximated by the linear combination of lower power S bases. The piecewise curve of Bernstein basis function is replaced by the obtained opt...

We consider a GI/GI/1 queue with impatient customers in heavy traffic. We use the solution of an approximating singular diffusion control problem to construct an admission control policy for the queue. The approximating control problem does not admit a so-called pathwise solution. Hence, the resulting admission control policy depends on second-moment data. We prove asymptotic optimality of the ...

5

in recent decades, issuing of catastrophe bonds for covering the catastrophe losses such as earthquakes, floods, etc. are getting more widespread. the purpose of this paper is determination of the optimal interest rates for investors of these securities, so that it becomes attractive for them. this paper uses fire insurance data in the period of 1328 to 1388 and considers the peaks over thresho...