In this paper a mathematical theorem by Samuelson on what he calls the "LeChatelier principle" is generalized, the generalization being closer to the original formulation of the LeChatelier principle than Samuelson's theorem itself. The results obtained are formulated in terms of systems theory and mathematical programming. Examples concerning cost minimization or profit maximization are included.