Abstract
The symmetric groups Sn and the cyclic groups Cn essentially are the only examples for symmetry groups of linear or integer programs that have been discussed in the literature, see e.g. [5] and [6]. In [4], Bodi, Herr, and Joswig developed some ideas to tackle linear and integer programs with arbitrary groups of symmetries. However, the question remained whether or not there are linear (integer) programs with groups of symmetries other than Sn and Cn. Indeed, we show in this short note that every finite permutation group is the full symmetry group of a suitable linear or integer program. Some of our constructions are based on graph theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
