In this paper we consider a broad class of distributionally robust optimization (DRO) problems where the probability of the underlying random variables depends on the decision variables and the amb...
One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management. In this paper, we establish asymptotic analysis results of a sample-average approximation (SAA) estimator for the SLCP. The asymptotic normality analysis results for the stochastic-constrained optimization problem are extended to the SLCP model and then the conditions, which ensure the convergence in distribution of the sample-average approximation estimator for the SLCP to multivariate normal with zero mean vector and a covariance matrix, are obtained. The results obtained are finally applied for estimating the confidence region of a solution for the SLCP.
In this paper, an efficient artificial neural network is proposed for solving a generalized vertical complementarity problem. Based on the properties of log-exponential function, the generalized vertical complementarity problem is reformulated in terms of the unconstrained minimization problem. The existence and the convergence of the trajectory of the neural network are addressed in detail. In addition, it is also proved that if the neural network problem has an equilibrium point under some initial condition, the equilibrium point is asymptotically stable or exponentially stable under certain conditions. At the end of this paper, the simulation results for the generalized bimatrix game are illustrated to show the efficiency of the neural network.
1 March 2012 in Journal of Mathematical Analysis and Applications