We propose a safe approximation to joint chance-constrained programming, where the constraint functions are additively dependent on normally-distributed random vector. The is analytical, meaning that it requires neither numerical integrations nor sampling-based probability approximations. Under mild assumptions, standard nonlinear program. compare this new another analytical for programming bas...

The problem of optimizing affine feedback laws that explicitly steer the mean and covariance an uncertain system state in presence a Gaussian random field is considered. Spatially-dependent disturbances are successively approximated with respect to nominal trajectory by sequence jointly vectors. Sequential updates control inputs computed via convex optimization includes effect feedback, perturb...

 Recently, Khodabakhshi and Aryavash have introduced a ranking method [Applied Mathematics Letters, 25 (2012) 2066-2070.], which is based on an optimistic-pessimistic approach of data envelopment analysis (DEA). This method ranks all decision making units according to a combination of their minimum and maximum possible efficiency scores which are determined by solving two linear programming mo...

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...