Unrestricted variables in linear programming (Q915645): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4126046 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding all vertices of a convex polyhedron / rank | |||
Normal rank | |||
Latest revision as of 09:33, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unrestricted variables in linear programming |
scientific article |
Statements
Unrestricted variables in linear programming (English)
0 references
1991
0 references
There are a number of ways of dealing with a linear programming problem in which some variables are allowed to take on negative values. One of these methods, which is either ignored or mentioned only incidentally in most textbooks, requires only one additional variable to be introduced regardless of how many unrestricted variables the original problem has. In this note, this method is interpreted geometrically and an application to the computation of extreme points is given.
0 references
unrestricted variables
0 references
extreme points
0 references
0 references
