And then it states three kinds of optimization algorithms in details, i.e. stochastic goal programming, DDDP algorithm and stochastic dynamic programming.

Using the Enrique Ballestero'scheme of Stochastic Goal Programming with Arrow-Pratt Absolute Risk Function,we propose two stochastic goal programming models with fraction form for the financial problem by the exponential utility function and hyperbolic absolute risk aversion function,give an algorithm and discuss the economic's sense of the solution,which is an efficient solution with the minimization relative risk.

Three types of stochastic programming are introduced and a new type of Stochastic goal programming is given, its convexity is also studied, which can be applied to solve the problem of stochastic goal programming.

Scattering Simulation for Inhomogeneous Layered Canopy and Random Targets Beneath Canopies by Using the Mueller Matrix Solution of the Pulse Radiative Transfer

It is a new method for measuring the modulation transfer function (MTF),by using laser speckle, which belongs to the methods for measuring MTF using random targets.

Stochastic goal programming with estimated parameters

Stochastic Goal Programming Model for Optimal Blending of Desalinated Water with Groundwater

A stochastic goal programming (GP) model is developed in orderto determine the daily production of desalination plants to meet the requirements of water blending stations (WBS) for major cities in the Eastern Province of the Kingdom of SaudiArabia.

This representation allows us to work with spaceWτ×W' rather thanW and to investigate more precisely the properties of some random objects given onW.

Another way to achieve some kind of provable security is to identify concrete cryptographic objects, such as hash functions, with ideal random objects and to use arguments from relativized complexity theory.

A Hilbert space of random objects is constructed, where the inner product captures aspects of beliefs about the relationship between the objects.

The flux of small meteoroids, originating primarily from comets, consists of sporadic, random objects and others whose orbits are related.

The idea of defining the expectation of a random variable as its integral with respect to a probability measure is extended to certain lattice-valued random objects and basic results of integration theory are generalized.

Their sequence learning was then compared in two tests with that of controls who had observed the model's right hand responding to random targets during training.

The reflection of light ions from heavy random targets has been calculated within the single-collision approximation on the basis of essentially the same physical model as Schi?tt's adaptation of the LSS range theory to light ions.

Actual state values for three random targets given in the inertial reference frame.

Each switch sends 20 packets with 20 flits to random targets.

Indeed, many cause they may prevent bound kinases from phosphoryknown oncogenic mutations cause constitutive activalating random targets.

This paper deals with the problem of how the optimal procedure for lo-cating tha extreme point of a unimodal objective function by sequential tests is determined when some probability information of the random objective function is known. The information involved in the problem with an 昽bjective function of single variable is analysed and the meaning of the criteria for optimization, the determination of the extreme point by means of the sequential tests and the characteristics and effectiveness of certain types...

This paper deals with the problem of how the optimal procedure for lo-cating tha extreme point of a unimodal objective function by sequential tests is determined when some probability information of the random objective function is known. The information involved in the problem with an 昽bjective function of single variable is analysed and the meaning of the criteria for optimization, the determination of the extreme point by means of the sequential tests and the characteristics and effectiveness of certain types of sequential search policies are discussed. Finally, formulae for obtaining the optimal policies by dynamic programming in all cases discussed are given.

The deficiency of conventional approaches of the optimization of cutting regimes is analyzed. In view of that cutting process is a dynamic process, the effect of tool wear on selecting cutting regimes is analyzed. The cutting speed V, feed f, depth of cut α_p and the wear criterion VB~* are adopted as design variables. Because the cutting process is a random process, the statistic approach suitable to the optimization of metal cutting parameters is proposed. The combination of mathematic expectation and standard...

The deficiency of conventional approaches of the optimization of cutting regimes is analyzed. In view of that cutting process is a dynamic process, the effect of tool wear on selecting cutting regimes is analyzed. The cutting speed V, feed f, depth of cut α_p and the wear criterion VB~* are adopted as design variables. Because the cutting process is a random process, the statistic approach suitable to the optimization of metal cutting parameters is proposed. The combination of mathematic expectation and standard variance of random objective function is used as statistic objective function. The changeconstrained program is used to deal with constraints. The program of optimization of network method is programmed. At last, the optimal metal cutting parameters in machining bearing rings are resulted.

Based on the problem of selecting interdependent projects of strength in Aircraft Engine Research Program in China, which consists of 23 project candidates, this paper develops a R&D projects selection model with resource constraints, which is a stochastic programming model and considers the benefit inter-dependant between the project candidates. By analyzing and solving the model by means of the decision-analysis method designed in this paper, which can be extended to deal with the problem with multiple stochastic...

Based on the problem of selecting interdependent projects of strength in Aircraft Engine Research Program in China, which consists of 23 project candidates, this paper develops a R&D projects selection model with resource constraints, which is a stochastic programming model and considers the benefit inter-dependant between the project candidates. By analyzing and solving the model by means of the decision-analysis method designed in this paper, which can be extended to deal with the problem with multiple stochastic objectives and constraints, the project selection plan with the optimal satisfied degree and feasible degree with respect to the decisionmaker's aspiration objective level can be got.