A SEARCH METHOD IN CONVEX PROGRAMMING

Abstract

A search method for solving both the linear programming problem and a more general class of convex programming problems with the 7090 computer, using artificial evolution techniques, is presented. Flow diagrams are given for the program. In special cases, the results of this method and the known values are compared. Also tables of the computed results are given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1965
Accession Number
AD0619211

Entities

People

  • Michael Rogson

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Boundaries
  • Complex Systems
  • Computer Programming
  • Computers
  • Contracts
  • Convergence
  • Convex Programming
  • Convex Sets
  • Equations
  • Inequalities
  • Iterations
  • Linear Programming
  • Mutations
  • Personal Information Managers
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.