Strong duality guarantees equal optimal values for a feasible linear program with a finite optimum and its dual. If the primal is unbounded above, the dual cannot have a feasible finite upper bound, so it is infeasible. But primal infeasibility alone does not force dual unboundedness. Both problems can be infeasible. Keep these logical directions separate when diagnosing solver statuses.
