Definition 3.2 [1]}
Given \(\mathcal {A}= (a_{i_1 i_2 ... i_m}) \in T_{m,n} \)  and \(q\in \mathbb {R}^n\) , a vector \(x\in \mathbb {R}^n\)  is said to be (strictly) feasible solution of TCP\((q,\mathcal {A})\)  defined by (REF ) if \(x(>) \ge 0\)  and \(\mathcal {A}x^{m-1}+q (>) \ge 0\) . TCP\((q,\mathcal {A})\)  defined by (REF ) is said to be (strictly) feasible if a (strictly) feasible vector exists. The set of feasible solutions of TCP\((q,\mathcal {A})\)  is denoted by FEA\((q,\mathcal {A}) = \lbrace  x\in \mathbb {R}^n : x\ge 0,\; \mathcal {A}x^{m-1} +q \ge 0\rbrace .\)

