A triplet (a,b,c) of positive integers is said to be product-feasible if there exist algebraic numbers α, β and γ of degrees (over Q) a, b and c, respectively, such that αβγ=1. This work extends the investigation of product-feasible triplets started by Drungilas, Dubickas and Smyth. More precisely, for all but five positive integer triplets (a,b,c) with a≤b≤c and b≤7, we decide whether it is product-feasible. Moreover, in the Appendix we give an infinite family or irreducible compositum-feasible triplets and propose a problem to find all such triplets.