Linear Programming

The process of solving an LPP to find the coordinates $(x, y)$ that maximize $Z$ is known as:

What is the maximum number of optimal solutions an LPP can have if it has more than one?

The linear inequalities that limit the values of decision variables are called:

A vendor sells sodas ($x$) and juice ($y$). He wants the number of juices to be no more than 40% of the total bottles. The constraint is:

Which of the following describes the condition where the number of units produced cannot be negative?

A constraint given as $x - y \geq 0$ means:

If a constraint is $x + y \leq 0$ and $x \geq 0, y \geq 0$, the feasible region consists of:

Which inequality represents the region to the right of the line $x = -2$?

If $Z = 2x + 3y$, the value of $Z$ at $(1, 5)$ is:

If the constraints are $y \geq 0$ and $y \leq -2$, the feasible region is:

The feasible region for $x - y \leq 0, x \geq 0, y \geq 0$ contains the point:

In LPP, the constraints $x \geq 0, y \geq 0$ are known as:

Given the objective function $Z = x + 2y$, and corner points $(0, 0), (4, 0), (2, 2), (0, 3)$, what is the maximum value of $Z$?

If $Z = 3x - y$, what is the value of $Z$ at the vertex $(2, 6)$?

In an LPP, the constraints are usually represented by: