Difference between revisions of "Simplex"
Jump to navigation
Jump to search
m (cat) |
(improved style) |
||
| Line 1: | Line 1: | ||
| − | A '''simplex''' is the | + | A '''simplex''' is the solution space to an [[optimization]] problem with [[linear]] restraints. The [[simplex method]] is the most common method used for finding optimal solution(s) on a simplex. |
A '''simplex''' is a form of communications in only one direction from the transmitter to the receiver. | A '''simplex''' is a form of communications in only one direction from the transmitter to the receiver. | ||
[[Category:Linear algebra]][[category:telecommunications]] | [[Category:Linear algebra]][[category:telecommunications]] | ||
Revision as of 04:31, October 31, 2009
A simplex is the solution space to an optimization problem with linear restraints. The simplex method is the most common method used for finding optimal solution(s) on a simplex.
A simplex is a form of communications in only one direction from the transmitter to the receiver.