The paper proposes multi-operation blank localization to fit final product geometries into near net shape blanks. Groups of machining features are located subject to tolerance intervals on their relative positions and a lower bound on the machining allowance which accommodates for uncertainties of measurement and machining. The tolerance error, i.e., the deviation of the resulting dimensions from the center of the tolerance intervals is minimized. The blank localization problem is formulated as a convex quadratically constrained quadratic program that can be solved efficiently for parts with real-life complexity, as demonstrated by a case study from the automotive industry.