Mathematics Tes...

A linear programming model is an example of a

The feasible region for an LPP is shown in the given figure. Let F = 3x - 4y be the objective function. The maximum value of F is?

In an Linear programming problem, the restrictions or limitations under which the objective function is to be optimised are called

Corner points of the feasible region determined by the system of linear constrains are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is?

The problem of maximizing z = x₁ - x₂ subject to constraints x₁ + x₂ ≤ 10, x₁ ≥ 0, x₂ ≥ 0 and x₂ ≤ 5 has

The following LPP problem has

Z_min = 1.5x₁ + 4.5x₂

Subject to

x₁ + 3x₂ > 3

x₁ + x₂ > 2

x₁, x₂ > 0

If m is the number of constraints in a linear programming with two variables x and y and non – negative constraints x ≥ 0, y ≥ 0. The feasible region in the graphical solution will be surrounded by how many lines?

Consider the following linear programming problem:

Maximize z = 6x + 10y

Subject to x ≤ 4

y ≤ 6

3x + 2y ≤ 18

x ≥ 0, y ≥ 0

For a company manufacturing products X and Y, details are given below: Then which of the following mathematical formulation is correct for this L.P.P. to maximize the profit?

Where the number of the products of X and Y types are x  and y.

In case of solution of a two variable linear programming problem by graphical method one constraint line come parallel to the objective function line. Which one of the following is correct?