BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//6.6.4.4//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:0-221@aerospace.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20210721T133000

DTEND;TZID=Asia/Jerusalem:20210721T143000

DTSTAMP:20230403T143854Z

URL:https://aerospace.technion.ac.il/events/economic-dispatch-for-a-networ
 k-of-micro-gas-turbines/

SUMMARY:Economic Dispatch for a Network of Micro-Gas Turbines
DESCRIPTION:Lecturer:Nati Peleg\n Faculty:Department of Aerospace Engineeri
 ng\n Institute:Technion – Israel Institute of Technology\n Location:Clas
 sroom 165\, ground floor\, Library\, Aerospace Eng. + https://technion.zoo
 m.us/j/92355833611\n Zoom: \n Abstract: \n Details: \n As industry\, busin
 esses\, and families day to day life rely more and more on new technologie
 s and electrical appliances\, economic reports present a growth in energy 
 demand. This leads to the need for additional energy suppliers\, which are
  usually smaller\, spread around (geographically)\, and integrated to the 
 power grid in "smart" manner.  The shift to distributed power generation 
 creates challenges related to their operation.\nWe propose a novel approac
 h for solving an economic dispatch (ED) problem of a power network compris
 ed of micro-gas turbines (MGT) together with a utility. The ED problem is 
 naturally formulated as a mixed-integer nonlinear optimization problem whi
 ch is known to be computationally difficult to solve.  We present a numer
 ically efficient solution to this problem by decomposing the ED algorithm 
 into two parts. The first part of the decomposition attains an analytic so
 lution for allocating the output power of each MGT as a function of the to
 tal requested power. The second part determines the desired total output p
 ower from the MGTs by modeling all the generators as a single unit.  In t
 his way\, the problem reduces to a standard ED problem\, and we show how t
 o solve this efficiently using the celebrated shortest path algorithm.  T
 his new approach significantly reduces the run-time needed to solve a comp
 lex optimization problem. We support our results with a numerical study.\n
 Zoom Meeting
CATEGORIES:Seminars
LOCATION:Classroom 165\, ground floor\, Library\, Aerospace Eng. + https://
 technion.zoom.us/j/92355833611

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:DAYLIGHT

DTSTART:20210326T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

END:VTIMEZONE
END:VCALENDAR