List of top Mathematics Questions on Linear Programming Problem and its Mathematical Formulation asked in BITSAT

If the constraints in a linear programming problem are changed then
Minimise $Z=\displaystyle\sum_{j=1}^{n} \displaystyle\sum_{i=1}^{m} c_{i j} \cdot x_{i j}$ Subject to $\displaystyle\sum_{ i =1}^{ m } x _{ ij }= b _{ j }, j =1,2, \ldots \ldots n$ $\displaystyle\sum_{j=1}^{n} x_{i j}=b_{j}, j=1,2, \ldots \ldots, m$ is a LPP with number of constraints
It is given that the events A and B are such that P(A) = 1/4, P(A|B) = 1/2, P(B|A) = 2/3
Then P(B) is
The minimum value of the function z = 4x + 3y subject to the constraints:
3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80, x ≥ 0, y ≥ 0.
is:
A person standing on the bank of a river observes that the angle subtended by a tree on the opposite bank is 60^. When he retreats 20 feet from the bank, he finds the angle to be 30^. The breadth of the river in feet is:
In a triangle ABC, C=90^, then (a²-b²)/(a²+b²) is equal to