Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127442499, #quickstatements; #temporary_batch_1722421251154 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00066-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970686413 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127442499 / rank | |||
Normal rank | |||
Latest revision as of 11:23, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Different transformations for solving non-convex trim-loss problems by MINLP |
scientific article |
Statements
Different transformations for solving non-convex trim-loss problems by MINLP (English)
0 references
22 February 2001
0 references
optimization
0 references
mixed integer nonlinear programming
0 references
integer linear programming
0 references
trim-loss problems
0 references
