THE DUAL SIMPLEX METHOD AND ITS APPLICATION TO THE SYNTHESIS OF MINIMAL WEIGHTS

Abstract

This report describes an algorithm for applying the dual, simplex method in linear programming to the problem of determining whether or not a given switching function is linearly separable. Further, where separability is possible, a description is given of the application of the dual simplex method to finding the most economic system of weights and threshold. A detailed elementary exposition of the dual simplex method is given in Sections 2 through 4. A completely worked out illustrative numerical example is presented in Section 5. In Sections 6 through 8, the dual simplex method is applied to the problem of determining minimal weights and threshold; this is illustrated by a numerical example which reduces to the example given in Section 5.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1962
Accession Number
AD0402014

Entities

People

  • Szee-tsen Hu

Organizations

  • Lockheed Martin Missiles and Space

Tags

Communities of Interest

  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Boolean Algebra
  • Computations
  • Computer Programming
  • Computers
  • Elimination
  • Equations
  • Heuristic Methods
  • Inequalities
  • Linear Programming
  • Mathematics
  • Numbers
  • Real Numbers
  • Sequences
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Operations Research