PROBABILITY THEORY:BIVARIATE PROBABILITY DISTRIBUTION

By -
BIVARIATE PROBABILITY DISTRIBUTION

Thus far the discussion has been concerned with the probability distribution of a single random variable, e.g., the demand for a product during the first month or the demand for a product during the second month. In an experiment that measures the demand during the first 2 months, it may well be important to look at the probability distribution of the vector random variable (X1, X2), the demand during the first month, and the demand during the second month, respectively,

INTRODUCTION TO OPERATIONS RESEARCH-0577

dom variable X1 taken on values less than or equal to b1, and X2 takes on values less than or equal to b2. Then P{EX , X2} denotes the probability of this event. In the above example of the demand for a product during the first 2 months, suppose that the sample space n consists of the set of all possible points w, where w represents a pair of nonnegative integer values (x1,x2). Assume that x1 and x2 are bounded by 99. Thus, there are (100)2w points in n. Suppose further that each point w has associated with it a probability equal to 1/(100)2, except for the points w = (0,0) and w = (99,99). The probability associated with the event {0,0} will be 1.5/(100)2, that is, P{0,0} = 1.5/(100)2, and the probability associated with the event {99,99} will be 0.5/(100)2; that is, P{99,99} = 0.5/(100)2. Thus, if there is interest in the “bivariate” random variable (X1, X2), the demand during the first and second months, respectively, then the event

INTRODUCTION TO OPERATIONS RESEARCH-0577

A similar calculation can be made for any value of b1 and b2.

For any given bivariate random variable (X1, X2), P{X1 ::: b1, X2 ::: b2} is denoted by

INTRODUCTION TO OPERATIONS RESEARCH-0578

INTRODUCTION TO OPERATIONS RESEARCH-0579

(which is analogous to what was done for a univariate random variable). This causes no difficulty, even for bivariate random variables having one or more components that can- not take on negative values or are restricted to other regions. In this case, fX X (s, t) can be defined to be zero over the inadmissible part of the plane. In fact, the only requirements for a function to be a bivariate density function are that

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more