𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Ψ-transform for solving linear and non-linear programming problems

✍ Scribed by V.K. Chichinadze


Publisher
Elsevier Science
Year
1969
Tongue
English
Weight
710 KB
Volume
5
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis


The global extremum value, as well as its coordinates, of a non-linear multidimensional objective function may be found approximately, but practically, as the zero value of its transformation, a monotonically decreasing scalar function. Summary--This paper is concerned with the problem of determining the global extremum value of a multidimensional, non-linear objective function which may have several extreme values. The problem is solved by transforming the objective function, through a particular ~ transformation, into a function W (~) of one new variable (~). The value of this transformed function is shown to decrease continuously to zero as the value of this new variable is increased, and the value of the variable when the transformed function equals zero is the global extremum of the original objective function. Methods of calculating the transformed function are discussed and examples of the technique are given. It is shown that the values of the system coordinates corresponding to the global extremum can also be determined.


📜 SIMILAR VOLUMES


The Difference between Finite Dimensiona
✍ Tvu-Ying Ho; Yuung-Yih Lur; Soon-Yi Wu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 161 KB

This paper studies the difference between finite-dimensional linear programming problems and infinite dimensional linear programming problems. We discuss a special class of continuous linear programming problems. We develop the structure of extreme points of feasible region for this problem. Under s

A steepest edge active set algorithm for
✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations

Reduced-order modelling for solving line
✍ N. Verdon; C. Allery; C. Béghein; A. Hamdouni; D. Ryckelynck 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 595 KB

## Abstract In this article, we present some investigations about the solving of transfer equations by reduced‐order models (ROM). We introduce a ROM, the __a priori__ reduction (APR), and we present the results obtained for the 2D unsteady convection–diffusion equation and the 1D Burgers equation.