We present an ideal mixed-integer programming (MIP) formulation for a rectified linear unit (ReLU) appearing in a trained neural network. Our formulation requires a single binary variable and no additional continuous ...
详细信息
ISBN:
(数字)9783030179533
ISBN:
(纸本)9783030179533;9783030179526
We present an ideal mixed-integer programming (MIP) formulation for a rectified linear unit (ReLU) appearing in a trained neural network. Our formulation requires a single binary variable and no additional continuous variables beyond the input and output variables of the ReLU. We contrast it with an ideal "extended" formulation with a linear number of additional continuous variables, derived through standard techniques. An apparent drawback of our formulation is that it requires an exponential number of inequality constraints, but we provide a routine to separate the inequalities in linear time. We also prove that these exponentially-many constraints are facet-defining under mild conditions. Finally, we study network verification problems and observe that dynamically separating from the exponential inequalities (1) is much more computationally efficient and scalable than the extended formulation, (2) decreases the solve time of a state-of-the-art MIP solver by a factor of 7 on smaller instances, and (3) nearly matches the dual bounds of a state-of-the-art MIP solver on harder instances, after just a few rounds of separation and in orders of magnitude less time.
A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solv...
详细信息
ISBN:
(纸本)9781424483570
A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solve them iteratively. The aim of upper level problem is to solve the mixed-integer programming model with all identified constraints. For the lower level problem, all N-1 contingencies are checked one by one and the corresponding constraints are added the upper level problem if line overload or network split is found. Each constraint is formed based on rigorous sensitivity or network topology analysis. The iteration between the two subproblems stops till a satisfactory planning solution is reached. Test results on two systems show effectiveness of the proposed method.
作者:
Okubo, TakumaTakahashi, MasakiKeio Univ
Grad Sch Sci & Technol Kohoku Ku 3-14-1 Hiyoshi Yokohama Kanagawa 2238522 Japan Keio Univ
Fac Sci & Technol Dept Syst Design Engn Kohoku Ku 3-14-1 Hiyoshi Yokohama Kanagawa 2238522 Japan
Lately, there has been a need to improve the efficiency of material movements within factories and multi-agents are required to perform these tasks. In this study, graphical representation and mixed-integer programmin...
详细信息
ISBN:
(纸本)9788993215243
Lately, there has been a need to improve the efficiency of material movements within factories and multi-agents are required to perform these tasks. In this study, graphical representation and mixed-integer programming have been adopted for simultaneous optimization of task allocation and path planning for each agent to achieve the following three goals. First, this study realizes time and capacity constrained multi-agent pickup and delivery (TCMAPD) that simultaneously considers time constraints, capacity constraints, and collision avoidance. Previous studies have not considered these constraints simultaneously. Thus, we can solve the problems associated with using multi-agents in actual factories. Second, we achieved TCMAPD that optimizes the collision avoidance between multi-agents. In conventional research, only a single collision avoidance method can be used. However, an appropriate route was selected from a variety of avoidance methods in this study. Hence, we could achieve a more efficient task allocation and path planning with collision avoidance. Third, the proposed method simultaneously optimizes task allocation and path planning for each agent. Previous studies have separately considered the approach of optimizing task allocation and path planning or used the cost of path planning after task allocation to again perform task allocation and path planning. To simultaneously optimize them in a single plan, we have developed a solution-derivable formulation using mixed-integer programming to derive a globally optimal solution. This enables efficient planning with a reduced total time traveled by the agents.
Adapting to the consequences of climate change is one of the central challenges faced by humanity in the next decades. One of these consequences are intense heavy rain events, which can cause severe damage to building...
详细信息
In this paper, an under development mixed-integer programming model is presented and used to solve the Production-Inventory-Distribution-Routing Problem (PIDRP), the main objective is to minimize the total cost of pro...
详细信息
ISBN:
(纸本)9781467380669
In this paper, an under development mixed-integer programming model is presented and used to solve the Production-Inventory-Distribution-Routing Problem (PIDRP), the main objective is to minimize the total cost of production, inventory, and transportation without violating the demand fulfillment policy. The proposed model deals with multiple products with different characteristics, split deliveries, a heterogeneous fleet of vehicles, and a route limitation for each vehicle. The main contribution of this work is the validation of the mathematical model and testing it for solving small-sized instances from literature.
In this paper, we explore model-based approach to training robust and interpretable binarized regression models for multiclass classification tasks using mixed-integer programming (MIP). Our MIP model balances the opt...
详细信息
ISBN:
(纸本)9781665487689
In this paper, we explore model-based approach to training robust and interpretable binarized regression models for multiclass classification tasks using mixed-integer programming (MIP). Our MIP model balances the optimization of prediction margin and model size by using a weighted objective that: minimizes the total margin of incorrectly classified training instances, maximizes the total margin of correctly classified training instances, and maximizes the overall model regularization. We conduct two sets of experiments to test the classification accuracy of our MIP model over standard and corrupted versions of multiple classification datasets, respectively. In the first set of experiments, we show that our MIP model outperforms an equivalent Pseudo-Boolean Optimization (PBO) model and achieves competitive results to Logistic Regression (LR) and Gradient Descent (GD) in terms of classification accuracy over the standard datasets. In the second set of experiments, we show that our MIP model outperforms the other models (i.e., GD and LR) in terms of classification accuracy over majority of the corrupted datasets. Finally, we visually demonstrate the interpretability of our MIP model in terms of its learned parameters over the MNIST dataset. Overall, we show the effectiveness of training robust and interpretable binarized regression models using MIP.
In recent years, load monitoring and analysis have played an increasingly important role in power system dispatch management. Although event-based non-intrusive load monitoring methods have made some progress in theor...
详细信息
ISBN:
(纸本)9798350386783;9798350386776
In recent years, load monitoring and analysis have played an increasingly important role in power system dispatch management. Although event-based non-intrusive load monitoring methods have made some progress in theory and practice, the increasing diversification and complexity of equipment types require enhanced recognition accuracy of existing methods. It is challenging to capture the power usage behavior of multi-state appliances. In this paper, a load matching method based on mixed-integer programming is proposed to assist in correcting the event detection identification results. This method involves constructing a matching matrix and solving it by considering event matching constraints, power matching constraints, and the number of matches constraints. The goal is to minimize the power error and the penalty terms associated with the number of matches constraints. Through arithmetic analysis of 546 real data in the public dataset PLAID, the method achieves an accuracy of 92.13%. This validates the effectiveness of mixed-integer programming modeling and demonstrates its potential as a supplementary tool for improving load identification results.
This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be i...
详细信息
ISBN:
(纸本)9783037858967
This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively;(2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.
In order to keep roads in acceptable condition, and to perform maintenance of essential infrastructure, roadworks are required. Due to the increasing traffic volumes and the increasing urbanisation, road agencies are ...
详细信息
ISBN:
(纸本)9783030649838;9783030649845
In order to keep roads in acceptable condition, and to perform maintenance of essential infrastructure, roadworks are required. Due to the increasing traffic volumes and the increasing urbanisation, road agencies are currently facing the problem of effective planning frequent -and usually concurrent- roadworks in the controlled region. However, there is a lack of techniques that can support traffic authorities in this task. In fact, traffic authorities have usually to rely on human experts (and their intuition) to decide how to schedule and perform roadworks. In this paper, we introduce a mixed-integer programming approach that can be used by traffic authorities to plan a set of required roadworks, over a period of time, in a large urban region, by specifying constraints to be satisfied and suitable quality metrics.
Today's fast linear algebra and numerical optimization tools have pushed the frontier of model predictive control (MPC) forward, to the efficient control of highly nonlinear and hybrid systems. The field of hybrid...
详细信息
Today's fast linear algebra and numerical optimization tools have pushed the frontier of model predictive control (MPC) forward, to the efficient control of highly nonlinear and hybrid systems. The field of hybrid MPC has demonstrated that exact optimal control law can be computed, e. g., by mixed-integer programming (MIP) under piecewise-affine (PWA) system models. Despite the elegant theory, online solving hybrid MPC is still out of reach for many applications. We aim to speed up MIP by combining geometric insights from hybrid MPC, a simple-yet-effective learning algorithm, and MIP warm start techniques. Following a line of work in approximate explicit MPC, the proposed learning-control algorithm, LNMS, gains computational advantage over MIP at little cost and is straightforward for practitioners to implement. Copyright (C) 2020 The Authors.
暂无评论