An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined w...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IOP conference series. Materials Science and Engineering Ročník 300; číslo 1; s. 12022 - 12032
Hlavní autoři: Sitopu, Joni Wilson, Mawengkang, Herman, Lubis, Riri Syafitri
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.01.2018
Témata:
active constraints
Algorithms
Continuity (mathematics)
direct search
global optimization
Linear programming
Mathematical analysis
Mathematical programming
Mixed integer
Nonlinear programming
ISSN:1757-8981, 1757-899X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the "active constraint" method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/300/1/012022