scholarly journals A Goal Programming Approach to Multichoice Multiobjective Stochastic Transportation Problems with Extreme Value Distribution

2019 ◽  
Vol 2019 ◽  
pp. 1-6 ◽  
Author(s):  
Hadeel Al Qahtani ◽  
Ali El–Hefnawy ◽  
Maha M. El–Ashram ◽  
Aisha Fayomi

This paper presents the study of a multichoice multiobjective transportation problem (MCMOTP) when at least one of the objectives has multiple aspiration levels to achieve, and the parameters of supply and demand are random variables which are not predetermined. The random variables shall be assumed to follow extreme value distribution, and the demand and supply constraints will be converted from a probabilistic case to a deterministic one using a stochastic approach. A transformation method using binary variables reduces the MCMOTP into a multiobjective transportation problem (MOTP), selecting one aspiration level for each objective from multiple levels. The reduced problem can then be solved with goal programming. The novel adapted approach is significant because it enables the decision maker to handle the many objectives and complexities of real-world transportation problem in one model and find an optimal solution. Ultimately, a mixed-integer mathematical model has been formulated by utilizing GAMS software, and the optimal solution of the proposed model is obtained. A numerical example is presented to demonstrate the solution in detail.

2013 ◽  
Vol 50 (3) ◽  
pp. 900-907 ◽  
Author(s):  
Xin Liao ◽  
Zuoxiang Peng ◽  
Saralees Nadarajah

We discuss tail behaviors, subexponentiality, and the extreme value distribution of logarithmic skew-normal random variables. With optimal normalized constants, the asymptotic expansion of the distribution of the normalized maximum of logarithmic skew-normal random variables is derived. We show that the convergence rate of the distribution of the normalized maximum to the Gumbel extreme value distribution is proportional to 1/(log n)1/2.


1970 ◽  
Vol 2 (2) ◽  
pp. 323-343 ◽  
Author(s):  
Sidney I. Resnick ◽  
Marcel F. Neuts

Consider the bivariate sequence of r.v.'s {(Jn, Xn), n ≧ 0} with X0 = - ∞ a.s. The marginal sequence {Jn} is an irreducible, aperiodic, m-state M.C., m < ∞, and the r.v.'s Xn are conditionally independent given {Jn}. Furthermore P{Jn = j, Xn ≦ x | Jn − 1 = i} = pijHi(x) = Qij(x), where H1(·), · · ·, Hm(·) are c.d.f.'s. Setting Mn = max {X1, · · ·, Xn}, we obtain P{Jn = j, Mn ≦ x | J0 = i} = [Qn(x)]i, j, where Q(x) = {Qij(x)}. The limiting behavior of this probability and the possible limit laws for Mn are characterized.Theorem. Let ρ(x) be the Perron-Frobenius eigenvalue of Q(x) for real x; then:(a)ρ(x) is a c.d.f.;(b) if for a suitable normalization {Qijn(aijnx + bijn)} converges completely to a matrix {Uij(x)} whose entries are non-degenerate distributions then Uij(x) = πjρU(x), where πj = limn → ∞pijn and ρU(x) is an extreme value distribution;(c) the normalizing constants need not depend on i, j;(d) ρn(anx + bn) converges completely to ρU(x);(e) the maximum Mn has a non-trivial limit law ρU(x) iff Qn(x) has a non-trivial limit matrix U(x) = {Uij(x)} = {πjρU(x)} or equivalently iff ρ(x) or the c.d.f. πi = 1mHiπi(x) is in the domain of attraction of one of the extreme value distributions. Hence the only possible limit laws for {Mn} are the extreme value distributions which generalize the results of Gnedenko for the i.i.d. case.


1978 ◽  
Vol 15 (3) ◽  
pp. 552-559 ◽  
Author(s):  
Donald P. Gaver ◽  
Patricia A. Jacobs

A study is made of the extremal process generated by i.i.d. random variables appearing at the events of a non-homogeneous Poisson process, 𝒫. If 𝒫 has an exponentially increasing rate function, then records eventually occur in a homogeneous Poisson process. The size of the latest record has a classical extreme value distribution.


2020 ◽  
Vol 30 (1) ◽  
Author(s):  
Hamiden Abd El-Wahed Khalifa

Transportation problem (TP) is a special type of linear programming problem (LPP) where the objective is to minimize the cost of distributing a product from several sources (or origins) to some destinations. This paper addresses a transportation problem in which the costs, supplies, and demands are represented as heptagonal fuzzy numbers. After converting the problem into the corresponding crisp TP using the ranking method, a goal programming (GP) approach is applied for obtaining the optimal solution. The advantage of GP for the decision-maker is easy to explain and implement in real life transportation. The stability set of the first kind corresponding to the optimal solution is determined. A numerical example is given to highlight the solution approach.


1978 ◽  
Vol 15 (03) ◽  
pp. 552-559 ◽  
Author(s):  
Donald P. Gaver ◽  
Patricia A. Jacobs

A study is made of the extremal process generated by i.i.d. random variables appearing at the events of a non-homogeneous Poisson process, 𝒫. If 𝒫 has an exponentially increasing rate function, then records eventually occur in a homogeneous Poisson process. The size of the latest record has a classical extreme value distribution.


1982 ◽  
Vol 14 (02) ◽  
pp. 324-339 ◽  
Author(s):  
Jonathan P. Cohen

Let Yn denote the largest of n independent N(0,1) random variables. It is shown that the error in approximating the distribution of Yn by the type III extreme value distribution exp {– (–Ax + B) k }, k &gt; 0, is uniformly of order (log n)–2 if and only if the constants A, B and k satisfy certain conditions. In particular, this holds for the penultimate form of Fisher and Tippett (1928). Furthermore, two sufficient conditions are given so that these results can be extended to a stationary Gaussian sequence.


1971 ◽  
Vol 8 (01) ◽  
pp. 136-156 ◽  
Author(s):  
Sidney I. Resnick

If for two c.d.f.'s F(·) and G(·), 1 – F(x)/1 – G(x) → A, 0 &lt;A &lt;∞ , as x → ∞, then for normalizing constants an &gt; 0, bn, n &gt; 1, Fn (anx + bn ) → φ(x), φ(x) non-degenerate, iff Gn (anx + bn )→ φ A−1(x). Conversely, if Fn (anx+bn )→ φ(x), Gn (anx + bn ) → φ'(x), φ(x) and φ'(x) non-degenerate, then there exist constants C &gt;0 and D such that φ'(x) =φ(Cx + D) and limx→∞ 1 — F(x)/1 — G(x) exists and is expressed in terms of C and D, depending on which type of extreme value distribution φ(x) is. These results are used to study domain of attraction questions for products of distribution functions and to reduce the limit law problem for maxima of a sequence of random variables defined on a Markov chain (M.C.) to the independent, identically distributed (i.i.d.) case.


1970 ◽  
Vol 2 (02) ◽  
pp. 323-343 ◽  
Author(s):  
Sidney I. Resnick ◽  
Marcel F. Neuts

Consider the bivariate sequence of r.v.'s {(J n , X n ), n ≧ 0} with X 0 = - ∞ a.s. The marginal sequence {J n } is an irreducible, aperiodic, m-state M.C., m &lt; ∞, and the r.v.'s X n are conditionally independent given {J n }. Furthermore P{J n = j, X n ≦ x | J n − 1 = i} = p ij H i (x) = Q ij (x), where H 1(·), · · ·, H m (·) are c.d.f.'s. Setting M n = max {X 1, · · ·, X n }, we obtain P{J n = j, M n ≦ x | J 0 = i} = [Q n (x)] i, j , where Q(x) = {Q ij (x)}. The limiting behavior of this probability and the possible limit laws for M n are characterized. Theorem. Let ρ(x) be the Perron-Frobenius eigenvalue of Q(x) for real x; then: (a)ρ(x) is a c.d.f.; (b) if for a suitable normalization {Q ij n (a ijn x + b ijn )} converges completely to a matrix {U ij (x)} whose entries are non-degenerate distributions then U ij (x) = π j ρ U (x), where π j = lim n → ∞ p ij n and ρ U (x) is an extreme value distribution; (c) the normalizing constants need not depend on i, j; (d) ρ n (a n x + b n ) converges completely to ρ U (x); (e) the maximum M n has a non-trivial limit law ρ U (x) iff Q n (x) has a non-trivial limit matrix U(x) = {U ij (x)} = {π j ρ U (x)} or equivalently iff ρ(x) or the c.d.f. π i = 1 m H i π i(x) is in the domain of attraction of one of the extreme value distributions. Hence the only possible limit laws for {M n } are the extreme value distributions which generalize the results of Gnedenko for the i.i.d. case.


Sign in / Sign up

Export Citation Format

Share Document