The use of a genetic algorithm (GA) to optimise the binary variables in a mixed-integer linear
programming model for the block layout design problem with unequal areas that satisfies …

The present paper presents a methodology for solving a given linear programming problem.
We extend the idea for the location of the binding constraints from two to n dimensions and …

Abstract The Support Vector Machine (SVM) is a well known method used for classification,
regression and density estimation. Training a SVM consists in solving a Quadratic …

In this paper a new method for linear problems resolution is presented. This method named
Simplex Cosine Method (SCM) is based on the analysis of the angles between the gradient …

The paper introduces an algorithmic improvement to IFRAIS, an existing Artificial Immune
System method for fuzzy rule mining. The improvement presented consists of using rule …

Linear programming (LP) is an important field of optimization. Even though, interior point
methods are polynomial algorithms, many LP practical problems are solved more efficiently …

This paper presents experimentation on a heuristic (called Theta Heuristic or TH) for starting
the Cosine Simplex Method. TH is inspired by the Karush, Kuhn and Tucker (KKT) optimality …

The paper introduces an algorithmic improvement to IFRAIS, an existing Artificial Immune
System method for fuzzy rule mining. The improvement presented consists of using rule …