Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique |
scientific article; zbMATH DE number 1239683
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration approach for linear complementarity problems based on a reformulation-linearization technique |
scientific article; zbMATH DE number 1239683 |
Statements
Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (English)
0 references
5 May 1999
0 references
bilinear programming
0 references
implicit enumeration
0 references
linear complementarity problem
0 references
global optimization algorithm
0 references
reformulation linearization technique
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references