Variable Elimination Method Research Articles

3D QSAR study of hypolipidemic asarones by comparative molecular surface analysis

Three-dimensional quantitative structure–activity relationship (3D QSAR) modeled for α-asarone derivatives using the comparative molecular surface analysis (CoMSA) allowed us to reveal a correlation between the activity of these compounds and the electrostatic potential at the molecular surface. The grid formalism (s-CoMSA) allowed us to indicate a pharmacophore that is of key importance for compound activity. The CoMSA formalism coupled with the iterative variable elimination method gives a highly predictive model.

A computational method using genetic algorithms for obtaining Stackelberg solutions to two‐level linear programming problems

AbstractStackelberg solutions have been derived for two‐level linear programming problems using genetic algorithms which in recent years have shown their efficacy in optimization problems having discrete variables. Two‐level linear programming problems are converted into single‐level programming problems by including the optimal conditions of lower‐level problems in the conditions of higher‐level problems. The obtained one‐level programming problems become 0–1 mixed programming problems. A computational method for obtaining Stackelberg solutions by generating initial population and using corresponding genetic operators based on the characteristics of the problems by expressing the 0–1 variables as individuals of the genetic algorithms is proposed. The efficacy of the proposed method is shown in computational experiments by comparing it with the variable elimination method. © 2002 Scripta Technica, Electron Comm Jpn Pt 3, 85(6): 55–62, 2002

Boson Operator Elimination Method in the Laser Cooling of Solids

We use Bogoliubov's boson variables elimination method to investigate the laser cooling of solid samples. We derive an exact kinetic equation for the quantum description of the laser cooling of glasses and crystals doped by rare-earth ions and find its stationary solution. We estimate the temperature of a laser-cooled glass doped by three-valence ytterbium.

Modified Fourier’s Method of Solving Linear Programming Problems

The application of Fourier variable elimination method for solving Linear programming problems generates additional and redundant constraints in each step. Even after using Kohler’s rule to eliminate redundant constraints, some of the constraints generated are still redundant. In this paper, we present modified method of Fourier for solving Linear programming problems. In the modified method, the number of additional constraints generated are reduced to a considerable extent.