Content deleted Content added
→History: Edit the exact reference to "Lagrange multipliers" which is more specific. |
WhizzyDude (talk | contribs) |
||
Line 67:
When this process is complete the feasible region will be in the form
:<math>\mathbf{A}\mathbf{x} = \mathbf{b},\, \forall
It is also useful to assume that the rank of <math>\mathbf{A}</math> is the number of rows. This results in no loss of generality since otherwise either the system <math>\mathbf{A}\mathbf{x} = \mathbf{b}</math> has redundant equations which can be dropped, or the system is inconsistent and the linear program has no solution.<ref>{{harvtxt|Murty|1983|p=173}}</ref>
| |||