Generation of disjointly constrained bilinear programming test problems (Q1803651)
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: Generation of disjointly constrained bilinear programming test problems |
scientific article; zbMATH DE number 221492
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of disjointly constrained bilinear programming test problems |
scientific article; zbMATH DE number 221492 |
Statements
Generation of disjointly constrained bilinear programming test problems (English)
0 references
29 June 1993
0 references
The purpose of this paper is to propose a technique for constructing standard bilinear programming test problems with known solutions and properties. The proposed construction technique applies a simple random transformation of variables to a separable bilinear programming problem that is constructed by combining disjoint low-dimensional bilinear programs.
0 references
separable bilinear programming
0 references
0 references
