For including piecewiselinear (PWL) functions in MILP problems, the logarithmic convex combination (Log) formulation has been shown to yield very fast solving times. However, identifying approximations that can be us...
详细信息
For including piecewiselinear (PWL) functions in MILP problems, the logarithmic convex combination (Log) formulation has been shown to yield very fast solving times. However, identifying approximations that can be used with Log is a big challenge since the approximation has to be compatible with a J1 triangulation. In this article, an algorithm is proposed that identifies approximations using J1 compatible triangulations. It seeks to satisfy the specified error tolerance with the minimum number of linear pieces, so that the MILP formulation is small. To evaluate the performance of the J1 approach it is applied to two sets of benchmark functions from literature and results are compared to state-of-the-art approaches. Overall the J1 approach is shown to efficiently approximate functions in up to 3 dimensions. Especially for tight error tolerances, these J1 approximations require fewer auxiliary variables in MILP compared to alternative approaches.
The problem of minimizing a separable nonlinear objective function under linear constraints is considered in this paper. A systematic approach is proposed to obtain an approximately globally optimal solution via piece...
详细信息
The problem of minimizing a separable nonlinear objective function under linear constraints is considered in this paper. A systematic approach is proposed to obtain an approximately globally optimal solution via piecewise-linear approximation. By means of the new approach a minimum point of the original problem confined in a region where more than one linear piece is needed for satisfactory approximation can be found by solving only one linear programming problem. Hence, the number of linear programming problems to be solved for finding the approximately globally optimal solution may be much less than that of the regions partitioned. In addition, zero-one variables are not introduced in this approach. These features are desirable for efficient computation. The practicability of the approach is demonstrated by an example. (c) 2005 Elsevier B.V. All rights reserved.
This paper considers the problem of optimizing a continuous nonlinear objective function subject to linear constraints via a piecewise-linear approximation. A systematic approach is proposed, which uses a lattice piec...
详细信息
This paper considers the problem of optimizing a continuous nonlinear objective function subject to linear constraints via a piecewise-linear approximation. A systematic approach is proposed, which uses a lattice piecewise-linear model to approximate the nonlinear objective function on a simplicial partition and determines an approximately globally optimal solution by solving a set of standard linear programs. The new approach is applicable to any continuous objective function rather than to sepal-able ones only and could be useful to treat more complex nonlinear problems. A numerical example is given to illustrate the practicability. (C) 2007 Elsevier B.V. All rights reserved.
This paper deals with the approximation of smooth functions using canonical piecewise-linear functions. The developing of tools in the field of analysis and control of nonlinear systems based on this kind of functions...
详细信息
This paper deals with the approximation of smooth functions using canonical piecewise-linear functions. The developing of tools in the field of analysis and control of nonlinear systems based on this kind of functions, as well as its efficiency in the representation of electronic devices, motivates the development of useful methods to obtain accurate approximations. A recursive method is proposed to obtain simultaneously all the parameters required and its convergence is studied. In addition, an iterative method to introduce new partitions on the domain, when the error obtained is not satisfactory, is described. This method takes advantage of the partitions already found to reduce the total number of parameters that the algorithm has to handle.
This paper briefly shows the influence of handmade picewise-linearapproximation on the global dynamics on the selected third-order systems with the quadratic vector fields. These effects are demonstrated using concep...
详细信息
ISBN:
(纸本)9781457714115
This paper briefly shows the influence of handmade picewise-linearapproximation on the global dynamics on the selected third-order systems with the quadratic vector fields. These effects are demonstrated using concept of the Ljapunov exponents calculation. The approximated systems are verified by means of the real electronic circuits derived using integrator synthesis and time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is discussed and future perspectives are provided.
Power injection variations that occur in power systems are generally nonlinear. A continuation power flow method with multiple nonlinear power injection variations is presented in this paper. To model the nature of no...
详细信息
Power injection variations that occur in power systems are generally nonlinear. A continuation power flow method with multiple nonlinear power injection variations is presented in this paper. To model the nature of nonlinear power injection variations, a piecewise-linear model is proposed to approximate the nonlinear model of power injections. The piecewise-linear model is studied and incorporated into continuation power flow, making it capable of handling nonlinear power injection variations. The impacts of linear as well as nonlinear load variations on the P-V curve, Q-V curve, and P-Q-V curve are numerically analyzed on test power systems. Numerical studies indicate that the direction of power injection variation can significantly affect the load margin and that the differences between uniform linear power injection directions and multiple nonlinear power injection variations can be significant. The importance of accurately modeling power injection variations on simulated power system quasi-state behaviors is stressed.
We introduce α-functions, providing piecewiselinearapproximation to given data as the difference of two convex functions. The parameter α controls the shape of a paraboloid that is probing the data and may be used...
详细信息
ISBN:
(纸本)9781450393379
We introduce α-functions, providing piecewiselinearapproximation to given data as the difference of two convex functions. The parameter α controls the shape of a paraboloid that is probing the data and may be used to filter out noise in the data. The use of convex functions enables tools for efficient approximation to the data, adding robustness to outliers, and dealing with gradient information. It also allows using the approach in higher dimension. We show that α-functions can be efficiently computed and demonstrate their versatility at the example of surface reconstruction from noisy surface samples.
To realize adaptive operation planning with MILP unit commitment, piecewise-linear approximations of the functions that describe the operating behavior of devices in the energy system have to be computed. We present a...
详细信息
To realize adaptive operation planning with MILP unit commitment, piecewise-linear approximations of the functions that describe the operating behavior of devices in the energy system have to be computed. We present an algorithm to compute a piecewise-linear approximation of a multi-variate non-linear function. The algorithm splits the domain into two regions and approximates each region with a set of hyperplanes that can be translated to a convex set of constraints in MILP. The main advantage of this "piecewise-convex approximation"(PwCA) compared to more general piecewise-linear approximation with simplices is that the MILP representation of PwCA requires only one auxiliary binary variable. For this reason, PwCA yields significantly faster solving times in large MILP problems where the MILP representation of certain functions has to be replicated many times, such as in unit commitment. To quantify the impact on solving time, we compare the performance using PwCA with the performance of simplex approximation with logarithmic formulation and show that PwCA outperforms the latter by a big margin. For this reason, we conclude that PwCA will be a useful tool to set up and solve large MILP problems such as arise in unit commitment and similar engineering optimization problems.
This paper proposes a Max-piecewise-linear (MPWL) Neural Network for function approximation. The MPWL network consists of a single hidden layer and employs the piecewise-linear (PWL) Basis Functions as the activation ...
详细信息
This paper proposes a Max-piecewise-linear (MPWL) Neural Network for function approximation. The MPWL network consists of a single hidden layer and employs the piecewise-linear (PWL) Basis Functions as the activation functions of hidden neurons. Since a PWL Basis Function possesses a simple functional form and universal representation capability, the MPWL network achieves a good balance between the computational simplicity and approximation accuracy. In addition, a PAIL version of Back-Propagation (PBP) algorithm is developed, whose computational complexity is lower than the training algorithms for the Canonical PWL network, and the Back-Propagation algorithm for the sigmoid network with same number of training cycles. Another advantage of the MPWL network is its amenability to hardware implementation. This facilitates many applications such as nonlinear circuit synthesis, dynamic identification and control. (c) 2007 Elsevier B.V. All rights reserved.
This study proposes a new approach to solve the transmission expansion planning (TEP) problem considering that the network is represented by a non-linear model. Non-linear constraints are approximated with piecewise-l...
详细信息
This study proposes a new approach to solve the transmission expansion planning (TEP) problem considering that the network is represented by a non-linear model. Non-linear constraints are approximated with piecewise-linear (PWL) functions, which renders TEP a mixed-integer linear programming (MILP) problem. This study presents MILP formulations obtained from the PWL approximation using the incremental, special ordered sets of type 2 (SOS2) and the logarithmic convex combination (Log) model. Three test systems are used to assess the effectiveness of the formulations. The computational analysis encompasses a baseline formulation, which accounts for the costs on line installation and transmission losses, and a variation of this formulation which minimises the operating costs rather than transmission losses. The results obtained by the MILP models are compared with those of a transmission planning model based on the DC representation of the network. The analysis of the results showed that expansion plans obtained from the MILP formulations are feasible, whereas the plans derived from the DC model are infeasible with respect to system constraints.
暂无评论