Paper Generator

The feasible region of a linear programming problem with objective function Z = 5x + 7y is shown below :
The maximum value of Z - minimum value of Z is

The degree of an objective function of a linear programming problem is

Solve the following linear programming problem graphically :
Minimize $Z = 13x - 15y$
Subject to constraints
$$x + y \leq 7,$$
$$2x - 3y + 6 \geq 0,$$
$$x \geq 0, y \geq 0$$

Solve the following Linear Programming Problem graphically: Maximise $Z=600x+400y$ subject to the constraints $x+2y\le12$, $2x+y\le12$, $4x+5y\ge20$, $x, y\ge0$

Solve the following Linear Programming Problem graphically: Maximize $Z=\frac{2x}{5}+\frac{3y}{10}$ subject to constraints $2x+y\le 1000$, $x+y\le 800$, $x, y \ge 0$.

Solve the following Linear Programming Problem graphically: Maximise $Z=200x+120y$ subject to the constraints $x+y\le 300$, $3x+y\le 600$, $x-y\ge -100$, $x,y\ge 0$

Solve the following linear programming problem graphically: Maximize $Z=10500x+9000y$ Subject to constraints $x+y \le 50$, $2x+y \le 80$, $x, y \ge 0$

The region represented by the system of inequations $3x+y\ge 3$, $2x-y\ge -5$, $x, y\ge 0$ is:

In a linear programming problem, the linear function which has to be maximized or minimized is called

For the feasible region shown below, the non-trivial constraints of the linear programming problem are

In the graph, the feasible region representing the Linear Programming Problem for maximising objective function $Z=px+qy$, $p, q>0$ is shaded. If all points on segment AB give max (Z), then which of the following is true? [Graph shows A at (0, 5) and B at (3, 4)]

The corner points of the feasible region determined by the system of linear constraints are (0,0), (0, 40), (20, 40), (60, 20) and (60, 0). If the objective function of an LPP is $Z=4x+3y$, then the maximum value is :

Solve the following linear programming problem graphically :
Minimize
$Z = 13x – 15y$
Subject to constraints
$x + y \le 7$,
$2x – 3y + 6 \le 0$,
$x \ge 0, y \ge 0$

In the Linear Programming Problem for objective function $Z=18x+10y$ subject to constraints $4x+y\ge20$, $2x+3y\ge30$, $x,y\ge0$ find the minimum value of Z.

In a Linear Programming Problem, the objective function $Z=5x+4y$ needs to be maximised under constraints $3x+y\le6$, $x\le1$, $x, y\ge0$. Express the LPP on the graph and shade the feasible region and mark the corner points.

Consider the Linear Programming Problem, where the objective function $Z=(x+4y)$ needs to be minimized subject to constraints $2x+y\ge1000$, $x+2y\ge800$, $x,y\ge0$. Draw a neat graph of the feasible region and find the minimum value of Z.

In the Linear Programming Problem (LPP), find the point/points giving maximum value for $Z=5x+10y$ subject to constraints $x+2y\le120$, $x+y\ge60$, $x-2y\ge0$, $x, y\ge0$.

Solve the following Linear Programming Problem using graphical method: Maximise $Z=100x+50y$ subject to the constraints $3x+y\le600$, $x+y\le300$, $y\le x+200$, $x\ge0$, $y\ge0$.

Solve the following linear programming problem graphically: Minimise $Z=x-5y$ subject to the constraints: $x-y\ge0$, $-x+2y\ge2$, $x\ge3$, $y\le4$, $y\ge0$.

Solve the following linear programming problem graphically: Maximise $Z=x+2y$ Subject to the constraints: $x-y\ge0$, $x-2y\ge-2$, $x\ge0$, $y\ge0$.