In Linear Programming say in $R^2$ if you have a factory that can produce 2 products P1 and P2 and if 100% for P1 then it can produce 15 or 100% P2 it can produce 12 and assuming a linear relationship, often we are asked to find the convex set of points feasible for this linear relation. In this case the 2 linear points are (0,12) and (15,0) and thus the line equation for maximum production is $y = -4/5x + 12$.
My question is why is the equation for the convex set of feasible points $y/12 + x/15 \le 1$.
How is the above mathematically derived as it clearly works?
If you multiply your second inequality by $12$, you get $$ \frac{12}{12} y + \frac{12}{15} x \le 12 \iff y + \frac{4}{5}x \le 12, $$ so this is really the same equation, constraining your production as an upper bound.
UPDATE
If there were 3 products, you would be bounding by the plane passing through the points $(a,0,0), (0,b,0)$ and $(0,0,c)$, which would have the equation $$ \frac{x}{a} + \frac{y}{b} + \frac{z}{c} = 1 $$ and in general, you have a hyperplane like that, inducing the inequality with $\le 1$ instead.