Algorithm 1 MP-AL
1:	Input: L: set of labeled instances; U: set of unlabeled instances; b: batch size;
2:	Output: S: query set;
3:	Compute K1, k2 and k3, as explained in Section 2.2.
4:	if QP Problem then
5:	Compute α by solving (11).
6:	end if
7:	if LP Problem then
8:	Form D matrix as explained in Section 2.3.
9:	Compute α by solving (13).
10:	end if
11:	Sort U in descending order of α and select top b instances as S.
12:	Update sets L and U: L → L ∪ S, U → U\S.