Annihilator Ideals in Almost Semilattices

Authors

  • G. Nanaji Rao
  • Terefe Getachew Beyene

Abstract

The concept of annihilator ideal is introduced in an Almost Semi-
lattice (ASL) L with 0. It is proved that the set of all annihilator ideals of an ASL L with 0 forms a complete Boolean algebra. The concept of annihilator preserving homomorphism is introduced in an ASL L with 0. A sucient condition for a homomorphism to be annihilator preserving is derived. Finally, it is proved that the homomorphic image and the inverse image of an annihilator
ideal are again annihilator ideals.

References

M. Alic, G. Nogo, Optimizacija: Uvod u teoriju nuznih i dovoljnih uvjeta ekstrema, Odjel za matematiku, Sveuciliste u Osijeku, Osijek, 2004

D. R. Jones, C. D. Perttunen, B. E. Stuckman, Lipschitzian optimization without the Lipschitz constant, JOTA 79(1993), 157-181

S. Kurepa, Matematika analiza 2, funkcije jedne varijable, Tehnika knjiga, Zagreb, 1987.

Z. Michalewicz, Genetic Algorithms + Data Structures = Evoluti on Programs, Springer, New York, 1996

K. V. Price, R. M. Storn, J. A. Lampinen, Differential Evolution. A

Practical Approach to Global Optimization, Springer-Verlag Berlin Heidelberg, 2005

R. Scitovski, Numericka matematika, Sveuciliste u Osijeku, Odjel za matematiku, 2014.

R. Scitovski, N. Truhar, Z. Tomljanovic, Metode optimizacije,

Sveuciliste Josipa Jurja Strossmayera u Osijeku, Odjel za matematiku., Osijek, 2014.

G. W. Stewart, On the convergence of multipoint iterations, Numerical Mathematics, 68(1994), 143-147

W. Sun, Y. Yuan, Optimization theory and methods, Nonlinear programming, Springer-Verlag, New York, 2006.

Published

2017-02-03

Issue

Section

Чланци