We define the “relative” fractional independence number of a graph$G$with respect to another graph$H$, as where the maximum is taken over all graphs$W$.,$G \boxtimes W$is the strong product of$G$and$W$, and$\alpha$denotes the independence number. We give a nontrivial linear program to compute$\alpha^{*}(G\vert H)$, and discuss some of its properties. We show that$\alpha^{*}(G\vert H) \geq \frac{X(G)}{X(H)}\geq-\frac{1}{\alpha^{*}(H\vert G)}$, where$X(G)$can be the independence number, the Shannon capacity, the fractional independence number, the Lovász number, or the Schrijver's or Szegedy's variants of the Lovász number of a graph$G$, This inequality is the first explicit nontrivial upper bound on the ratio of the invariants of two arbitrary graphs, as mentioned earlier, which can also be used to obtain upper or lower bounds for these invariants. As explicit applications, we present new upper bounds for the ratio of the Shannon capacity of two Cayley graphs and compute new lower bounds on the Shannon capacity of certain Johnson graphs (yielding the exact value of their Haemers number). Moreover, we show that$\alpha^{*}(G\vert H)$can be used to present a stronger version of the well-known No-Homomorphism Lemma.