Hi I have a question with regarding to a linear programming question.

suppose the problem has a disk constraint of the form

x^2+y^2<=1. this constraint is non linear and hence cannot b written in the form of AX<=b. for some finite matrix A and vector b. describe a construction of an infinite number of linear constraints on x such that the feasible set for all of these constraints together is equal to the disk.

Your help will greatly appreciate.

Thanks

Jupiter