linear programming (lp) problems with linear objective and linear constraints (Q6825528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Prototypical convex program; solved by simplex and interior-point methods.
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | linear programming (lp) problems with linear objective and linear constraints |
Prototypical convex program; solved by simplex and interior-point methods. |
Statements
0 references
0 references
