RELAXATIONS OF ROBUST LINEAR PROGRAMS AND VERIFICATION OF EXACTNESS

摘要: Abstract Motivated by a robust positive real synthesis problem, we consider linear programming problems with the main goal of verifying whether computed solution particular LMI relaxation is exact. It it shown that this requires to solve polynomial system equations. The contribution paper an algorithm systems. Contrary existing approaches, suggest technique which does not require computation Grobner basis ideal generated polynomials define