The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276)
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 5726757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complex interior-boundary method for linear and nonlinear programming with linear constraints |
scientific article; zbMATH DE number 5726757 |
Statements
The complex interior-boundary method for linear and nonlinear programming with linear constraints (English)
0 references
25 June 2010
0 references
linear programming
0 references
linearly constrained pivoting
0 references
interior direction
0 references
computational efficiency
0 references
comparison of methods
0 references
numerical examples
0 references
complex method
0 references
complex interior-boundary method
0 references
simplex method
0 references
nonlinear programming
0 references
interior-point methods
0 references
reduced gradient methods
0 references
convex programs
0 references
0 references
0 references
0.831027090549469
0 references
0.7949422597885132
0 references
0.7863871455192566
0 references
0.781686544418335
0 references
