A non-transitory computer-readable medium embodied with software for efficiently updating a solution to a supply chain problem to reduce computer solve time, wherein the software when executed by the computer is configured to:
- scan, by a radio receiver and transmitter configured to read an electronic tag, an RFID tag of products to determine locations of the products;
- in response to changing the supply chain problem by adding a new non-lateable demand, add a corresponding new variable, wherein adding the corresponding new variable retains primal feasibility;
- in response to changing the supply chain problem by changing a demand priority, change a corresponding objective coefficient, wherein changing the corresponding objective coefficient retains primal feasibility;
- in response to changing the supply chain problem by changing a demand quantity, change a corresponding upper bound, wherein changing the corresponding upper bound does not retain primal feasibility;
- in response to changing the supply chain problem by changing a demand need date, change at least a corresponding objective coefficient, wherein changing the corresponding objective coefficient does not retain primal feasibility;
- in response to changing the supply chain problem by adding a new lateable demand, add at least a corresponding new constraint, wherein adding the corresponding new constraint retains primal feasibility;
- in response to changing the supply chain problem by one of:
- adding work-in-progress;
- changing a work-in-progress quantity;
- or
- changing a work-in-progress date of the supply chain problem, change a corresponding right hand side value, wherein changing the corresponding right hand side value does not retain primal feasibility;
- update the solution to the supply chain problem in response to one or more of the changes to the supply chain problem to reduce the computer solve time, wherein updating the solution to the supply chain problem comprises loading the supply chain problem and an optimal basis from a previous solving run, categorizing the one or more changes to the supply chain problem as (i) dual feasibility changes that retain primal feasibility of the optimal basis or (ii) primal feasibility changes that retain dual feasibility of the optimal basis, applying the dual feasibility changes to generate a primal feasible starting basis, solving the supply chain problem using a primal simplex method, applying the primal feasibility changes to a resulting optimal basis from the primal simplex method to generate a dual feasible starting basis, and solving the supply chain problem using a dual simplex method;
- instruct automated machinery to produce the products according to the updated solution, wherein the automated machinery receives and executes the instructions to produce the products according to the updated solution;
- instruct robotic warehouse systems to adjust inventory levels of the products at one or more stocking points, wherein the robotic warehouse systems receive and execute the instructions to adjust the inventory levels of the products at the one or more stocking points;
- produce, by the automated machinery, the products according to the updated solution;
- and
- adjust, by the robotic warehouse systems, inventory levels of the products at the one or more stocking points.