System and method for graphically displaying relationships among sets of descriptors

1. A method of describing relationships among a hierarchy of descriptors, comprising:

grouping a first set of descriptors, a second set of descriptors, and a third set of descriptors;

defining a hierarchy among the first, second, and third sets of descriptors;

defining a first set of relationships between the first set of descriptors and the second set of descriptors;

defining a second set of relationships between the second set of descriptors and the third set of descriptors; and

graphically displaying the first set of descriptors on a first descriptor list, the second set of descriptors on a second descriptor list, the third set of descriptors on a third descriptor list, the first set of relationships on a first relationship grid, and the second set of relationships on a second relationship grid;

wherein the first descriptor list is adjacent to the first relationship grid, the first relationship grid is adjacent to the second descriptor list the second descriptor list is adjacent to the second relationship grid, and the second relationship grid is adjacent to the third descriptor list thereby forming a contiguous figure;

wherein at least one of the relationship grids is positioned perpendicular to at least one of the other relationship grids.

2. The method of claim 1 , further comprising:

grouping an n th set of descriptors, where n≧4;

defining the n th set of descriptors as belonging to an n th level of a hierarchy;

defining an (n=1) th set of relationships between the n th set of descriptors and an (n−1) set of descriptors; and

graphically displaying the n th set of descriptors on an n th descriptor list the (n−1) th set of descriptors on an (n−1) th descriptor list and the (n−1) th set of relationships on a (n−1) th relationship grid;

wherein the (n−1) th descriptor list is adjacent to the (n−1) th relationship grid and the (n−1) th relationship grid is adjacent to the n th descriptor list.

3. The method of claim 1 , wherein:

the second set of descriptors define characteristics of the first set of descriptors; and

the third set of descriptors define characteristics of the second set of descriptors.

4. The method of claim 1 , wherein the first and second sets of relationships represent weights.

5. The method of claim 1 , wherein the first and second sets of relationships represent dependencies.

6. The method of claim 1 , further comprising:

ascertaining a characteristic of a descriptor in a lower hierarchy; and

ascertaining a characteristic of a descriptor in a higher hierarchy.

7. The method of claim 1 , further comprising:

managing a project based on the descriptors and sets of relationships.

8. The method of claim 1 , further comprising:

managing a group of employees based on the descriptors and sets of relationships.

9. A method of describing relationships among a hierarchy of business descriptors comprising:

defining a key result area descriptor as belonging to a highest level of a hierarchy;

defining a focus area descriptor as belonging to an intermediate level of a hierarchy;

defining an objective descriptor as belonging to a lowest level of a hierarchy;

assigning a first set of relationships between the key result area descriptor and the focus area descriptor;

assigning a second set of relationships between the focus area descriptor and the objective descriptor;

assigning responsibility for the objective descriptor to an employee; and

graphically displaying the key result area descriptor on a first descriptor list, the focus area descriptor on a second descriptor list, the objective descriptor on a third descriptor list, the employees on an employee list, the first set of relationships on a first relationship grid, the second set of relationships on a second relationship grid, and the assigned responsibilities on a third relationship grid;

wherein the first descriptor list is adjacent to the first relationship grid, the first relationship grid is adjacent to the second descriptor list, the second descriptor list is adjacent to the second relationship grid, the second reLationship grid is adjacent to the third descriptor list, the third descriptor list is adjacent to the third relationship grid, and the third relationship grid is adjacent to the employee list, thereby forming a contiguous figure.

10. The method of claim 9 , wherein the first and second sets of relationships represent weights.

11. The method of claim 9 , wherein the first and second sets of relationships represent dependencies.

12. The method of claim 9 , further comprising:

ascertaining a characteristic of a descriptor in a lower hierarchy; and

ascertaining a characteristic of a descriptor in a higher hierarchy.

13. The method of claim 9 , further comprising:

managing a project based on the descriptors and sets of relationships.

14. The method of claim 9 , further comprising:

managing a group of employees based on the descriptors and sets of relationships.

15. A system for describing relationships among a hierarchy of descriptors, comprising:

a memory; and

a microprocessor coupled to the memory and programmed to;

receive a first set of descriptors, a second set of descriptors, and a third set of descriptors;

define a hierarchy among the first, second, and third sets of descriptors;

define a first set of relationships between the first set of descriptors and the second set of descriptors;

define a second set of relationships between the second set of descriptors and the third set of descriptors; and

graphically display the first set of descriptors on a first descriptor list, the second set of descriptors on a second descriptor list, the third set of descriptors on a third descriptor list, the first set of relationships on a first relationship grid, and the second set of relationships on a second relationship grid;

wherein the first descriptor list is adjacent to the first relationship grid, the first relationship grid is adjacent to the second descriptor list the second descriptor list is adjacent to the second relationship grid, and the second relationship grid is adjacent to the third descriptor list thereby forming a contiguous figure.

16. The system of claim 15 , wherein the microprocessor is further programmed to:

receive a group of an n th set of descriptors, where n≧4;

define the n th set of descriptors as belonging to an n th hierarchy;

define an (n−1) th set of relationships between the nset of descriptors and an (n−1) th set of descriptors; and

graphically display the nset of descriptors on an nth descriptor list the (n−1) th set of descriptors on an (n−1) th descriptor list, and the (n−1) th set of relationships on a relationship grid;

wherein the (n−1) th descriptor list is adjacent to the (n−1) th relationship grid and the (n−1) th relationship grid is adjacent to the nth descriptor list.

17. The system of claim 15 , wherein the microprocessor is further programmed to:

return a characteristic of a descriptor in a lower hierarchy; and

return a characteristic of a descriptor in a higher hierarchy.

18. The system of claim 15 , wherein the first and second sets of relationships represent weights.

19. The system of claim 15 , wherein the first and second sets of relationships represent dependencies.

20. The system of claim 15 , wherein the microprocessor is further programmed to manage a project based on the descriptors and sets of relationships.