SYNTHESIS OF INTEGRAL MINIMAL WEIGHTS

Abstract

This report describes an effective and mathematically rigorous finite process for determining whether or not a given regular switching function is linearly separable. and if it is, for deriving a minimal set of integral weights and threshold to realize the function. The procedure uses the integral linear programming recently developed by R. F. Gomery; the algorithm is described in detail, and a corresponding computer program for implementing the technique can be obviously given without difficulty. As an illustrative example, a regular switching function of nine variables is worked in detail. (The same function was studied earlier by D. G. Willis in disproving a conjecture.)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1963
Accession Number
AD0401935

Entities

People

  • Sze-tsen Hu

Organizations

  • Lockheed Martin Missiles and Space

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Commerce
  • Commodities
  • Equations
  • Evolutionary Algorithms
  • Inequalities
  • Integrals
  • Iterations
  • Linear Programming
  • Mathematics
  • Numbers
  • Real Numbers
  • Sequences
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research
  • Theoretical Analysis.