Abstract: According to one embodiment of the invention, a method for integrated decision support is disclosed. The method includes receiving decision inputs. The method also includes converting the received decision inputs to graph representations and mathematical representations. The method further includes decomposing the converted decision inputs to sub-problems. The method further includes detecting strongly-connected components associated with the sub-problems. The strongly-connected components represent the sub-problems that are coupled. The method further includes solving the sub-problems.

Abstract: A method and system for applying constraints to a wireframe chain of curves for Computer-Aided Design (CAD) is disclosed, whereby a geometric constraint network can be expanded to include chains of curves as types of wireframe entities. As such, a chain of curves can be represented as one composite curve. As a result, a constraint solver can generate and/or maintain any constraint on a chain of curves, which enables the constraints to be solved while moving along the curves independently from the chain's geometry and topology changes.

Abstract: A method and system for applying constraints to a wireframe chain of curves for Computer-Aided Design (CAD) is disclosed, whereby a geometric constraint network can be expanded to include chains of curves as types of wireframe entities. As such, a chain of curves can be represented as one composite curve. As a result, a constraint solver can generate and/or maintain any constraint on a chain of curves, which enables the constraints to be solved while moving along the curves independently from the chain's geometry and topology changes.

Abstract: An integrated decision support framework is disclosed, in which different types of decision-drivers from numerous sources can be converted into a unified decision network including, for example, both mathematical and node-edge graph representations. A graph-theoretic algorithm may be applied to the large problem (unified decision network) to detect and separate strongly-connected components. The strongly-connected components represent sub-problems that can be solved simultaneously. A dependency propagation technique may be used to properly order the sub-problems so they can be processed and solved sequentially and correctly. Each strongly-connected component (small sub-problem) can be delegated to a suitable decision generator depending on the types of relations included in the component.