Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

If what I assume is correct,

assumption : for a maximization problem, we run a binary search over estimated values, starting with max estimated value, and narrow down to the feasible optimal value with help of ellipsoid method. The ellipsoid method helps us to check for the feasibility of every proposed optimal value.

So we have to find whether a solution lies inside the convex set K of possible solutions. How does the particular initial ellipsoid chosen as an input for the algorithm reflect this solution whose feasibility we have to find out?

share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.