Symmetry Groups for Linear Programming Relaxations of Orthogonal Array Problems

Abstract

Integer linear programs arise in many situations, and solving such problems can be computationally demanding. One way to solve them more e ciently is by exploiting the symmetry within their formulation. This paper proves that the symmetry group for the linear programming relaxation of 2-level orthogonal array problems of strength 2 is a particular semidirect product.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 26, 2015
Accession Number
ADA616084

Entities

People

  • David M. Arquette

Organizations

  • Air Force Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Applied Mathematics
  • Computations
  • Computer Programming
  • Contracts
  • Department Of Defense
  • Equations
  • Factorial Design
  • Governments
  • Linear Programming
  • Literature Surveys
  • National Governments
  • Permutations
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.