Abstract: A system and method for a risk management visualization system having a computer comprising a processor and memory and configured to model a supply chain network as a supply chain planning problem, one or more key process indicators (KPIs) of the supply chain planning problem is based, at least in part, on the one or more input variables, model an impact on the one or more KPIs from each of the one or more input variables at a selected confidence interval using a Bayesian optimization process comprising an exploration phase and a learning phase, and display a visualization of the risk profile for the one or more KPIs, the visualization indicating a probability that an actual KPI value differs from a predicted KPI value.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving an LP problem representing a supply chain planning problem for a supply chain network comprising material buffers and resource buffers, partitioning the supply chain network at a complicating node into at least two supply chains sharing the complicating node, formulating a decomposed subproblem for each of the supply chains, calculating an effective dual based, at least in part, on a mathematical difference of at least two dual values calculated by solving the functional-based decomposed subproblems, and generating a globally-optimal LP solution to the LP problem using subgradient descent with the effective dual.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.

Abstract: A system and method are disclosed for campaign planning and include modeling the use of campaign operations and campaignable resources of a supply chain network including a production line to produce products using campaign operations and campaignable resources as campaign planning problems, defining an evaluation function comprising a weighted sum of features evaluated from the campaign planning problem, initializing weights to build a consumption profile and evaluation function, determining fitness values that indicate a level of variability, evaluating reward values based on the fitness values, selecting a sub-sample of the top fitness values having the best associated objective function, repeating the generating, the evaluating and the selecting steps to adjust the weights until a stopping criterion is met indicating an optimal solution has been reached, and determining a campaign plan for the use of the campaign operations and campaignable resource.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving an LP problem representing a supply chain planning problem for a supply chain network comprising material buffers and resource buffers, partitioning the supply chain network at a complicating node into at least two supply chains sharing the complicating node, formulating a decomposed subproblem for each of the supply chains, calculating an effective dual based, at least in part, on a mathematical difference of at least two dual values calculated by solving the functional-based decomposed subproblems, and generating a globally-optimal LP solution to the LP problem using subgradient descent with the effective dual.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving an LP problem representing a supply chain planning problem for a supply chain network comprising material buffers and resource buffers, partitioning the supply chain network at a complicating node into at least two supply chains sharing the complicating node, formulating a decomposed subproblem for each of the supply chains, calculating an effective dual based, at least in part, on a mathematical difference of at least two dual values calculated by solving the functional-based decomposed subproblems, and generating a globally-optimal LP solution to the LP problem using subgradient descent with the effective dual.

Abstract: A system and method are disclosed for campaign planning and include modeling the use of campaign operations and campaignable resources of a supply chain network including a production line to produce products using campaign operations and campaignable resources as campaign planning problems, defining an evaluation function comprising a weighted sum of features evaluated from the campaign planning problem, initializing weights to build a consumption profile and evaluation function, determining fitness values that indicate a level of variability, evaluating reward values based on the fitness values, selecting a sub-sample of the top fitness values having the best associated objective function, repeating the generating, the evaluating and the selecting steps to adjust the weights until a stopping criterion is met indicating an optimal solution has been reached, and determining a campaign plan for the use of the campaign operations and campaignable resource.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming problem. Embodiments include receiving a matrix formulation of at least a portion of the linear programming problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an linear programming subproblem from each of the at least two partitions, and solving the linear programming subproblems to generate a global solution to the supply chain planning problem.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.

Abstract: A system and method are disclosed for image analysis of supply chain planning problems modeled as a linear programming (LP) problems. Embodiments include receiving an LP matrix representing constraints and variables of at least a portion of a supply chain planning problem, generating a sorted variable index for the variables of the LP matrix, generating a sorted constraint index for the constraints of the LP matrix, identifying functions of the variables and the constraints, selecting one or more colors of pixels of a supply chain problem image based, at least in part, on the identified functions of the variables and constraints, selecting locations of the pixels, and displaying a visualization of the supply chain problem image.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.

Abstract: A system and method are disclosed for image analysis of supply chain planning problems modeled as a linear programming (LP) problems. Embodiments include receiving an LP matrix representing constraints and variables of at least a portion of a supply chain planning problem, generating a sorted variable index for the variables of the LP matrix, generating a sorted constraint index for the constraints of the LP matrix, identifying functions of the variables and the constraints, selecting one or more colors of pixels of a supply chain problem image based, at least in part, on the identified functions of the variables and constraints, selecting locations of the pixels, and displaying a visualization of the supply chain problem image.

Abstract: A system and method are disclosed for campaign planning and include modeling the use of campaign operations and campaignable resources of a supply chain network including a production line to produce products using campaign operations and campaignable resources as campaign planning problems, defining an evaluation function comprising a weighted sum of features evaluated from the campaign planning problem, initializing weights to build a consumption profile and evaluation function, determining fitness values that indicate a level of variability, evaluating reward values based on the fitness values, selecting a sub-sample of the top fitness values having the best associated objective function, repeating the generating, the evaluating and the selecting steps to adjust the weights until a stopping criterion is met indicating an optimal solution has been reached, and determining a campaign plan for the use of the campaign operations and campaignable resource.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming problem. Embodiments include receiving a matrix formulation of at least a portion of the linear programming problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an linear programming subproblem from each of the at least two partitions, and solving the linear programming subproblems to generate a global solution to the supply chain planning problem.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments further include receiving a multi-period matrix formulation of a least a portion of an LP supply chain master planning problem representing a supply chain planning problem for a supply chain network and having a planning horizon divided into time buckets separated by time-bucket boundaries, mapping constraints of the LP supply chain master planning problem and variables of the LP supply chain master planning problem to the time buckets, calculating a quantity of cross-over variables for the constraints and the time buckets, selecting one or more decomposition boundaries from the time-bucket boundaries, and formulating at least two time-based decomposed subproblems by decomposing the LP supply chain master planning problem at the one or more decomposition boundaries.

Abstract: A system and method are disclosed for campaign planning and include modeling the use of campaign operations and campaignable resources of a supply chain network including a production line to produce products using campaign operations and campaignable resources as campaign planning problems, defining an evaluation function comprising a weighted sum of features evaluated from the campaign planning problem, initializing weights to build a consumption profile and evaluation function, determining fitness values that indicate a level of variability, evaluating reward values based on the fitness values, selecting a sub-sample of the top fitness values having the best associated objective function, repeating the generating, the evaluating and the selecting steps to adjust the weights until a stopping criterion is met indicating an optimal solution has been reached, and determining a campaign plan for the use of the campaign operations and campaignable resource.

Abstract: A system and method are disclosed for image analysis of supply chain planning problems modeled as a linear programming (LP) problems. Embodiments include receiving an LP matrix representing constraints and variables of at least a portion of a supply chain planning problem, generating a sorted variable index for the variables of the LP matrix, generating a sorted constraint index for the constraints of the LP matrix, identifying functions of the variables and the constraints, selecting one or more colors of pixels of a supply chain problem image based, at least in part, on the identified functions of the variables and constraints, selecting locations of the pixels, and displaying a visualization of the supply chain problem image.

Abstract: A system and method are disclosed for solving a supply chain planning problem modeled as a linear programming (LP) problem. Embodiments include receiving a matrix formulation of at least a portion of the LP problem representing a supply chain planning problem for a supply chain network, generating an image based on the matrix formulation to identify connected components, partitioning the matrix formulation based, at least in part, on the connected components constraint into at least two partitions, formulating an LP subproblem from each of the at least two partitions, and solving the LP subproblems to generate a global solution to the supply chain planning problem.