An instance of a balanced optimization problem with vector costs consists of a ground set X. a cost-vector for every element of X. and a system of feasible subsets over X. The goal is to find a feasible subset that minimizes the so-called imbalance of values in every coordinate of the underlying vector costs. https://www.diegojavierfares.com/best-flash-Umcka-Cold-Flu-4-OZSyrupBerry-amazing-save/