BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:edc963ef-6fbe-4ebd-a8fd-c92a84fda1dd
X-WR-CALNAME:[M2F] Sławek Lasota - University of Warsaw
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20250330T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:edc963ef-6fbe-4ebd-a8fd-c92a84fda1dd
DTSTAMP:20260413T175252Z
CLASS:PUBLIC
DESCRIPTION:**Orbit-finite linear programming**\n\nAn infinite set is orbit
 -finite if\, up to permutations of the underlying structure of atoms\, it 
 has only finitely many elements. We study a generalisation of linear progr
 amming where constraints are expressed by an orbit-finite system of linear
  inequalities over an orbit-finite set of unknowns. As our principal contr
 ibution we provide a decision procedure for checking if such a system has 
 a real solution\, and for computing the minimal/maximal value of a linear 
 objective function over the solution set. We also show undecidability of t
 hese problems in case when only integer solutions are considered. Therefor
 e orbit-finite linear programming is decidable\, while orbit-finite intege
 r linear programming is not.
DTSTART;TZID=Europe/Paris:20230530T140000
DTEND;TZID=Europe/Paris:20230530T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Sławek Lasota - University of Warsaw
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
