TRUST-TECH MINLP Global Optimization via Stability Regions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mixed integer nonlinear programming (MINLP) problems are challenging due to their nonlinearity and nonconvexity, leading to numerous local optimal solutions and difficulty in finding global optimal solutions, especially when variables are restricted to integer values, making them NP-hard.
Innovation Solution
The TRUST-TECH method computes stable equilibrium points of a nonlinear dynamical system associated with a relaxed continuous MINLP problem, using these points to progressively tighten bounds and identify new starting points for MINLP solvers, ultimately generating global optimal solutions through a deterministic and systematic tier-by-tier search.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional MINLP solvers are used to find global optimal solutions, then solution quality can be improved, but computational time and complexity increase dramatically
Solution Approach 1:
The patent segments the search space into multiple stability regions by computing stable equilibrium points (SEPs) and their corresponding stability regions. This allows the solver to systematically explore different regions rather than searching the entire space, reducing computational time while maintaining solution quality.
Solution Approach 2:
The patent performs preliminary computation of stable equilibrium points and their stability regions before the main optimization process. By pre-identifying these critical points and their associated regions, the solver can focus computational resources more efficiently during the actual optimization, reducing overall computational time.
2Reliability
If the search space is expanded to find all local optimal solutions, then global optimality can be ensured, but the number of candidates grows exponentially
Solution Approach 1:
The patent focuses on computing and analyzing local stability regions around stable equilibrium points rather than attempting to explore the entire search space. By examining the local properties (stability regions) around critical points, the method identifies global optima without needing to search every possible candidate, reducing complexity while maintaining reliability.
Solution Approach 2:
The patent creates a simplified representation of the search space by computing stable equilibrium points and their stability regions. This creates a reduced model that captures the essential structure of the problem, allowing the solver to work with a manageable set of regions rather than the full exponential search space.
3Reliability
If deterministic methods are used to ensure reproducible results, then solution reliability improves, but flexibility in handling complex nonlinearity decreases
Solution Approach 1:
The patent replaces traditional gradient-based optimization mechanisms with a dynamical systems approach. By using stable equilibrium points and their stability regions from dynamical systems theory, the method achieves deterministic results while effectively handling nonlinear problems. This substitution allows the solver to navigate complex nonlinearity in a systematic, reproducible manner.
Data Source
AI summary
A dynamical method and system generate a global optimal solution to a mixed integer nonlinear programming (MINLP) problem, where a part or all of optimization variables of the MINLP problem are restricted to have discrete values. The method computes a first integer solution to the MINLP problem with a given starting point using an MINLP solver; computes a set of stable equilibrium points (SEPs) of a nonlinear dynamical system associated with a relaxed continuous problem of the MINLP problem, where the SEPs surround the first integer solution and form one or more tiers; identifies from the SEPs a set of new starting points for the MINLP problem; computes integer solutions to the MINLP problem with progressively tightened bounds, starting from the new starting points using the MINLP solver; and generates the global optimal solution based on the integer solutions after one or more iterations.