×

zbMATH — the first resource for mathematics

Semidefinite programs and association schemes. (English) Zbl 0956.90029
Summary: We consider semidefinite programs, where the matrices defining the problem all arise from some association scheme. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association scheme.

MSC:
90C22 Semidefinite programming
05E30 Association schemes, strongly regular graphs
90C05 Linear programming
90C35 Programming involving graphs or networks
PDF BibTeX XML Cite
Full Text: DOI