In the linear case, in the primal problem, from each sub-optimal point that satisfies all the constraints, there is a direction or subspace of directions to move that increases the objective function.
In the dual problem, the dual vector multiplies the constraints that determine the positions of the constraints in the primal.