Is the canonical form of LP programs unambiguous?
Because oddly I've seen some notes describe the canonical form as replacing $\leq$ constraints with $=$. While some other notes said that canonical forms "only have $\leq$ constraints".
So what's the canonical form of LP programs?