Implementation of mixed-integer programming on embedded system

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F15%3A43872318" target="_blank" >RIV/70883521:28140/15:43872318 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Implementation of mixed-integer programming on embedded system

Popis výsledku v původním jazyce

One of the most widespread modern control strategies is the discrete-time Model Predictive Control (MPC) method which requires the solution of the quadratic programming problem. For systems with binary input variables the quadratic problem is replaced bymore challenging Mixed-Integer Quadratic Programming (MIQP) problem. The objective of this work is the implementation of MIQP problem solver in a low power embedded computing platform with limited computational power and limited memory. The MIQP problemis solved using branch-and-bound method and the solution of the relaxed original quadratic problems with equality and inequality constraints solved in the nodes of a binary tree is found with interior-point algorithm. A simulation study of the reserve constrained economic dispatch problem for power generators with prohibited zones is presented. Simulation results show the applicability of the proposed solver for small size MIQP problems.

Název v anglickém jazyce

Implementation of mixed-integer programming on embedded system

Popis výsledku anglicky

One of the most widespread modern control strategies is the discrete-time Model Predictive Control (MPC) method which requires the solution of the quadratic programming problem. For systems with binary input variables the quadratic problem is replaced bymore challenging Mixed-Integer Quadratic Programming (MIQP) problem. The objective of this work is the implementation of MIQP problem solver in a low power embedded computing platform with limited computational power and limited memory. The MIQP problemis solved using branch-and-bound method and the solution of the relaxed original quadratic problems with equality and inequality constraints solved in the nodes of a binary tree is found with interior-point algorithm. A simulation study of the reserve constrained economic dispatch problem for power generators with prohibited zones is presented. Simulation results show the applicability of the proposed solver for small size MIQP problems.

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Procedia Engineering

ISBN

—

ISSN

1877-7058

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1649-1656

Název nakladatele

Elsevier BV

Místo vydání

Amsterdam

Místo konání akce

Vídeň

Datum konání akce

26. 11. 2014

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—