Assertion (A): The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP).
Reason (R): The region representing \( Z = 50x + 70y \) such that \( Z < 380 \) does not have any point common with the feasible region.
For a Linear Programming Problem, find min \( Z = 5x + 3y \) (where \( Z \) is the objective function) for the feasible region shaded in the given figure. 
Match the following:
In the following, \( [x] \) denotes the greatest integer less than or equal to \( x \). 
Choose the correct answer from the options given below:
For x < 0:
f(x) = ex + ax
For x ≥ 0:
f(x) = b(x - 1)2
Linear programming is a mathematical technique for increasing the efficiency and effectiveness of operations under specific constraints. The main determination of linear programming is to optimize or minimize a numerical value. It is built of linear functions with linear equations or inequalities restricting variables.