DECISION SUPPORT METHODS UNDER UNCERTAINTY

• US 20110125702A1
• Filed: 07/09/2009
• Published: 05/26/2011
• Est. Priority Date: 07/10/2008
• Status: Abandoned Application

• Current Assignee: International Institute Of Information Technology
• Original Assignee: International Institute Of Information Technology
• Inventors: Jain, Ravi Kumar, Gorur Narayana Srinivasa, Prasanna, Chatradhi, Jyotsna, Ratnani, Reshma, Aswal, Abhilasha, Sanghvi, Khyati, Appasaheb Sindagi, Manjunath
• Application Number:
  US13/003,192
• Publication Number:
  US 20110125702A1
• Time in Patent Office: Days
• US Class Current: 706/52
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

Modern decision support methods handle uncertainty or hypothesis about operating conditions, using one of two techniques viz. probabilistic formulation and constraints based method, which is the subject of the present invention. A large number of applications use linear constraints to specify uncertainty. These linear constraints are the set of linear inequalities, which are used to define the demand/supply in the area of supply chains. The set of linear inequalities forms a polytope, the volume of which represents the information content. The present invention deals with the application of computational geometrical methods to find the set theoretic relationship—subset, intersection and disjointness among the polytopes and then present a visualization technique to represent these relationships among polytopes. This invention proposes a decision support system and method to visualize the relationship among the polytopes to help with decision support. A specific embodiment is a Decision Support System for Supply Chain Management.

Claims

1. A Computer implemented Decision Support method, comprising the step of feeding information in the form of constraint sets over information elements, and invoking facilities to determine at least one of the following relationships between the said constraint sets:

(a) Determining whether a pair of said constraint sets intersects with each other, i.e. there is a common information element in both said constraint sets;

(b) Determining whether a pair of said constraint sets are disjoint from each other, i.e. there is no common information element in both said constraint sets;

(c) Determining whether a constraint set is a subset of another, i.e., all the information elements satisfying one said constraint set are included in the information elements satisfying the other said constraint set; and

(d) Determining what the distance as measured by an appropriate norm is between a point satisfying one constraint set, and another point satisfying another constraint set.

2. The method of claim 1, where said facility to determine intersection includes determining the intersection volume, and said facility to determine subset includes determining the volume of the subset and superset.

3. The method of claim 1, where the said information elements are values of a set of variables in a supply chain management system.

4. The method of claim 3 where the variables represent one of (a) demand, (b) supply, (c) inventory, (d) cost, (e) revenue or (f) profit or other relevant variables of an entity in a supply chain management system.

5. The method of claim 4, where the said constraints are linear constraints over the said variables.

6. The method of claim 2, where the relationship between said constraints sets is depicted in a diagram depicting said constraints sets with nodes, having

(a) An arrow going from said node corresponding to a constraint set 1 to said node corresponding to a constraint set 2 depicting that constraint set 1 is a subset of constraint set 2;

(b) An bidirectional arrow going between said node corresponding to a constraint set 1 and said node corresponding to a constraint set 2 depicting that constraint set 1 intersects constraint set 2;

(c) A clique of bidirectional arrows between said node corresponding to a constraint set 1, said node corresponding to a constraint set 2, and said node corresponding to a constraint set 3 implying that all three constraint sets intersect; and

(d) A line without arrowheads indicating that a constraint set 1 is equal to a constraint set 2.

7. The method of claim 6, where a labelled line is marked between said node corresponding to said constraint set 1 and said node corresponding to said constraint set 2, said label containing the distance between a point in the said constraint set 1 and another point in said constraint set 2.

8. The method of claim 7, where said distance is the minimum distance between all points in said constraint set 1 and said constraint set 2.

9. The method of claim 7, where said distance is the maximum distance between all points in said constraint set 1 and said constraint set 2.

10. The method of claim 7, where said distance is the distance between the analytic centers between all points in said constraint set 1 and said constraint set 2.

11. The method of claim 6, where a label exists on a constraint set, indicating the volume of the constraint set.

12. The method of claim 2, where a said facility is implemented as a software service, which can be coupled to an existing decision support system.

13. The method of claim 2, where a facility is implemented in a hardware ASIC.

14. The method of claim 4, where a constraint set is obtained from prediction or transformation from a database

15. The method of claim 4, with a facility to provide an answer to a complex query composed of set-theoretic operators.

16. The method of claim 15, with a facility to use common-sub expression eliminination between multiple queries, to reduce computation.

17. The method of claim 16, where pre-computed answers are stored in a query database for subsequent lookup.

18. The method of claim 4, where the value of a said variable is read from the database of a supply chain management system.

19. The method of claim 18, where said facility gives a signal indicating satisfaction or non-satisfaction of a said constraint set, or satisfaction or non-satisfaction of a complex query on these same constraint sets, by said variable value or values.

20. The method of claim 19, where said variable value or values are updated in real time by input to said supply chain management system.

21. The method of claim 20, where the value of a said variable or variables is/are read from the database of said supply chain management system using an XML file.

22. A Decision support system comprising input means to receive information in the form of sets of constraints over information elements, and invoking facilities to determine at least one of the following relationships between the said constraint sets:

(a) Determining whether a pair of said constraint sets intersects with each other;

(b) Determining whether a pair of said constraint sets are disjoint from each other;

(c) Determining whether a constraint set is a subset of another;

or

(d) Determining what the distance is as measured by an appropriate norm is between a point satisfying one constraint set, and another point satisfying another constraint set.

23. The system of claim 22, entirely operating on a mobile phone