MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming
Problem
For the constraints 2x+y≤10,x≥1,y≥0, the point (3,5) is not feasible. Calculate the smallest decrease in the y-coordinate (to the nearest whole number) required to make the point feasible while keeping x unchanged.