Two Implementation Variants of the Rosen Algorithm with Multiple Technical and Scientific Applications

Authors

  • Moise Cocan Transilvania University of Brasov, Romania

Keywords:

Convex programming, Kuhn-Tucker condition

Abstract

The range of technical-engineering, economic, or social problems which are modelled as linear or non-linear optimisation problems that require for their solving optimisation software products, is, without exaggeration, vast. The Rosen, the Wolfe and the Beale algorithms are representative algorithms used in the solving of technical and economic convex or square optimisation problems. The RosenSolver programme represents the first implementation variant of the algorithm and the RosenSolver programme represents the second implementation variant of the algorithm.

Author Biography

Moise Cocan, Transilvania University of Brasov, Romania

Computer Science Department

Published

2007-05-24

Issue

Section

MATHEMATICS, INFORMATICS