CRITERIA FOR MINIMAL WEIGHTS FOR REGULAR SWITCHING FUNCTIONS

Abstract

An analysis is presented which describes an algorithm for applying linear programming to the problem of determining whether or not a giv n function is linearly separable, and if so, what are the weights and threshold values required to form the separating system. The particular method which is implemen ed ere by linear programming is based upon the application of successive approximation, and is described. The simplex method of linear programming is used; its application to the complete system of equations is described, along with a modification which considers the various weight valu s only, eliminating the threshold value. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1962
Accession Number
AD0286978

Entities

People

  • Sze-tsen Hu

Organizations

  • Lockheed Martin Missiles and Space

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Equations
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method
  • Switching

Readers

  • Operations Research
  • Snow Cover Descriptors for Reptiles and Their Illustrations.