Convex optimization: Difference between revisions

Content deleted Content added
remove unnecessary citation for first sentence of the lead
Tags: Mobile edit Mobile web edit
Line 58:
& &x \in (b+L)\cap K
\end{align}</math>
where K is a closed [[Convex cone|pointed convex cone]], L is a [[linear subspace]] of R''<sup>n</sup>'', and b is a vector in R''<sup>n</sup>''. A linear program in standard form inis the special case in which K is the nonnegative orthant of R''<sup>n</sup>''.
 
=== Eliminating linear equality constraints ===