System and method of scenario versioning

1. A supply chain planning system, comprising:

a supply chain network comprising two or more network components, each network component supplies one or more items to satisfy demand;

a database comprising data describing the supply chain network; and

a computer coupled with the database and comprising one or more processors and one or more memory units to execute instructions to:

store data describing two or more scenarios, each scenario comprising one or more fields, each field comprising a value only when the value is different than the value in a corresponding field of each respective parent scenario;

access the data describing the two or more scenarios;

access the data describing the supply chain network;

permit a modification of a scenario only when the scenario to be modified does not have a child scenario;

determine if a scenario comprises an entry for a field and when there is not an entry for the field, traverse a scenario tree along a parent scenario recursively, until an entry for the field is encountered and modify the value of the field;

traverse the one or more fields of the two or more scenarios until a value is determined wherein values from a field in a scenario that is not different from the value in the corresponding field in the parent scenario are retrieved from the parent scenario; and

store the determined value in the database for each of the one or more fields of the two or more scenarios.

2. The system of claim 1 , wherein the two or more scenarios are in a hierarchy of scenarios.

3. The system of claim 2 , wherein the two or more scenarios comprises a base scenario comprising a value for each of the one or more fields.

4. The system of claim 2 , wherein the one or more fields of each of the two or more scenarios comprises a value only when the value is different than the value in the one or more fields of the parent scenario.

5. The system of claim 1 , wherein the scenario tree comprises one or more nodes representing a scenario of the supply chain network.

6. A computer-implemented method, comprising:

storing data describing two or more scenarios, each scenario comprising one or more fields, each field comprising a value only when the value is different than the value in a corresponding field of each respective parent scenario;

accessing data describing a supply chain network comprising two or more network components, each network component supplies one or more items to satisfy demand;

modifying a scenario only when the scenario to be modified does not have a child scenario;

determining if a scenario comprises an entry for a field when there is not an entry for the field, traversing a scenario tree along a parent scenario recursively, until an entry for the field is encountered and modifying the value of the field;

traversing the one or more fields of the two or more scenarios until a value is determined wherein values from a field in a scenario that is not different from the value in the corresponding field in the parent scenario are retrieved from the parent scenario; and

storing the determined value in the database for each of the one or more fields of the two or more scenarios.

7. The computer-implemented method of claim 6 , wherein the two or more scenarios are in a hierarchy of scenarios.

8. The computer-implemented method of claim 7 , wherein the two or more scenarios comprises a base scenario comprising a value for each of the one or more fields.

9. The computer-implemented method of claim 7 , wherein the one or more fields of each of the two or more scenarios comprises a value only when the value is different than the value in the one or more fields of the parent scenario.

10. The computer-implemented method of claim 6 , further comprising:

accessing the scenario tree comprising one or more nodes representing a scenario of the supply chain network.

11. A non-transitory computer-readable storage medium embodied with software, the software when executed using one or more computers:

stores data describing two or more scenarios, each scenario comprising one or more fields, each field comprising a value only when the value is different than the value in a corresponding field of each respective parent scenario;

accesses data describing a supply chain network comprising two or more network components, each network component supplies one or more items to satisfy demand;

modify a scenario only when the scenario to be modified does not have a child scenario;

determine if a scenario comprises an entry for a field when there is not an entry for the field, traverse a scenario tree along a parent scenario recursively, until an entry for the field is encountered and modifying the value of the field;

traverses the one or more fields of the two or more scenarios until a value is determined wherein values from a field in a scenario that is not different from the value in the corresponding field in the parent scenario are retrieved from the parent scenario; and

stores the determined value in the database for each of the one or more fields of the two or more scenarios.

12. The non-transitory computer-readable storage medium of claim 11 , wherein the two or more scenarios are in a hierarchy of scenarios.

13. The non-transitory computer-readable storage medium of claim 12 , wherein the two or more scenarios comprises a base scenario comprising a value for each of the one or more fields.

14. The non-transitory computer-readable storage medium of claim 12 , wherein the one or more fields of each of the two or more scenarios comprises a value only when the value is different than the value in the one or more fields of the parent scenario.

15. The non-transitory computer-readable storage medium of claim 11 , wherein the software further:

accesses the scenario tree comprising one or more nodes representing a scenario of the supply chain network.