A canonical form of primal linear program is$$    \text{minimize } c^T \cdot x \\    \text{subject to } Ax = b, x \geq 0$$The dual is$$    \text{maximize } b^T \cdot y \\    \text{subject to } z \equiv c - A^T y \geq 0$$As far as I know $y$ are called Lagrange multipliers. How do you refer to the other terms, i.e. $A,b,c,x$ and $z$ in LP (and SDP)?
LP and SDP nomenclature
convex optimization;linear programming