Constraint exploration method for quadratic programming problem. (Q5931586): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4073134 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Simplex Method for Quadratic Programming / rank | |||
Normal rank | |||
Latest revision as of 16:38, 3 June 2024
scientific article; zbMATH DE number 1591575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constraint exploration method for quadratic programming problem. |
scientific article; zbMATH DE number 1591575 |
Statements
Constraint exploration method for quadratic programming problem. (English)
0 references
25 April 2001
0 references
Constrained minimization
0 references
