Mixed Integer Nonlinear Programming Problem Research Articles

Adaptive Privacy-Preserving Coded Computing with Hierarchical Task Partitioning.

Coded computing is recognized as a promising solution to address the privacy leakage problem and the straggling effect in distributed computing. This technique leverages coding theory to recover computation tasks using results from a subset of workers. In this paper, we propose the adaptive privacy-preserving coded computing (APCC) strategy, designed to be applicable to various types of computation tasks, including polynomial and non-polynomial functions, and to adaptively provide accurate or approximated results. We prove the optimality of APCC in terms of encoding rate, defined as the ratio between the computation loads of tasks before and after encoding, based on the optimal recovery threshold of Lagrange Coded Computing. We demonstrate that APCC guarantees information-theoretical data privacy preservation. Mitigation of the straggling effect in APCC is achieved through hierarchical task partitioning and task cancellation, which further reduces computation delays by enabling straggling workers to return partial results of assigned tasks, compared to conventional coded computing strategies. The hierarchical task partitioning problems are formulated as mixed-integer nonlinear programming (MINLP) problems with the objective of minimizing task completion delay. We propose a low-complexity maximum value descent (MVD) algorithm to optimally solve these problems. The simulation results show that APCC can reduce the task completion delay by a range of 20.3% to 47.5% when compared to other state-of-the-art benchmarks.

Energy Efficiency Maximization for Multi-UAV-IRS-Assisted Marine Vehicle Systems

Mobile edge computing is envisioned as a prospective technology for supporting time-sensitive and computation-intensive applications in marine vehicle systems. However, the offloading performance is highly impacted by the poor wireless channel. Recently, an Unmanned Aerial Vehicle (UAV) equipped with an Intelligent Reflecting Surface (IRS), i.e., UIRS, has drawn attention due to its capability to control wireless signals so as to improve the data rate. In this paper, we consider a multi-UIRS-assisted marine vehicle system where UIRSs are deployed to assist in the computation offloading of Unmanned Surface Vehicles (USVs). To improve energy efficiency, the optimization problem of the association relationships, computation resources of USVs, multi-UIRS phase shifts, and multi-UIRS trajectories is formulated. To solve the mixed-integer nonlinear programming problem, we decompose it into two layers and propose an integrated convex optimization and deep reinforcement learning algorithm to attain the near-optimal solution. Specifically, the inner layer solves the discrete variables by using the convex optimization based on Dinkelbach and relaxation methods, and the outer layer optimizes the continuous variables based on the Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (MATD3). The numerical results demonstrate that the proposed algorithm can effectively improve the energy efficiency of the multi-UIRS-assisted marine vehicle system in comparison with the benchmarks.

ReLU surrogates in mixed-integer MPC for irrigation scheduling

Efficient water management in agriculture is important for mitigating the growing freshwater scarcity crisis. Mixed-integer Model Predictive Control (MPC) has emerged as an effective approach for addressing the complex scheduling problems in agricultural irrigation. However, the computational complexity of mixed-integer MPC still poses a significant challenge, particularly in large-scale applications. This study proposes an approach to enhance the computational efficiency of mixed-integer MPC-based irrigation schedulers by employing Rectified Linear Unit (ReLU) surrogate models to describe the soil moisture dynamics of the agricultural field. By leveraging the mixed-integer linear representation of the ReLU operator, the proposed approach transforms the mixed-integer MPC-based scheduler with a quadratic cost function into a mixed-integer quadratic program, which is the simplest class of mixed-integer nonlinear programming problems that can be efficiently solved using global optimization solvers. The effectiveness of this approach is demonstrated through comparative studies conducted on a large-scale agricultural field across two growing seasons, involving other machine learning surrogate models, specifically Long Short-Term Memory (LSTM) networks, and the triggered irrigation scheduling method. The ReLU-based approach significantly reduces solution times—by up to 99.5%—while achieving comparable performance to the LSTM approach in terms of water savings and Irrigation Water Use Efficiency (IWUE). Moreover, the ReLU-based approach achieves enhanced performance in terms of irrigation water savings and IWUE compared to the triggered approach.

A seismic-risk-based bi-objective stochastic optimization framework for the pre-disaster allocation of earthquake search and rescue units

Accurately predicting earthquakes' time, location and size is nearly impossible with today’s technology. Severe earthquakes require prompt and effective mobilization of available resources, as the speed of intervention has a direct impact on the number of people rescued alive. This, in turn, calls for a strategic pre-disaster allocation of search and rescue (SAR) units, both teams and equipment, to make the deployment of resources as quick and equitable as possible. In this paper, a seismic risk-based framework is introduced that takes into account distance-based contingencies between cities. This framework is then integrated into a mixed-integer non-linear programming (MINLP) problem for the allocation of SAR units under uncertainty. The two minimization objectives considered are the expected maximum deployment time of different SAR units and the expected mean absolute deviation of the fulfillment rates. We recover the best vulnerability-adjusted routes for each size-location scenario as input to the optimization model using the dynamic programming (DP) approach as part of the broader area of reinforcement learning (RL). The results of the hypothetical example indicate that the comprehensive model is feasible in various risk scenarios and can be used to make allocation-deployment decisions under uncertainty. The results of the sensitivity analysis verify that the model behaves reasonably against changes in selected parameters, namely the number of allowed facilities and weights of individual objectives. Under the assumption that the two objectives are equally important, the model achieves a total deviation of %3.5 from the objectives with an expected maximum dispatch time of 1.1327 hours and an expected mean absolute deviation of 0.01.

Integrating machine learning model and computer-aided molecular design toward rational ionic liquid selection for separating fluorinated refrigerants

To reduce emissions and facilitate the reclamation of hydrofluorocarbons (HFCs), which are potent greenhouse gases, ionic liquid (ILs)-based absorption separation of HFCs from fluorinated refrigerant (FR) blends is considered as an effective approach. In this work, computer-aided ionic liquid design (CAILD) is carried out to rationally design ILs for separating FR blends, with the near-azeotropic R-32/R-125 system as an illustrative case study. Firstly, the machine learning algorithm, namely artificial neural network (ANN), is employed to develop a group contribution (GC) model for accurate prediction of FR-in-IL solubility. Then, a mixed-integer nonlinear programming (MINLP) problem is formulated and solved by integrating the ANN-GC model with two available GC models for predicting the melting point and viscosity of ILs. Consequently, the optimal three ILs including [C1C10Im][dca], [C1C11Im][dca], and [C1C12Im][dca] are identified. Finally, quantum chemistry calculations are conducted to disclose the separation mechanism from molecular perspective, further validating the reliability of the CAILD results.

Optimal charging scheduling for Indoor Autonomous Vehicles in manufacturing operations

Indoor Autonomous Vehicles (IAVs) have become instrumental in modern logistics, particularly in dynamic operational environments. Their consistent availability is crucial for both timely task execution and energy efficiency in smart factories. Therefore, an inefficient charging schedule can waste energy, compromising production and warehousing efficiency. In addition, formulating an effective charging schedule is challenging due to the nonlinearity of its design and the uncertainties inherent in smart factory settings. In contrast to previous studies that either simplify the problem using linearization-based methods or approach it with computationally demanding algorithms, this paper efficiently addresses the nonlinear challenge, ensuring a closer alignment with real-world conditions. Hence, a simulation environment is first designed to replicate a smart factory, including validated models of IAVs, Charging Stations (CSs), and a variety of unpredictable static and dynamic obstacles. A comprehensive dataset is then provided from this simulation setup. Utilizing this dataset, a model tailored to ascertain the travel time of IAVs, accounting for inherent uncertainties, is trained using Deep Neural Networks (DNNs). Subsequently, a Mixed-Integer Nonlinear Programming (MINLP) problem is formulated to design the optimization task. Finally, integration of the DNNs’ model with the Branch-and-Bound (BnB) approach, forming the BnBD method, streamlines the determination of the optimal charging schedule. Experimental results highlight significant improvements in charging scheduling, establishing this approach as a viable and promising solution for manufacturing operations.

Optimization-based design of structure and operation parameters simultaneously for real-world distillation column based on rate-based model

Simultaneously optimizing the structure and operating parameters of distillation columns based on rigorous rate-based models is critical for various process intensification technologies to achieve their intended purpose in real-world distillation columns. However, efficiently optimizing a distillation column based on rate-based models while considering the column hydraulics is far from practical. The biggest obstacle in using rigorous models for distillation columns in an equation-oriented environment is ensuring a robust solution for large-scale, strongly coupled nonlinear models, along with the simultaneous optimization of integer and continuous variables. In this study, a new optimization framework was introduced. It incorporated a pseudo-transient simulation method to ensure convergence of the simulation in equation-oriented environment. Additionally, an efficient relaxation method transformed the mixed integer nonlinear programming problem into a nonlinear programming problem, facilitating simultaneous optimization of both the integer variable representing column structure and the continuous variables governing column operation. Three examples, including a complex intensified catalytic distillation column, were optimized to demonstrate the efficiency of the proposed framework. Specifically, its advantages in terms of mathematical optimality and industrial feasibility were illustrated.

Pipe merging for transient gas network optimization problems

In practice, transient gas transport problems frequently have to be solved for large-scale gas networks. Gas network optimization problems typically belong to the class of Mixed-Integer Nonlinear Programming Problems (MINLP). However current state-of-the-art MINLP solvers are not yet mature enough to solve large-scale real-world instances. Therefore, an established approach in practice is to solve the problems with respect to a coarser representation of the network and thereby reducing the size of the underlying model. Two well-known aggregation methods that effectively reduce the network size are parallel and serial pipe merges. However, these methods have only been studied in stationary gas transport problems so far. This paper closes this gap and presents parallel and serial pipe merging methods for transient gas transport problems. An empirical evaluation indicates that the developed methods perform very accurately on a huge set of fine-grained real-world data taken from one of the largest transmission system operators in Europe.

Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming

Minimizing operational losses in transmission systems through the Optimal Reactive Dispatch (ORD), a non-convex mixed-integer nonlinear programming problem, is crucial for operational cost reduction, resource optimization, and greenhouse gas emission mitigation. Besides all intricacies associated with solving ORDs, transmission system operators encounter the challenge of determining sequences in which ORD control adjustments must be implemented before significant changes occur in generators scheduled power output and system loading. Sequencing ORD control adjustments, in spite of not being novel, remains modestly scrutinized in the literature. This paper introduces a two-phase framework that tackles the globally optimal sequencing of n ORD control adjustments over n! potential paths by solving the ORD to minimize operational losses in transmission systems in the first phase, and optimally sequencing ORD control adjustments employing fast power flow calculations, graph shortest path, parallel computing, and dynamic programming in the second phase. We discuss the framework’s second phase asymptotic time complexity, which is exponential over factorial for brute-force approaches, and its capability to guarantee globally optimal paths toward minimal operational losses determined in the framework’s first phase. ORD control adjustments for transmission systems with up to 27 controllable variables are benchmarked against two mixed-integer nonlinear programming solvers: BARON, a global non-convex solver, and Knitro, a local solver (assuming convexity around local optima). Globally optimal sequences of ORD control adjustments over n! potential paths (more than 1028 for sequencing 27 control adjustments) and average algorithm runtimes validate the straightforward application and, more importantly, effectiveness of such a comprehensive framework.

A distributed economic model predictive control-based FPPT scheme for large-scale solar farm

Increasing solar-photovoltaic-power penetration necessitates the implementation of flexible power point tracking (FPPT) in solar farms. However, coordinating multiple solar photovoltaic (PV) power generation systems (SPVPGSs) poses a significant challenge due to their inherent intermittency and varying dynamic characteristics, complicating FPPT implementation. To overcome this challenge, this paper proposes a distributed economic model predictive control (DEMPC) scheme to achieve FPPT, while simultaneously enhancing overall economic performance in solar farms. By integrating solar farm control and local control into one optimal control framework, this scheme eliminates the need for power allocation, PV voltage reference calculation, and pulse width modulation. Leveraging the SPVPGS model and soft power constraint, DEMPC controllers are designed to achieve the economic targets of solar farms, which cooperate through a communication network to realize FPPT and economic optimization. Additionally, the strong nonlinearity of SPVPGS causes a non-convex mixed integer nonlinear programming (MINLP) problem, solved by a MINLP algorithm using finite converter switching states. Simulations under step-changed irradiance and power reference, as well as urgent maintenance conditions, demonstrate that the DEMPC-based FPPT scheme significantly outperforms the traditional hierarchical model predictive control-based FPPT scheme, presenting both superior dynamic response and enhanced economic performance in FPPT implementation.

Access strategies in mmWave cell-free network: A matching and auction theory based approach

The mmWave cell-free network is viewed as an energy-efficient and emerging architecture for beyond 5G systems. However, many practical issues should be solved for this system before the benefits are enjoyed, whereof feasible implementation of access strategy is one of the most vital. To this end, the access strategy including user scheduling and bandwidth allocation is investigated in this paper. Firstly, to maximize the defined utility function, the joint optimization problem of user scheduling and bandwidth allocation is formulated as a mixed integer nonlinear programming problem, which is intractable to search for an optimal solution in polynomial time. Secondly, a two-stage matching and sealed-auction-based access strategy is proposed to obtain a sub-optimal solution, where UEs with high-quality channel conditions are scheduled in the first-stage matching as much as possible, and the rest unmatched UEs are scheduled in the second-stage matching with the sealed-auction based bandwidth allocation. Thirdly, a simplified full-matching based access strategy with lower complexity is proposed for the high-dynamic scenario caused by the high-speed movement of UEs, and the complexities and convergence of the two proposed strategies are quantitatively analyzed. Finally, the performance of proposed strategies is evaluated through abundant simulations in different scenarios, and the superiorities of the proposed strategies are demonstrated through the comparison with reference strategies.

Two-Tier Efficient QoE Optimization for Partitioning and Resource Allocation in UAV-Assisted MEC.

Unmanned aerial vehicles (UAVs) have increasingly become integral to multi-access edge computing (MEC) due to their flexibility and cost-effectiveness, especially in the B5G and 6G eras. This paper aims to enhance the quality of experience (QoE) in large-scale UAV-MEC networks by minimizing the shrinkage ratio through optimal decision-making in computation mode selection for each user device (UD), UAV flight trajectory, bandwidth allocation, and computing resource allocation at edge servers. However, the interdependencies among UAV trajectory, binary task offloading mode, and computing/network resource allocation across numerous IoT nodes pose significant challenges. To address these challenges, we formulate the shrinkage ratio minimization problem as a mixed-integer nonlinear programming (MINLP) problem and propose a two-tier optimization strategy. To reduce the scale of the optimization problem, we first design a low-complexity UAV partition coverage algorithm based on the Welzl method and determine the UAV flight trajectory by solving a traveling salesman problem (TSP). Subsequently, we develop a coordinate descent (CD)-based method and an alternating direction method of multipliers (ADMM)-based method for network bandwidth and computing resource allocation in the MEC system. Extensive simulations demonstrate that the CD-based method is simple to implement and highly efficient in large-scale UAV-MEC networks, reducing the time complexity by three orders of magnitude compared to convex optimization methods. Meanwhile, the ADMM-based joint optimization method achieves approximately an 8% reduction in shrinkage ratio optimization compared to baseline methods.

Task execution latency minimization for energy-sensitive IoTs in wireless powered mobile edge computing: A DRL-based method

Wireless powered mobile edge computing (MEC) has become a vital component of future 6G networks, offering efficient computational capabilities to internet of things (IoT) devices and ensuring a stable energy supply. In this paper, we propose an innovative design for a wireless powered MEC-assisted energy-sensitive IoT systems. The system integrates wireless power technology (WPT), allowing IoT devices to efficiently perform tasks under wireless power supply without consuming their battery energy. Therefore, we formulate a dynamic computational task execution latency minimization (DCTELM) problem to tackle the impacts of unpredictable energy requirements and potential communication latency on resource allocation. We also analyze the differences between time division multiple access and non-orthogonal multiple access communication protocols. Given the complexity and dynamic nature of this problem, we define it as a mixed integer nonlinear programming problem. To address this problem, we introduced an enhanced deep reinforcement learning (DRL) algorithm. First, the DCTELM problem is transformed into a Markov decision process (MDP), which simplifies the structure of the problem. Then, after determining the offloading decision, we reveal the convex relationship between resource allocation and task latency. Furthermore, the action space of MDP is further reduced, and a multi-head proximal policy optimization (PPO) algorithm is proposed to deal with the simplified MDP problem. This process reduces the complexity of problem solving, decreases the consumption of computational resources. Simulation results demonstrate that our method outperforms other baselines in terms of computation latency, particularly with the introduction of an exploration strategy during the training phase, which significantly reduces task latency.

Mathematical optimization modeling for scenario analysis of integrated steelworks transitioning towards hydrogen-based reduction

To reduce carbon dioxide emissions from the steel industry, efforts are made to introduce a steelmaking route based on hydrogen reduction of iron ore instead of the commonly used coke-based reduction in a blast furnace. Changing fundamental pieces of steelworks affects the functions of most every system unit involved, and thus warrants the question of how such a transition could optimally take place over time, and no rigorous attempts have until now been made to tackle this problem mathematically. This article presents a steel plant optimization model, written as a mixed-integer non-linear programming problem, where aging blast furnaces and basic oxygen furnaces could potentially be replaced with shaft furnaces and electric arc furnaces, minimizing costs or emissions over a long-term time horizon to identify possible transition pathways. Example cases show how various parameters affect optimal investment pathways, stressing the necessity of appropriate planning tools for analyzing diverse cases.

A penalty-free hybrid algorithm framework based on feasible stream matching principle for large-scale heat exchanger networks synthesis

In this work, a penalty-free hybrid stochastic-deterministic algorithm framework is proposed for large-scale heat exchanger networks (HENs) synthesis (HENS), formulated as a computationally-hard mixed-integer nonlinear programming (MINLP) problem. In the outer level, an improved genetic algorithm (GA) is developed to optimize process stream matches represented by integer variables whose values are generated by a unique heat exchanger vector. Unlike previous researches, the improved GA does not rely on any penalty terms, because we propose a feasible stream matching principle to exclude all infeasible process stream matches and only feasible matches are considered in optimization process. In the inner level, a reduced-size MINLP model is solved using deterministic methods to minimize total annualized costs (TACs), which are then used to evaluate the fitness of candidate HENs. Through this way, the proposed framework combines deterministic and stochastic methods to enhance optimization efficiency and global search capability. Illustrative tests on six benchmark cases demonstrate that the framework can efficiently achieve lower-cost solutions compared to deterministic, stochastic, or hybrid methods. The results show a decrease in TAC for all six cases and a reduction in solution time ranging from 11.1% to 97.2%. Importantly, the proposed framework can be extended to solve MINLP problems in other process networks.

Demand Response Power-Gas Interconnection Energy System and Power Metering Based on SOGA

Under the double background of global energy crisis and environmental pollution, China vigorously develops renewable energy while accelerating the construction of energy Internet. Taking demand response into account, this paper proposes the optimal design of power-gas interconnection energy system and power metering, and establishes the optimization research model of IEGES (integrated electricity-gas energy system) with demand response. Firstly, the structure model of the electric-gas interconnection energy system with CHP (Cogeneration, combined heat and power) as the core is constructed, and the energy conversion relationship and different energy flow directions of the coupling equipment are expounded from three aspects. The natural gas source point, pipeline equation, power side branch equation, voltage and current equation are modeled and sorted out, and the square term in the equation is linearized by second-order cone programming method, and the mixed integer nonlinear programming problem is transformed into mixed integer linear programming problem. A single objective genetic algorithm with “elite strategy” was selected to solve the equipment capacity optimization problem of IEGES system with system economy as the optimization objective. After a long time of parameter combination attempts, the current population size is 30, the number of iterations is 600, the crossover rate is 0.8, and the heritability is 0.3. The above parameters can obtain better convergence results on the basis of considering the operation time. Finally, a stochastic optimization method of energy Internet considering integrated demand response and uncertainty of wind power is proposed, which aims to meet the energy demand of end users while minimizing the operating cost of the system. The comprehensive demand response strategy including internal and external demand response is considered in the model. Internal demand response is realized by adjusting the internal operation mode of EH, while external demand response is implemented by the end user’s active response, and the load is time-shifted or interrupted under the guidance of external signals.

Lyapunov-guided Deep Reinforcement Learning for service caching and task offloading in Mobile Edge Computing

With the development of Internet of Things (IoT) networks and Mobile Edge Computing (MEC), many computing-intensive applications have been developed in large quantities. Due to the heterogeneity of tasks, different application services are required to perform each task. Caching application services and related data in edge servers is challenging. Hence, we study the service cache placement and task offloading problem in IoT networks. Since IoT devices and edge servers with limited storage resources can only cache a few services at the same time, we formulate the service cache placement and task offloading of IoT devices problem to minimize task service delay with long-term energy constraint of IoT devices, which is a mixed integer nonlinear programming problem. To solve this problem, an online Deep Reinforcement Learning guided by the Lyapunov optimization framework algorithm (LYADRL) is proposed. We first build a virtual queue model to decouple the problem by Lyapunov optimization technique to transform the problem into a single time slot optimization problem. Then, we use Deep Reinforcement Learning techniques to find the optimal edge service caching and task offloading policies for each time slot. Simulation results show that our algorithm can reduce the service delay compared with other benchmark algorithms.

Full-Duplex Unmanned Aerial Vehicle Communications for Cellular Spectral Efficiency Enhancement Utilizing Device-to-Device Underlaying Structure

Unmanned aerial vehicle (UAV) communications have gained recognition as a promising technology due to their unique characteristics of rapid deployment and flexible configuration. Meanwhile, device-to-device (D2D) and full-duplex (FD) technologies have emerged as promising methods for enhancing spectral efficiency and offloading traffic. One significant advantage of UAVs is their ability to partition suitable D2D pairs to increase cell capacity. In this paper, we present a novel network model in which UAVs are considered D2D pairs underlaying cellular networks, integrating FD into the communication links between UAVs to improve spectral efficiency. We then investigate a resource allocation problem for the proposed FD-UAV D2D underlaying structure model, with the objective of maximizing the system’s sum rate. Specifically, the UAVs in our model operate in full-duplex mode as D2D users (DUs), allowing the reuse of both the uplink and downlink subcarrier resources of cellular users (CUs). This optimization challenge is formulated as a mixed-integer nonlinear programming problem, known for its NP-hard and intractable nature. To address this issue, we propose a heuristic algorithm (HA) that decomposes the problem into two steps: power allocation and user pairing. The optimal power allocation is solved as a nonlinear programming problem by searching among a finite set, while the user pairing problem is addressed using the Kuhn–Munkres algorithm. The numerical results indicate that our proposed FD-MaxSumCell-HA (full-duplex UAVs maximizing the cell sum rate with a heuristic algorithm) scheme for FD-UAV D2D underlaying models outperforms HD-UAV underlaying cellular networks, with improved access rates for UAVs in FD-MaxSumCell-HA compared to HD-UAV networks.

Joint optimization of deployment, user association, channel, and resource allocation for fairness‐aware multi‐UAV network

AbstractThis paper studies the problem of joint deployment, user association, channel, and resource allocation in unmanned aerial vehicle‐enabled access network. Since different user equipments performing different tasks and have different data rate requirements, the priority‐based traffic fairness problem is investigated. This problem, however, is a mixed integer nonlinear programming problem with NP‐hard complexity, making it challenging to be solved. To address this issue, a self‐organized and distributed framework “sense‐as‐you‐fly” based on the decomposition process, which divides the original problem into several subproblems, is proposed. Assuming without central controller, we derive the closed‐form resource allocation scheme and propose distributed many‐to‐one matching to optimize user association subproblem. Considering the coupled characteristics, the multi‐unmanned aerial vehicle deployment and channel allocation subproblems are modelled as a local altruistic game. The existence of Nash equilibrium is proved with the aid of exact potential game and efficient best response learning‐based algorithm is proposed. The original problem is finally addressed by solving the sub‐problems alternately and iteratively. Simulation results verify its effectiveness. By jointly optimizing multidimensional variables, the proposed algorithm unlocks network performance gains, especially in resource‐limited regimes.

A Bayesian optimization approach for data‐driven mixed‐integer nonlinear programming problems

AbstractThe optimization of process systems within the field of Chemical Engineering often confronts uncertainties that can exert significant influences on the performance and dependability of the obtained solutions. This research endeavors to investigate the application of Bayesian optimization in the realm of constrained mixed integer nonlinear problems. A comparative analysis was conducted, exploring different surrogate models, and evaluating diverse kernel functions and acquisition functions. Furthermore, a sampling strategy was devised to assess the enhancement achieved by the acquisition function. The findings of this article reveal the superior performance of sparse Gaussian processes in conjunction with computationally inexpensive acquisition functions, thereby highlighting their suitability for addressing mixed integer nonlinear programming problems characterized by noisy functions and stochastic behavior. Consequently, this article presents a computationally efficient approach to effectively tackle the challenges associated with data‐driven mixed integer nonlinear programming problems within the domain of Process System Engineering.