scholarly journals A New Methodology for Solving Multiobjective Chance-Constrained Problems: An Application on IoT Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Kumru Didem Atalay ◽  
Tacettin Sercan Pekin ◽  
Ayşen Apaydin

This study presents a newly developed methodology to transform the chance-constrained problem into a deterministic problem and then solving this multiobjective deterministic problem with the proposed method. Chance-constrained problem contains independent gamma random variables that are denoted as a i j . Two methods are proposed to obtain the deterministic equivalent of chance-constrained problem. The first of the methods is directly based on using the distribution, and the second consists of normalizing probabilistic constraints using Lyapunov’s central limit theorem. An algorithm which uses the Global Criterion Method is developed to solve the multiobjective deterministic equivalent of chance-constrained problem. The methodology is applied to a real-life engineering problem that consists of an IoT device and its data sending process. Using Lyapunov’s central limit theorem for large numbers of random variables is found to be more appropriate.

2021 ◽  
Vol 36 (2) ◽  
pp. 243-255
Author(s):  
Wei Liu ◽  
Yong Zhang

AbstractIn this paper, we investigate the central limit theorem and the invariance principle for linear processes generated by a new notion of independently and identically distributed (IID) random variables for sub-linear expectations initiated by Peng [19]. It turns out that these theorems are natural and fairly neat extensions of the classical Kolmogorov’s central limit theorem and invariance principle to the case where probability measures are no longer additive.


2021 ◽  
Vol 499 (1) ◽  
pp. 124982
Author(s):  
Benjamin Avanzi ◽  
Guillaume Boglioni Beaulieu ◽  
Pierre Lafaye de Micheaux ◽  
Frédéric Ouimet ◽  
Bernard Wong

1992 ◽  
Vol 24 (2) ◽  
pp. 267-287 ◽  
Author(s):  
Allen L. Roginsky

Three different definitions of the renewal processes are considered. For each of them, a central limit theorem with a remainder term is proved. The random variables that form the renewal processes are independent but not necessarily identically distributed and do not have to be positive. The results obtained in this paper improve and extend the central limit theorems obtained by Ahmad (1981) and Niculescu and Omey (1985).


2011 ◽  
Vol 48 (02) ◽  
pp. 527-546 ◽  
Author(s):  
Patrizia Berti ◽  
Irene Crimaldi ◽  
Luca Pratelli ◽  
Pietro Rigo

Let X n be a sequence of integrable real random variables, adapted to a filtration (G n ). Define C n = √{(1 / n)∑ k=1 n X k − E(X n+1 | G n )} and D n = √n{E(X n+1 | G n ) − Z}, where Z is the almost-sure limit of E(X n+1 | G n ) (assumed to exist). Conditions for (C n , D n ) → N(0, U) x N(0, V) stably are given, where U and V are certain random variables. In particular, under such conditions, we obtain √n{(1 / n)∑ k=1 n X_k - Z} = C n + D n → N(0, U + V) stably. This central limit theorem has natural applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced urns.


Sign in / Sign up

Export Citation Format

Share Document