Linear programming problem

A painter mixes paint A and paint B to get the desired composition of pigments X, Y, and Z. The painter requires at least 10 units of pigment X, 15 units of pigment Y, and 20 units of pigment Z. Both paints come as a 1 kg mixture with the following composition:

A kg of paints A and B cost $\$6$ and $\$4$ respectively. Let $x$ and $y$ represent the units of paints A and B that the painter should buy.

The objective function is:

$Minimize \ z = Q_1x + Q_2y$

The Pigment X constraint is:

$C_1x + C_2y \ge D$

The Pigment Y constraint is:

$E_1x + E_2y \ge F$

The Pigment Z constraint is:

$G_1x + G_2y \ge H$

Find the values of $Q_2, E_2, F, G_1, C_1$ and $H$.

Output format:

1.5 2 3 20 15 7