The Chance-Constrained Stochastic Programming (CCSP) is one of the models for decision making under uncertainty. In this paper, we consider the special case of the CCSP in which only the righthand side vector is random with a discrete distribution having a finite support. The unit commitment problem is one of the applications of the special case of the CCSP. Existing methods for exactly solving...

The purpose of the paper is to introduce a new type of fuzzy matrix games: fuzzy constrained matrix games. A computational method for its solution based on establishment of the auxiliary fuzzy linear programming for each player is proposed. The approach based on the multiobjective programming is established to solve these fuzzy linear programming. Effectiveness is illustrated with a numerical e...

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

Original scientific paper Network skeleton reconfiguration is an important task during power system restoration after blackout. The uncertainty of the restoration time and the restoration successful rate during the network skeleton reconfiguration are considered in the paper. The restoration time of transmission lines and transformers, units’ startup time limit and the restoration successful ra...

In this paper, the problem of low probability of identification (LPID) improvement for radar network systems is investigated. Firstly, the security information is derived to evaluate the LPID performance for radar network. Then, without any prior knowledge of hostile intercept receiver, a novel fuzzy chance-constrained programming (FCCP) based security information optimization scheme is present...

This study addresses a multi-objective stochastic solid transportation problem (MOSSTP) with uncertainties in supply, demand, and conveyance capacity, following the Weibull distribution. aims to minimize multiple costs (STP) under probabilistic inequality constraints. The MOSSTP is expressed as chance-constrained programming problem, constraints are incorporated ensure that capacity satisfied s...

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1− . While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In th...

Abstract: In this study, we combine the fuzzy customer information problem with the multicommodity multimodal routing with schedule-based services which was explored in our previous study [1]. The fuzzy characteristics of the customer information are embodied in the demanded volumes of the multiple commodities and the time windows of their due dates. When the schedule-based services are conside...