The minimum value of such that: is:
- A
- B
- C
- D
Solution & Step-by-step Explanation

We want to minimize subject to non-negativity constraints and other linear constraints.Since and are non-negative, the smallest possible value for and is 0.At , .Check if satisfies all constraints: (True) (True) (True)Since is in the feasible region and , no other point can yield a smaller value for .Thus, the minimum value is 0.