I have two cones $A$ and $B$ in a Euclidean space. I want to show that $\mathrm{Conv}\,A=\mathrm{Dual}\,B$; that is, $a\in\mathrm{Conv}\,A$ if and only if $\langle a,b\rangle\ge 0$ for any $b\in B$.
The inclusion $\mathrm{Conv}\,A\subset \mathrm{Dual}\, B$ (or equivalently $\mathrm{Dual}\,A\supset \mathrm{Conv}\,B$) is easy --- one has to check $\langle a,b\rangle\ge 0$ for pairs $a\in A$ and $b\in B$. It remains to show the opposite inclusion $\mathrm{Conv}\,A\supset \mathrm{Dual}\,B$. I see that in principle it can be done by calculations.
Do you know tricks that help to prove the opposite inclusion $\mathrm{Conv}\,A\supset \mathrm{Dual}\,B$? Is there software that can help?
The cones $A$ and $B$ are very concrete; they are given by few algebraic identities and inequalities in $\mathbb R^{10}$. (In principle I could describe the sets of vectors here, but I do not think it might help.)