At the current basic feasible solution (bfs) $v_0 (v_0 \in \mathbb{R}^5)$, the simplex method yields the following form of a linear programming problem in standard form:

minimize $z = -x_1 - 2x_2$

s.t.

$x_3 = 2 + 2x_1 - x_2$

$x_4 = 7 + x_1 - 2x_2$

$x_5 = 3 - x_1$

$x_1, x_2, x_3, x_4, x_5 \geq 0$

Here the objective function is written as a function of the non-basic variables. If the simplex method moves to the adjacent bfs $v_1 (v_1 \in \mathbb{R}^5)$ that best improves the objective function, which of the following represents the objective function at $v_1$, assuming that the objective function is written in the same manner as above?

Maximize $$\,\,\,\,\,\,\,\,\,Z = 5{x_1} + 3{x_2}$$
Subject to $$\,\,\,\,\,\,\,\,\,\,{x_1} + 2{x_2} \le 10,$$
$$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,{x_1} - {x_2} \le 8, \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,{x_1},{x_2} \ge 0 \cr} $$

In the starting simplex tableau, $${x_1}$$ and $${x_2}$$ are non-basic variables and the value of $$Z$$ is zero. The value of $$Z$$ in the next simplex tableau is __________________.

Two models, $$P$$ and $$Q,$$ of a product earn profits of Rs. $$100$$ and Rs. $$80$$ per piece, respectively. Production times for $$P$$ and $$Q$$ are $$5$$ hours and $$3$$ hours, respectively, while the total production time available is $$150$$ hours. For a total batch size of $$40,$$ to maximize profit, the number of units of $$P$$ to be produced is ____________.

A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below provides the machining time required for each part and the maximum machining time available on each machine. The profit per unit on parts $${\rm I}$$ and $${\rm II}$$ are Rs. $$40$$ and Rs. $$100,$$ respectively. The maximum profit per week of the firm is Rs. _______________