Browse Prior Art Database

4u Update of Generalized Upper Bound Simplex Algorithm

IP.com Disclosure Number: IPCOM000079771D
Original Publication Date: 1973-Sep-01
Included in the Prior Art Database: 2005-Feb-26
Document File: 3 page(s) / 104K

Publishing Venue

IBM

Related People

Brayton, RK: AUTHOR [+3]

Abstract

The following figures illustrate the basic matric structure. (Image Omitted)

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 3

4u Update of Generalized Upper Bound Simplex Algorithm

The following figures illustrate the basic matric structure.

(Image Omitted)

II) It is not necessary to zero out u but merely when processing a vector, store the 1/th/ element of the vector at the proper point and put it back at the proper point. This remark applies either to the forward processing or the backward processing, i.e., solving c/T/A = d/T/. This saves having to go in and change the U file or having to check indices for possible nonprocessing. This procedure works in a general simplex environment and appears very attractive when the U file spills out of core.

III) Another procedure to save zeroing out u is to interchange elements in the eta vectors for U and T. Suppose the eta has K elements and element xi, 1</- xi</-K has to be zeroed. Simply place element xi in position K and element K in position xi, and then record that the eta has K-1 elements.

1

Page 2 of 3

2

[This page contains 7 pictures or other non-text objects]

Page 3 of 3

3

[This page contains 5 pictures or other non-text objects]