Fuzzy algebra is a special type of algebraic structure in which classical addition and multiplication are replaced by maximum and minimum (denoted ⊕ and ⊗ , respectively). The eigenproblem is the search for a vector x (an eigenvector) and a constant λ (an eigenvalue) such that A⊗x=λ⊗x , where A is a given matrix. This paper investigates a generalization of the eigenproblem in fuzzy algebra. We solve the equation A⊗x=λ⊗B⊗x with given matrices A,B and unknown constant λ and vector x . Generalized eigenvectors have interesting and useful properties in the various computational tasks with inexact (interval) matrix and vector inputs. This paper studies the properties of generalized interval eigenvectors of interval matrices. Three types of generalized interval eigenvectors: strongly tolerable generalized eigenvectors, tolerable generalized eigenvectors and weakly tolerable generalized eigenvectors are proposed and polynomial procedures for testing the obtained equivalent conditions are presented.