more solved examples for probability

Graphical Method of Solution of a Linear Programming Problem - So far we have learnt how to construct a mathematical model for a linear programming problem. If we can find the values of the decision variables x 1 , x 2 , x 3 , ..... x n , which can optimise (maximize or minimize) the objective func..

Probability of solving a specific problem independently by A and B are respectively. If both try to solve the problem independently, find the probability that the problems be solved..

Find two positive numbers whose sum is at least 15 and whose difference is at the most 7 such that their product is maximum. Before solving this problem, we have to state the prob..

Baye's Theorem - In the previous section, we have learnt that i) If A and B are two mutually exclusive events, then ii) Before we state and prove Baye's Theorem, we use the above two rules to state the law of total probability. The law of total probability is useful in proving B..

Applications - After the elementary study in probability, let us see how we can utilise this basic knowledge in solving problems of different are..

Introduction - Arrangement and selection of objects are the central ideas of this chapter on permutations and combinations. They are widely applied in solving problems of probability, genetic engineering and life scienc..

Introduction - Arrangement and selection of objects are the central ideas of this chapter on permutations and combinations. They are widely applied in solving problems of probability, genetic engineering and life science..

Introduction - We are already familiar with graphical reorientation of linear equations and inequations. This chapter describes the application of linear equations and inequations in solving different kinds of practical problems. Let us consider few examples to understand what w..

To maximise Z draw a line parallel to ax + by = k and farthest from the origin. This line should contain at least one point of the feasible region. Find the coordinates of this point by solving the equations of the lines on which it lies. To minimise Z draw a line parallel to ax + by = ..

The graphical method of solving an LPP is possible only if there are two decision variables (say x and y). This method is not suitable if there are three or more decision variables. In this case, there is a powerful method called 'simplex method'. The wide usage of liner programming helps..