An Application of Separable Programming | Zendy

A. J. Akeroyd | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Application of Separable Programming

Author(s) -

A. J. Akeroyd

Publication year - 1966

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/8.4.344

Subject(s) - separable space , interpolation (computer graphics) , nonlinear programming , mathematical optimization , computer science , nonlinear system , function (biology) , algorithm , mathematics , artificial intelligence , mathematical analysis , motion (physics) , physics , quantum mechanics , evolutionary biology , biology

Box (1965) describes a nonlinear programming problem that arose in his work, for which he described two new computational procedures. The problem is in fact linear except for the presence of four product terms. It may be of interest to point out that problems of this type can be solved by an extension of linear programming known as separable programming, and Box's problem has been used to illustrate this. The paper outlines the technique of separable programming and the interpolation procedure associated with it in the C-E-I-R mathematical programming code LP/90/94 for the IBM 7094 computer. The application of the technique to Box's problem is then described.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research