SYNTHESIS OF LINEAR SEPARABILITY BY MEANS OF LINEAR PROGRAMMING

Abstract

The solution to the problem of assigning minimal weights to the separati g system for linearly separable functions is considered. The method uses previously derived concepts for ordering the functions in what is called a canonical partial order, to reduce t e number of equations involved. Linear programming techniques are used in determining the minimal weight values; the reduction in the total number of equations enables reducing the solution time, and hence enables extension to systems with more variables. (Author)

Document Details

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

Entities

People

  • Sze-tsen Hu

Organizations

  • Lockheed Martin Missiles and Space

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Equations
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Calculus or Mathematical Analysis
  • Regression Analysis.