Comparisons of Parallel Systems with Components Having Proportional Reversed Hazard Rates and Starting Devices

Abstract

In this paper, we consider stochastic comparisons of parallel systems with proportional reversed hazard rate (PRHR) distributed components equipped with starting devices. By considering parallel systems with two components that PRHR and starting devices, we prove the hazard rate and reversed hazard rate orders. These results are then generalized for such parallel systems with n components in terms of usual stochastic order. The establish results are illustrated with some examples.

1. Introduction

Comparison of important characteristics of lifetimes of technical systems is of interest in many problems. Let $X_1,\cdots ,X_n$ be non-negative independent random variables representing lifetimes of components of a system. Let $I_{p_1},\cdots ,I_{p_n}$ be independent Bernoulli random variables with $I_{p_i}=1$ if the i-th component survives from random shocks and $I_{p_i}=0$ if the i-th component fails from the shocks and $P(I_{p_i}=1)=p_i$, for $i=1,\cdots ,n$. Further, let them also be independent of $X_i$s. For a given time period, we can then use $I_{p_1}{X}_1,\cdots ,I_{p_n}{X}_n$ to denote the lifetimes of components that are subject to random shocks. Of special interest are $Y_{n:n}=max(I_{p_1}{X}_1,\cdots ,I_{p_n}{X}_n)$ and $Y_{1:n}=min(I_{p_1}{X}_1,\cdots ,I_{p_n}{X}_n)$ corresponding to lifetimes of parallel and series systems, respectively. Throughout this work, we use the term “heterogeneity” to mean that components have different lifetime distributions. A similar assumption is also made on the survival probabilities. It is then of natural interest to evaluate the influence of heterogeneity among the components and the random shocks on the lifetimes of parallel and series systems, and this reliability problem forms the main basis for the present work.

We can present a different motivation for this problem as follows. Consider a finite system with each of its components equipped with a starter whose performance is modelled by a Bernoulli random variable, and with all component lifetimes being independent. As a starter may fail to initiate the component, the total number of components in operation would thus be random. Such situations arise naturally in a number of applications. Some possible examples are as follows: start-ups of power plants with gas turbines, length of time of a conference online being the maximum online time of those who successfully register for the conference, and the maximum loss of an insured individual who has a policy covering multiple risks being the maxima of those invoked losses. Another interesting scenario discussed by [1,2] in auction theory is when an auctioneer attracts some predetermined potential bidders by advertising a valuable object; in this case, the largest bid of those participants defines the price of the object for sale. One may additionally refer to [3,4,5,6] for the role of random extremes in financial economics, reliability theory, actuarial science, hydrology, and so on.

In actuarial set-up, the claims sizes may be represented by variables $X_i$s, and the variables $I_{p_i}$s represent their occurrences. In this case, $Y_{n:n}=max(I_{p_1}{X}_1,\cdots ,I_{p_n}{X}_n)$ and $Y_{1:n}=min(I_{p_1}{X}_1,\cdots ,I_{p_n}{X}_n)$ correspond to the largest and smallest claim amounts in a portfolio of risks, respectively.

Considerable attention has been paid in the actuarial literature to different stochastic comparisons of numbers of claims and aggregate claim amounts. In particular, [7] consider a general scale model and discuss orderings of smallest and largest claim amounts, while [8] focus on the comparison of smallest and largest claim amounts from two sets of heterogeneous portfolios. These authors have specifically discussed the ordering results in the presence of heterogeneity among the sample sizes and the probabilities of claims and also in the presence of dependence between claim sizes and probabilities of claims.

The flexible family of distributions offered by the proportional reversed hazard rate (PRHR) model has found key applications in lifetime data analysis. For a system consisting of n components, let $X_i$ and ${\tilde{r}}_i$ (for $i=1,\cdots ,n$) denote the lifetime and the reversed hazard rate of the i-th component. Then, when

$${\tilde{r}}_i\left(x\right)={\lambda }_i\tilde{r}\left(x\right),\hspace{1em}for i=1,\cdots ,n,$$

the variables $X_i$s are said to have the $PRHR$ model, where $\tilde{r}\left(x\right)$ is referred to as the baseline reversed hazard rate function and ${\lambda }_i$s (all positive) are the proportionality constants. It is then easy in this case to see that $F_i\left(x\right)$, the distribution function of $X_i$, is given by ${\left(F\left(x\right)\right)}^{{\lambda }_i}$, $i=1,\cdots ,n$, where $F\left(x\right)$ is the baseline distribution function corresponding to $\tilde{r}\left(x\right)$. The PRHR family of distributions include many commonly used lifetime distributions as special cases such as generalized exponential and exponentiated Weibull distributions. In addition, when the proportionality constants ${\lambda }_i$s are integers, then $X_i$s are in fact the lifetimes of parallel systems consisting of ${\lambda }_i$ components with their lifetimes being independent and identically distributed with distribution function $F\left(x\right).$ As parallel systems with more components are less prone to failure, the PRHR model is also referred to as resilience model in the reliability literature; one may refer to [9] for relevant details.

Suppose $Y_i=X_i{I}_{p_i}$, $i=1,2.$ Then, the survival function of series systems, $V_{1:2}=min\{X_1{I}_{p_1},X_2{I}_{p_2}\}$, is given by

$$\begin{array}{ccc}\hfill {\overline{F}}_{V_{1:2}}\left(x\right)& =& \left({\displaystyle \prod _{i=1}^2}{p}_i\right){\overline{F}}_{X_{1:2}}\left(x\right),\hspace{1em}x\ge 0.\hfill \end{array}$$

Similarly, the survival function of $W_{1:2}=min\{X_1^{*}{I}_{p_1^{*}},X_2^{*}{I}_{p_2^{*}}\}$ is given by

$$\begin{array}{c}\hfill {\overline{F}}_{W_{1:2}}\left(x\right)=\left({\displaystyle \prod _{i=1}^2}{p}_i^{*}\right){\overline{F}}_{X_{1:2}^{*}}\left(x\right),\hspace{1em}x\ge 0.\end{array}$$

Then, the stochastic comparison between $V_{1:2}$ and $W_{1:2}$ is equivalent to the comparison between $X_{1:2}$ and $X_{1:2}^{*}$. It should be mentioned that the comparison between $X_{1:2}$ and $X_{1:2}^{*}$ has been investigated by many authors earlier. For this reason, we have not considered this problem in the present work.

In this paper, we consider only stochastic comparisons of parallel systems with proportional reversed hazard rate (PRHR) distributed components equipped with starting devices. We specifically establish the hazard rate, reversed hazard rate and usual stochastic orders of parallel systems with PRHR distributed components equipped with starting devices.

The rest of this paper is organized as follows. In Section 2, we present some basic definitions and notation pertaining to stochastic orders and majorization orders that are used in the present work. Section 3 discusses stochastic comparisons of parallel systems for different probabilities of starters in terms of hazard rate order. In Section 4, stochastic comparisons of parallel systems are established for different probabilities of starters in terms of reversed hazard rate order. Section 5 discusses stochastic comparisons of parallel systems for different probabilities of the starters in terms of usual stochastic order. Finally, some concluding remarks are made in Section 6.

2. Preliminaries

In this section, we present some basic definitions and lemmas that will be useful for all subsequent developments. For convenience, we use the notation $a\stackrel{sgn}{=}b$ to denote that both sides of an equality have the same sign.

Definition 1.

Suppose X and Y are two non-negative continuous random variables with distribution functions $F_X$ and $F_Y,$ survival functions ${\overline{F}}_X$ and ${\overline{F}}_Y,$ hazard rate functions $r_X$ and $r_Y$, and reversed hazard rate functions ${\tilde{r}}_X$ and ${\tilde{r}}_Y$. We assume that all involved expectations exist. Then:

(i) 

X is said to be larger than Y in the usual stochastic order (denoted by $X{\ge }_{st}Y)$ if ${\overline{F}}_X\left(t\right)\ge {\overline{F}}_Y\left(t\right)$ for all $t\in {\mathbb{R}}_{+}.$ This is equivalent to saying that $\mathbb{E}\left(\varphi \right(X\left)\right)\ge \mathbb{E}\left(\varphi \right(Y\left)\right)$ for all increasing functions $\varphi :{\mathbb{R}}_{+}\to \mathbb{R};$

(ii) 

X is said to be larger than Y in the hazard rate order (denoted by $X{\ge }_{hr}Y)$ if and only if ${\overline{F}}_X\left(t\right)/{\overline{F}}_Y\left(t\right)$ increases in $t\in {\mathbb{R}}_{+}.$ This is equivalent to saying that $r_Y\left(t\right)\ge r_X\left(t\right)$ for all $t\in {\mathbb{R}}_{+};$

(iii) 

X is said to be larger than Y in the reversed hazard rate order (denoted by $X{\ge }_{rh}Y)$ if and only if $F_X\left(t\right)/F_Y\left(t\right)$ increases in $t\in {\mathbb{R}}_{+}.$ This is equivalent to saying that ${\tilde{r}}_X\left(t\right)\ge {\tilde{r}}_Y\left(t\right)$ for all $t\in {\mathbb{R}}_{+}.$

It is known that the usual stochastic order is included in both hazard rate and reversed hazard rate orders. The books by [10,11] provide elaborate details on various stochastic orders and their applications to a wide array of problems.

Definition 2.

Consider two vectors $\mathit{a}=(a_1,\cdots ,a_n)$ and $\mathit{b}=(b_1,\cdots ,b_n)$ with corresponding increasing arrangements $a_{\left(1\right)}\le \cdots \le a_{\left(n\right)}$ and $b_{\left(1\right)}\le \cdots \le b_{\left(n\right)}$, respectively. Then:

(i) 

a is said to majorize $\mathit{b},$ denoted by $\mathit{a}\stackrel{m}{⪰}\mathit{b},$ if ${\sum }_{j=1}^i{a}_{\left(j\right)}\le {\sum }_{j=1}^i{b}_{\left(j\right)}$ for $i=1,\cdots ,n-1,$ and ${\sum }_{j=1}^n{a}_{\left(j\right)}={\sum }_{j=1}^n{b}_{\left(j\right)}$;

(ii) 

a is said to weakly submajorize $\mathit{b},$ denoted by $\mathit{a}{⪰}_w\mathit{b},$ if ${\sum }_{j=i}^n{a}_{\left(j\right)}\ge {\sum }_{j=i}^n{b}_{\left(j\right)}$ for $i=1,\cdots ,n$.

The concept of majorization is a way of comparing two vectors of the same dimension, in terms of the dispersion of their components, in which the order $\mathit{u}\stackrel{m}{⪰}\mathit{v}$ means that $u_i$s are more dispersive than $v_i$s for a fixed sum. For example, we always have $\mathit{u}\stackrel{m}{⪰}\overline{\mathit{u}},$ where $\overline{\mathit{u}}=(\overline{u},\cdots ,\overline{u})$ with $\overline{u}=\frac{1}{n}{\sum }_{i=1}^n{u}_i$. It is evident that the majorization order implies weak submajorization order.

Definition 3.

A real-valued function ϕ, defined on a set $\mathbb{A}\subseteq {\mathbb{R}}^n$, is said to be Schur-convex on $\mathbb{A}$ if

$$\mathit{u}\stackrel{m}{⪰}\mathit{v}\Rightarrow \varphi \left(\mathit{u}\right)\ge \varphi \left(\mathit{v}\right)\hspace{1em}for any \mathit{u},\mathit{v}\in \mathbb{A}.$$

Further, ϕ is said to be Schur-concave function on $\mathbb{A}$ if $-\varphi$ is Schur-convex on $\mathbb{A}.$

Lemma 1.

([12], p. 84) Suppose $J\subset \mathbb{R}$ is an open interval and $\varphi :J^n\to \mathbb{R}$ is continuously differentiable. Then, necessary and sufficient conditions for ϕ to be Schur-convex (Schur-concave) on $J^n$ are

(i) 

ϕ is symmetric on $J^n$;

(ii) 

for all $i\ne j$ and all $\mathbf{z}\in J^n$,

$$(z_i-z_j)\left(\frac{\partial \varphi \left(\mathbf{z}\right)}{\partial z_i}-\frac{\partial \varphi \left(\mathbf{z}\right)}{\partial z_j}\right)\ge 0(\le 0),$$

where $\partial \varphi \left(\mathbf{z}\right)/\partial z_i$ denotes the partial derivative of ϕ with respect to its i-th argument.

Lemma 2.

([12], p. 87) Consider the real-valued function $\phi ,$ defined on a set $\mathbb{A}\subseteq {\mathbb{R}}^n$. Then, $\mathit{u}{⪰}_w\mathit{v}$ implies $\varphi \left(\mathit{u}\right)\ge \varphi \left(\mathit{v}\right)$ if and only if ϕ is increasing and Schur-convex on $\mathbb{A}.$

3. Hazard Rate Order

In this section, we discuss stochastic comparisons of parallel systems for different probabilities of starters in terms of hazard rate order.

Theorem 1.

Suppose $X_1$ and $X_2$ are independent non-negative random variables with $X_i\sim PRHR\left({\lambda }_i\right)$. Further, suppose $I_{p_1}$, $I_{p_2}$, $I_{p_1^{*}}$, and $I_{p_2^{*}}$ are independent Bernoulli random variables, independently of $X_i$s, with $E\left(I_{p_i}\right)=p_i$ and $E\left(I_{p_i^{*}}\right)=p_i^{*}$, $i=1,2$. Let $V_{2:2}=max\{X_1{I}_{p_1},X_2{I}_{p_2}\}$ and $W_{2:2}=max\{X_1{I}_{p_1^{*}},X_2{I}_{p_2^{*}}\}$. Then, the following statements hold true:

(i) 

If $p_1=p_1^{*}$ ($p_2=p_2^{*}$) and ${\lambda }_1\le {\lambda }_2$ ( ${\lambda }_2\le {\lambda }_1$), then

$$\begin{array}{c}\hfill p_2\ge p_2^{*}(p_1\ge p_1^{*})⟺V_{2:2}{\ge }_{hr}{W}_{2:2};\end{array}$$

(ii) 

If $p_1\ge p_1^{*}$, then

$$\begin{array}{c}\hfill p_1\ge p_2, p_1^{*}\ge p_2^{*} and p_1-p_2\le p_1^{*}-p_2^{*}⟹V_{2:2}{\ge }_{hr}{W}_{2:2}.\end{array}$$

Proof. 

(i)

The survival functions of $V_{2:2}$ and $W_{2:2}$ are given by

$${\overline{F}}_{V_{2:2}}\left(x\right)=p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)$$

and

$${\overline{F}}_{W_{2:2}}\left(x\right)=p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right).$$

For the necessity part, note that $V_{2:2}{\ge }_{hr}{W}_{2:2}$ implies that $V_{2:2}{\ge }_{st}{W}_{2:2}$ and so ${\overline{F}}_{V_{2:2}}\ge {\overline{F}}_{W_{2:2}}$. We thus have

$$\begin{array}{c}\hfill p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\\ \hfill \ge p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right).\end{array}$$

Therefore, we get

$$\begin{array}{c}\hfill p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)\left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\}\ge p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)\left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\},\end{array}$$

which implies that $p_2\ge p_2^{*}$. Now, for the sufficiency part, let us consider

$$\begin{array}{c}\hfill \varphi \left(x\right)=\frac{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)}{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)},\end{array}$$

and it is then enough to show that $\varphi$ is increasing in x. Upon differentiating $\varphi$ with respect to x, we get

$$\begin{array}{ccc}\hfill \frac{\partial \varphi \left(x\right)}{\partial x}& \stackrel{sgn}{=}& \left\{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & \times & \{p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\hfill \\ & -& p_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\}\hfill \\ & -& \left\{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & \times & \{p_1{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\hfill \\ & -& p_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\}\hfill \\ & =& p_1^2{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1^2{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\hfill \\ & -& p_1^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& p_1{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2+p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1^2{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1^2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+p_1^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& p_1{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1^2{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& p_1^2{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & =& p_1\left(p_2-p_2^{*}\right)\{p_1{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& {\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}.\hfill \end{array}$$

For proving the increasing property of $\varphi$, it is enough to show that

$$\begin{array}{c}\hfill D\left(x\right)={\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\end{array}$$

(1)

is positive. For this purpose, we find

$$\begin{array}{ccc}\hfill D\left(x\right)& =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right)-{\lambda }_2{F}^{{\lambda }_2}\left(x\right)+({\lambda }_2-{\lambda }_1)F^{{\lambda }_1+{\lambda }_2}\left(x\right)\hfill \\ & \stackrel{sgn}{=}& {\lambda }_1-{\lambda }_2{F}^{{\lambda }_2-{\lambda }_1}\left(x\right)+({\lambda }_2-{\lambda }_1)F^{{\lambda }_2}\left(x\right).\hfill \end{array}$$

Let us now consider $E\left(x\right)={\lambda }_1-{\lambda }_2{F}^{{\lambda }_2-{\lambda }_1}\left(x\right)+({\lambda }_2-{\lambda }_1)F^{{\lambda }_2}\left(x\right)$. Then, we have ${lim}_{x\to \infty }E\left(x\right)=0$; since ${\lambda }_1\le {\lambda }_2$, we find

$$\begin{array}{ccc}\hfill E^{\prime }\left(x\right)& =& -{\lambda }_2({\lambda }_2-{\lambda }_1)F^{{\lambda }_2-{\lambda }_1-1}\left(x\right)f\left(x\right)+{\lambda }_2({\lambda }_2-{\lambda }_1)F^{{\lambda }_2-1}\left(x\right)f\left(x\right)\hfill \\ & \stackrel{sgn}{=}& ({\lambda }_2-{\lambda }_1)F^{{\lambda }_2-1}\left(x\right)\left(-F^{-{\lambda }_1}\left(x\right)+1\right)\hfill \\ & \stackrel{sgn}{=}& F^{{\lambda }_1}\left(x\right)-1\hfill \\ & \le & 0,\hfill \end{array}$$

and so $E\left(x\right)$ is decreasing. Consequently, $E\left(x\right)\ge 0$ for $x\ge 0$, and so $D\left(x\right)\ge 0$. Thus, Part (i) of the theorem is proved.

(ii)

The survival functions of $V_{2:2}$ and $W_{2:2}$, for $x\ge 0$, are

$${\overline{F}}_{V_{2:2}}\left(x\right)=p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)$$

and

$${\overline{F}}_{W_{2:2}}\left(x\right)=p_1^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1^{*}{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right),$$

respectively. Then, it is enough to show that

$$\begin{array}{c}\hfill \psi \left(x\right)=\frac{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)}{p_1^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1^{*}{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)}\end{array}$$

is increasing in x. We can then see easily that

$$\begin{array}{ccc}\hfill \frac{\partial \psi \left(x\right)}{\partial x}& \stackrel{sgn}{=}& \{-p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)-p_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)+p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & \times & \left\{p_1^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1^{*}{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & +& \{p_1^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)+p_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-p_1^{*}{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1^{*}{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & \times & \left\{p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & =& -p_1{p}_1^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_1^{*}{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_2{p}_1^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_2{p}_1^{*}{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_2{p}_1^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1{p}_2{p}_1^{*}{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& p_1{p}_2{p}_1^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{p}_1^{*}{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_1^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_1^{*}{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-\{p_1^{*}{p}_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\hfill \\ & \times & \left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\}\hfill \\ & +& p_2^{*}{p}_1{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_2^{*}{p}_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^{*}{p}_2^{*}{p}_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1^{*}{p}_2^{*}{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& p_1^{*}{p}_2^{*}{p}_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1^{*}{p}_2^{*}{p}_1{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2-p_1^{*}{p}_2^{*}{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1^{*}{p}_2^{*}{p}_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & =& (p_1^{*}{p}_2-p_1{p}_2^{*})\left\{{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\}\hfill \\ & +& p_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2(p_1-p_1^{*})+p_1{p}_1^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2(p_2-p_2^{*})\hfill \end{array}$$

Based on Part (i) and Equation (1), for ${\lambda }_1\le {\lambda }_2$, we have

$$\begin{array}{c}\hfill {\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\end{array}$$

being positive. From $p_1\ge p_2$ and $p_1^{*}\ge p_2^{*}$, there exist positive real numbers d and c such that $p_1=p_2+d$ and $p_1^{*}=p_2^{*}+c$. Now, from $p_1-p_2\le p_1^{*}-p_2^{*}$, we have $d\le c$, and also from $p_1\ge p_1^{*}$, we get $p_2+d\ge p_2^{*}+c$ and then $p_2-p_2^{*}\ge c-d\ge 0$. So, $p_2\ge p_2^{*}$ and clearly $c{p}_2\ge d{p}_2^{*}$. Furthermore, we have

$$\begin{array}{c}\hfill p_1^{*}{p}_2-p_1{p}_2^{*}=(p_2^{*}+c)-(p_2+d)p_2^{*}=c{p}_2-d{p}_2^{*}\ge 0.\end{array}$$

Therefore, all terms of the last equality in $\frac{\partial \psi \left(x\right)}{\partial x}$ are positive, and the desired result is obtained.

□

We now present an example to show that Theorem 1 (under $p_1=p_1^{*}$) may not hold when the condition ${\lambda }_2\ge {\lambda }_1$ is not satisfied.

Example 1.

Let us consider $Beta(1,1)$ as baseline distribution function. Set $(p_1,p_2)=(0.3,0.8)$, $(p_1^{*},p_2^{*})=(0.3,0.2)$ and $({\lambda }_1,{\lambda }_2)=(20,10)$. Then, we find

$$\begin{array}{c}\hfill \varphi \left(x\right)=\frac{0.3(1-x^{20})+0.8(1-x^{10})-0.24(1-x^{20})(1-x^{10})}{0.3(1-x^{20})+0.2(1-x^{10})-0.06(1-x^{20})(1-x^{10})}\end{array}$$

to be not monotone when $x\ge 0.95$ (as seen in Figure 1), and this negates the results that $V_{2:2}{\le }_{hr}{W}_{2:2}$ and $V_{2:2}{\ge }_{hr}{W}_{2:2}$.

Remark 1.

Under the ${\lambda }_1\le {\lambda }_2$, the result of Theorem 1 also hold under the following conditions:

1. 

$p_1\ge p_2\ge p_1^{*}\ge p_2^{*}$ and $p_1-p_2\le p_1^{*}-p_2^{*}$;

2. 

$p_1\ge p_1^{*}\ge p_2\ge p_2^{*}$ and $p_1-p_2\le p_1^{*}-p_2^{*}$.

We now present an example to show that Part (ii) of Theorem 1 may not hold when $p_1-p_2>p_1^{*}-p_2^{*}$.

Example 2.

Let us consider the standard exponential as baseline distribution with $F\left(x\right)=1-e^{-x}$, for $x>0$. Set $(p_1,p_2)=(0.8,0.4)$, $(p_1^{*},p_2^{*})=(0.5,0.3)$ and $({\lambda }_1,{\lambda }_2)=(2,10)$. Clearly, $p_1\ge p_1^{*}\ge p_2\ge p_2^{*}$ and $p_1-p_2>p_1^{*}-p_2^{*}$. We then have

$$\begin{array}{c}\hfill \psi \left(x\right)=\frac{0.8(1-{(1-e^{-x})}^2)+0.4(1-{(1-e^{-x})}^{10})-0.32(1-{(1-e^{-x})}^2)(1-{(1-e^{-x})}^{10})}{0.5(1-{(1-e^{-x})}^2)+0.3(1-{(1-e^{-x})}^{10})-0.15(1-{(1-e^{-x})}^2)(1-{(1-e^{-x})}^{10})},\end{array}$$

to be not monotone in $0\le x\le 1.5$ (as seen in Figure 2), and this negates the results that $V_{2:2}{\le }_{hr}{W}_{2:2}$ and $V_{2:2}{\ge }_{hr}{W}_{2:2}$.

4. Reversed Hazard Rate Order

In this section, we discuss stochastic comparisons of parallel systems for different probabilities of starters in terms of reversed hazard rate order. For this purpose, we first prove the following lemma.

Lemma 3.

Suppose function $g(x;a,b)$ is a differentiable function in x and

$$\begin{array}{c}\hfill \varphi \left(x\right)=\frac{g(x;p,d)}{g(x;p^{*},c)}.\end{array}$$

If we consider $L(x;a,t)$ as

$$\begin{array}{c}\hfill L(x;a,t)=\frac{g^{\prime }(x;a,t)}{g(x;a,t)},\end{array}$$

where $g^{\prime }\left(x\right)$ denotes the derivative of function $g\left(x\right)$ with respect to x, then:

$$\begin{array}{c}\hfill \frac{\partial \varphi \left(x\right)}{\partial x}=\varphi \left(x\right)\left\{L(x;p,d)-L(x;p^{*},c)\right\}.\end{array}$$

Proof. 

We can observe that

$$\begin{array}{ccc}\hfill \varphi \left(x\right)\left\{L(x;p,d)-L(x;p^{*},c)\right\}& =& \frac{g(x;p,d)}{g(x;p^{*},c)}\left\{\frac{g^{\prime }(x;p,d)}{g(x;p,d)}-\frac{g^{\prime }(x;p^{*},c)}{g(x;p^{*},c)}\right\}\hfill \\ & =& \frac{g^{\prime }(x;p,d)g(x;p^{*},c)-g^{\prime }(x;p^{*},c)g(x;p,d)}{{\left[g(x;p^{*},c)\right]}^2}\hfill \\ & =& \frac{\partial \varphi \left(x\right)}{\partial x}.\hfill \end{array}$$

□

Theorem 2.

Suppose $X_1$ and $X_2$ are independent non-negative random variables with $X_i\sim PRHR\left({\lambda }_i\right)$. Further, suppose $I_{p_1}$, $I_{p_2}$, $I_{p_1^{*}}$, and $I_{p_2^{*}}$ are independent Bernoulli random variables, independently of $X_i$s, with $E\left(I_{p_i}\right)=p_i$ and $E\left(I_{p_i^{*}}\right)=p_i^{*}$, $i=1,2$. Let $V_{2:2}=max\{X_1{I}_{p_1},X_2{I}_{p_2}\}$ and $W_{2:2}=max\{X_1{I}_{p_1^{*}},X_2{I}_{p_2^{*}}\}$. Then, the following statements hold true:

(i) 

If $p_1=p_1^{*}$ ($p_2=p_2^{*}$) and ${\lambda }_1\le {\lambda }_2$ ( ${\lambda }_2\le {\lambda }_1$), then

$$p_2\ge p_2^{*}(p_1\ge p_1^{*})⟺V_{2:2}{\ge }_{rh}{W}_{2:2};$$

(ii) 

If $p_2\ge p_2^{*}$, then

$$\begin{array}{c}\hfill p_1\ge p_2,p_1^{*}\ge p_2^{*} and p_1-p_2\ge p_1^{*}-p_2^{*}⟹V_{2:2}{\ge }_{rh}{W}_{2:2}.\end{array}$$

Proof. 

(i)

The distribution functions of $V_{2:2}$ and $W_{2:2}$ are given by

$$\begin{array}{c}\hfill F_{V_{2:2}}\left(x\right)=1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right),\\ \hfill F_{W_{2:2}}\left(x\right)=1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right).\end{array}$$

For the necessity part, from $V_{2:2}{\ge }_{rh}{W}_{2:2}$, we have $F_{V_{2:2}}\left(x\right)\le F_{W_{2:2}}\left(x\right)$, and so

$$\begin{array}{c}\hfill 1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\\ \hfill \le 1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right),\end{array}$$

which implies that

$$\begin{array}{c}\hfill p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\\ \hfill \ge p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right).\end{array}$$

Then, we have

$$\begin{array}{c}\hfill p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)\left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\}\ge p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)\left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\},\end{array}$$

which implies that $p_2\ge p_2^{*}$. Next, for the sufficiency part, let us consider the function

$$\begin{array}{c}\hfill \chi \left(x\right)=\frac{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)}{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)}.\end{array}$$

It is then enough to show that $\chi$ is increasing in x. Upon differentiating $\chi \left(x\right)$ with respect to x, we find

$$\begin{array}{ccc}\hfill \frac{\partial \chi \left(x\right)}{\partial x}& \stackrel{sgn}{=}& \left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & \times & \{p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)+p_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & -& \left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & \times & \{p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)+p_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-p_1{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & =& p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)+p_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_1^2{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1^2{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2-p_2^{*}{p}_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_2^{*}{p}_2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1^2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1^2{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{\lambda }_1{F}^{{\lambda }_1}\left(x\right)-p_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)+p_1{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_1^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& p_1{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_1^2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+p_1{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-p_1{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1^2{p}_2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& p_1{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& p_1^2{p}_2{p}_2^{*}{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2+p_1^2{p}_2{p}_2^{*}{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & =& (p_2-p_2^{*}){\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left\{1-2p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)+p_1^2{\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\right\}\hfill \\ & =& (p_2-p_2^{*}){\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\}}^2\hfill \\ & \ge & 0.\hfill \end{array}$$

Hence, $\chi$ is increasing in x, which completes the proof of Part (i) of the theorem.

(ii)

The distribution functions of $V_{2:2}$ and $W_{2:2}$, for $x\ge 0$, are given by

$$F_{V_{2:2}}\left(x\right)=1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)$$

and

$$F_{W_{2:2}}\left(x\right)=1-p_1^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1^{*}{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right),$$

respectively. Then, it is enough to show that

$$\begin{array}{ccc}\hfill \mathsf{\Omega }\left(x\right)& =& \frac{F_{V_{2:2}}\left(x\right)}{F_{W_{2:2}}\left(x\right)}\hfill \\ & =& \left\{1-p_1\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1{p}_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & /& \left\{1-p_1^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+p_1^{*}{p}_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \end{array}$$

is increasing in x. Since $p_1\ge p_2$ and $p_1^{*}\ge p_2^{*}$, there exist positive real numbers d and c such that $p_1=d+p_2$ and $p_1^{*}=c+p_2^{*}$, and then we can rewrite $\mathsf{\Omega }\left(x\right)$ as follows:

$$\begin{array}{ccc}\hfill \mathsf{\Omega }\left(x\right)& =& \{1-(d+p_2)\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2\left(1-F^{{\lambda }_2}\left(x\right)\right)+(d+p_2)p_2\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)\}\hfill \\ & \times & \{1-(c+p_2^{*})\left(1-F^{{\lambda }_1}\left(x\right)\right)-p_2^{*}\left(1-F^{{\lambda }_2}\left(x\right)\right)+(c+p_2^{*})p_2^{*}\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right){\}}^{-1}.\hfill \end{array}$$

Let us consider $L(x;a,b)$ as follows:

$$\begin{array}{ccc}\hfill L(x;a,b)& =& \tilde{r}\left(x\right)\times \{(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)+a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & \times & \{1-(b+a)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a\left(1-F^{{\lambda }_2}\left(x\right)\right)+(b+a)a\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right){\}}^{-1},\hfill \end{array}$$

where $\tilde{r}\left(x\right)=\frac{f\left(x\right)}{F\left(x\right)}$. We can then see easily that

$$\begin{array}{c}\hfill L(x;a,b)=\frac{g^{\prime }(x;a,b)}{g(x;a,b)},\end{array}$$

where $g^{\prime }(x;a,b)=\frac{\partial g(x;a,b)}{\partial x}$ and

$$\begin{array}{ccc}\hfill g(x;a,b)& =& 1-(b+a)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a\left(1-F^{{\lambda }_2}\left(x\right)\right)+(b+a)a\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right).\hfill \end{array}$$

Because

$$\begin{array}{c}\hfill \mathsf{\Omega }\left(x\right)=\frac{g(x;p_2,d)}{g(x;p_2^{*},c)},\end{array}$$

according to Lemma 3, we have

$$\begin{array}{c}\hfill \frac{\partial \mathsf{\Omega }\left(x\right)}{\partial x}=\mathsf{\Omega }\left(x\right)\left\{L(x;p_2,d)-L(x;p_2^{*},c)\right\},\end{array}$$

(2)

and clearly, for proving increasing property of $\mathsf{\Omega }\left(x\right)$ with respect to x, it is enough to prove that the function $L(x;a,b)$ is increasing in a and also in b. First, we have

$$\begin{array}{ccc}\hfill \frac{\partial L(x;a,b)}{\partial a}& \stackrel{sgn}{=}& \{{\lambda }_1{F}^{{\lambda }_1}\left(x\right)+{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-(2a+b){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (2a+b){\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & \times & \{1-(b+a)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a)a\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\}\hfill \\ & -& \{-\left(1-F^{{\lambda }_1}\left(x\right)\right)-\left(1-F^{{\lambda }_2}\left(x\right)\right)+(2a+b)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)\}\hfill \\ & \times & \{(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)+a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right)-(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& {\lambda }_2{F}^{{\lambda }_2}\left(x\right)-(b+a){\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (2a+b){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+\{(2a+b)(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\hfill \\ & \times & \left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\}+(2a+b)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& (2a+b)(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& (2a+b){\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& (2a+b)(b+a){\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+(2a+b)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (2a+b)(b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & -& (b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2+(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & -& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (2a+b)(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (2a+b)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (2a+b)(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& (2a+b)(b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right)-2a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+a^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& {\lambda }_2{F}^{{\lambda }_2}\left(x\right)-2(b+a){\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)+{(b+a)}^2{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left[1-a\left(1-F^{{\lambda }_2}\left(x\right)\right)\right]}^2+{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left[1-(b+a)\left(1-F^{{\lambda }_1}\left(x\right)\right)\right]}^2\hfill \\ & \ge & 0,\hfill \end{array}$$

which shows that $L(x;a,b)$ is increasing in a. Next, we also have

$$\begin{array}{ccc}\hfill \frac{\partial L(x;a,b)}{\partial b}& \stackrel{sgn}{=}& \left\{{\lambda }_1{F}^{{\lambda }_1}\left(x\right)-a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\right\}\hfill \\ & \times & \{1-(b+a)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a\left(1-F^{{\lambda }_2}\left(x\right)\right)+(b+a)a\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)\}\hfill \\ & -& \left\{-\left(1-F^{{\lambda }_1}\left(x\right)\right)+a\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\right\}\hfill \\ & \times & \{(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)+a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)-(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\}\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right)-(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)+(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& a^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2-(b+a)a^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & {\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2-a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& (b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\hfill \\ & +& a^2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)-\{(b+a)a^2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\hfill \\ & \times & {\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\}+(b+a){\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & +& a{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)-\{(b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\hfill \\ & \times & \left(1-F^{{\lambda }_2}\left(x\right)\right)\}-(b+a)a{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\hfill \\ & -& (b+a)a{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & -& a^2{\lambda }_2{F}^{{\lambda }_2}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right)\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & +& (b+a)a^2{\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left(1-F^{{\lambda }_1}\left(x\right)\right){\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\hfill \\ & +& (b+a)a^2{\lambda }_2{F}^{{\lambda }_2}\left(x\right){\left(1-F^{{\lambda }_1}\left(x\right)\right)}^2\left(1-F^{{\lambda }_2}\left(x\right)\right)\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right)\left[1-2a\left(1-F^{{\lambda }_2}\left(x\right)\right)+{\left(1-F^{{\lambda }_2}\left(x\right)\right)}^2\right]\hfill \\ & =& {\lambda }_1{F}^{{\lambda }_1}\left(x\right){\left[1-a\left(1-F^{{\lambda }_2}\left(x\right)\right)\right]}^2\hfill \\ & \ge & 0,\hfill \end{array}$$

which shows that $L(x;a,b)$ is increasing in b. Now, since $L(x;a,b)$ is increasing in a and $p_2\ge p_2^{*}$, we have

$$\begin{array}{c}\hfill L(x;p_2,d)\ge L(x;p_2^{*},d).\end{array}$$

(3)

Further, since $L(x;a,b)$ is increasing in b and $d\ge c$ (because $d=p_1-p_2\ge p_1^{*}-p_2^{*}=c$), we have

$$\begin{array}{c}\hfill L(x;p_2^{*},d)\ge L(x;p_2^{*},c).\end{array}$$

(4)

Upon combining (3) and (4), we have

$$\begin{array}{c}\hfill L(x;p_2,d)\ge L(x;p_2^{*},c),\end{array}$$

or

$$\begin{array}{c}\hfill L(x;p_2,d)-L(x;p_2^{*},c)\ge 0,\end{array}$$

(5)

Next, from (2) and (5), we get $\frac{\partial \mathsf{\Omega }\left(x\right)}{\partial x}\ge 0$, and then the desired result is obtained.

□

Remark 2.

The results of Theorem 2 also hold under the following conditions:

1. 

$p_2^{*}\le p_1^{*}\le p_2\le p_1$ and $p_1-p_2=p_1^{*}-p_2^{*}$;

2. 

$p_2^{*}\le p_2\le p_1^{*}\le p_1$ and $p_1-p_2=p_1^{*}-p_2^{*}$.

5. Usual Stochastic Order

In this section, we present some stochastic comparisons of parallel systems for different components and different probabilities of starters in terms of the usual stochastic order.

Theorem 3.

Suppose $X_1,\cdots ,X_n$ ($X_1^{*},\cdots ,X_n^{*}$) are independent non-negative random variables with $X_i\sim PRHR\left(\lambda \right)$ ($X_i^{*}\sim PRHR\left({\lambda }^{*}\right)$), $i=1,\cdots ,n$. Further, suppose $I_{p_1},\cdots ,I_{p_n}$ ($I_{p_1^{*}},\cdots ,I_{p_n^{*}}$) are independent Bernoulli random variables, independently of $X_i$s and $X_i^{*}$s, with $E\left(I_{p_i}\right)=p_i$ and $E\left(I_{p_i^{*}}\right)=p_i^{*}$, $i=1,\cdots ,n$. Let $V_{n:n}=max\{X_1{I}_{p_1},\cdots ,X_n{I}_{p_n}\}$ and $W_{n:n}=max\{X_1^{*}{I}_{p_1^{*}},\cdots ,X_n^{*}{I}_{p_n^{*}}\}$. If $\lambda \ge {\lambda }^{*}$ and $\mathit{p}\stackrel{m}{⪰}{\mathit{p}}^{*}$, then $V_{n:n}{\ge }_{st}{W}_{n:n}$.

Proof. 

Let us denote $s(\mathit{p},\lambda ;x)=1-{\prod }_{i=1}^n\left[1-p_i\left(1-F^{\lambda }\left(x\right)\right)\right]$. For $\lambda \ge {\lambda }^{*}$, we can observe that $s(\mathit{p},\lambda ;x)\ge s(\mathit{p},{\lambda }^{*};x)$. For obtaining the desired result, it is sufficient to observe that $s(\mathit{p},{\lambda }^{*};x)\ge s({\mathit{p}}^{*},{\lambda }^{*};x)$. Therefore, we have to check Conditions (i) and (ii) of Lemma 1. It is then evident that $s(\mathit{p},{\lambda }^{*};x)$ is symmetric with respect to $\mathit{p}$, for any x. Additionally, for any $i\ne j$, we have

$$\begin{array}{c}\hfill \frac{\partial s(\mathit{p},{\lambda }^{*};x)}{\partial p_k}=\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\prod _{i=1,i\ne k}^n\left[1-p_i\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\right].\end{array}$$

Thus, we get

$$\begin{array}{ccc}\hfill (p_i-p_j)\left\{\frac{\partial s(\mathit{p},{\lambda }^{*};x)}{\partial p_i}-\frac{\partial s(\mathit{p},{\lambda }^{*};x)}{\partial p_j}\right\}& =& (p_i-p_j)\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\prod _{k=1,k\ne i,k\ne j}^n\hfill \\ & \times & \left[1-p_k\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\right]\hfill \\ & \times & \left\{\left[1-p_j\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\right]-\left[1-p_i\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\right]\right\}\hfill \\ & =& {(p_i-p_j)}^2{\left(1-F^{{\lambda }^{*}}\left(x\right)\right)}^2\hfill \\ & \times & \prod _{k=1,k\ne i,k\ne j}^n\left[1-p_k\left(1-F^{{\lambda }^{*}}\left(x\right)\right)\right]\hfill \\ & \ge & 0.\hfill \end{array}$$

Hence, $s(\mathit{p},{\lambda }^{*};x)$ is Schur-convex with respect to $\mathit{p}$, for any x. This implies that $V_{n:n}{\ge }_{st}{W}_{n:n}$, as required. □

6. Concluding Remarks

A parallel system is one of the most commonly used coherent systems in practice. For this reason, a careful study of its performance characteristics, such as reliability function, hazard function and reversed hazard function, based on the characteristics of the component lifetime distribution, is of great interest to reliability engineers. In this work, we have focused our attention primarily on a parallel system with two components as a parallel system with more components can be decomposed into many subsystems with two components in parallel. One of the prominent examples of a two-component parallel system is a twin-engine jet system, which, in addition to being safer than a single-engine jet system, is more efficient in terms of fuel consumption than a jet system with more than two engines.

Specifically, we have proved the hazard rate and reversed hazard rate orders of parallel systems with two components having proportional hazard rates and starting devices.

It will be of interest to consider the problems discussed here by allowing dependence between components using some general copulas for the joint distribution of lifetime components. We are working in this direction at the present time and will present the corresponding results in the future.