Unrestricted variables in linear programming (Q915645)
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:
scientific article; zbMATH DE number 4152140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrestricted variables in linear programming |
scientific article; zbMATH DE number 4152140 |
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
0.9065219
0 references
0.89150494
0 references
0.8867527
0 references
0.8817738
0 references
0.86584646
0 references
0 references
0.8627235
0 references
