Cutting-Planes for Complementarity Constraints.

Abstract

Described are two simple rules of cutting-plane generation for the complementarity constraints which generate all (and only) the valid cutting-planes for (CMP), if there is some b' for which (x > or = 0 bar Ax > or = b') is non-empty and bounded. In (CMP), x = (x sub 1,..., x sub r), and J sub h is a set of subsets K of (1,...,r). The problem (CMP) includes the linear complementarity problem and bivalent integer programming, along with many other constraint sets which impose logical restrictions on linear inequalities.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1976
Accession Number
ADA032162

Entities

People

  • Robert G. Jeroslow

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Convex Sets
  • Equations
  • Evolutionary Algorithms
  • Formal Languages
  • Integer Programming
  • Linear Programming
  • Logic
  • Mathematical Logic
  • Mathematical Programming
  • Numbers
  • Operations Research
  • Optimization
  • Simplex Method
  • Tensile Strength
  • Theorems

Readers

  • Aerial Delivery - Logistics and Supply Chain Management.
  • Operations Research