- Research Article
9
- 10.1016/0377-2217(95)00245-6
Ranking in quadratic integer programming problems
- Nov 01, 1996
- European Journal of Operational Research
- Renu Gupta + 2 more +2
Ranking in quadratic integer programming problems
An enumerative algorithm framework for a class of nonlinear integer programming problems
Ranking in quadratic integer programming problems
Ranking in quadratic integer programming problems
Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach
We present in this paper an integer diagonalization approach for deriving new lower bounds for general quadratic integer programming problems. More specifically, we introduce a semiunimodular transformation in order to diagonalize a symmetric matrix and preserve integral property of the feasible set at the same time. Via the semiunimodular transformation, the resulting separable quadratic integer program is a relaxation of the nonseparable quadratic integer program. We further define the integer diagonalization dual problem to identify the best semiunimodular transformation and analyze some basic properties of the set of semiunimodular transformations for a rational symmetric matrix. In particular, we present a complete characterization of the set of all semiunimodular transformations for a nonsingular 2×2 symmetric matrix. We finally discuss Lagrangian relaxation and convex relaxation schemes for the resulting separable quadratic integer programming problem and compare the tightness of different relaxation schemes.
Read moreFully Fuzzy Quadratic programming with unrestricted Fully Fuzzy variables and Parameters
<p>There exist several methods for solving fuzzy linear or nonlinear programming problems under positivity fuzzy variables and restricted fuzzy coefficients. Due to the limitation of these methods, they can’t be applied for solving fully fuzzy linear or non- linear programming problems with unrestricted fuzzy coefficients and fuzzy variables. In this paper an efficient method to find the fuzzy optimal solution for fully fuzzy quadratic programming (FFQP) problem with unrestricted variables and parameters has been proposed. All the coefficients and decision variables of both objective functions and the constraints are triangular fuzzy numbers. The proposed method is based on converted FFQP problem into crisp quadratic programming (CQP) problem. Finally an illustrative numerical example has been given to clarify the proposed solution method.</p>
Read moreConverting general nonlinear programming problems into separable programming problems with feedforward neural networks
Converting general nonlinear programming problems into separable programming problems with feedforward neural networks
Bounds for convex quadratic programming problems and some important applications
This paper proposes bounds for the objective function of convex quadratic programming problem (QPP) in general form. The method uses just the eigenvalues of the Hessian matrix. By use of the eigenvalues of the Hessian matrix and solving two simple optimisation problems, we propose an interval which contains the optimal value of QPP. This method can be useful for complicated and large scale optimisation problems as well as for the integer quadratic programming problems and also can be used as a start interval for the other existing mathematical methods for QPP. Another application of the proposed interval is to help the decision maker in real applications to estimate the bounds of the optimal solution. Thus the method is useful from both theoretical and practical approaches. This method can also be applied to solve fractional quadratic programming problems as well as for binary and mixed integer quadratic programming problems. Sensitivity analysis for the objective function is another application of the method which will be discussed. To illustrate the method, several problems are solved.
Read moreGrouping and selecting singular spectral analysis components for denoising based on empirical mode decomposition via integer quadratic programming
This study proposes an integer quadratic programming method for grouping and selecting the singular spectral analysis components based on the empirical mode decomposition for performing the denoising. Here, the total number of the grouped singular spectral analysis components is equal to the total number of the intrinsic mode functions. The singular spectral analysis components are assigned to the group indexed by the corresponding intrinsic mode function where the two norm error between the corresponding intrinsic mode function and the sum of the grouped singular spectral analysis components is minimum. Actually, this assignment of the singular spectral analysis components to a particular group is an integer quadratic programming problem. However, the required computational power for finding the solution of the integer quadratic programming problem is high. On the other hand, by representing the integer quadratic programming problem as an integer linear programming problem and employing an existing numerical optimisation computer aided design tool for finding the solution of the integer linear programming problem, the solution can be found efficiently. Computer numerical simulation results are presented.
Read moreFast interior point solution of quadratic programming problems arising from PDE-constrained optimization
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To tackle complex problems and achieve high accuracy in the solution, one is required to solve matrix systems of huge scale resulting from Newton iteration, and hence fast and robust methods for these systems are required. We present preconditioned iterative techniques for solving a number of these problems using Krylov subspace methods, considering in what circumstances one may predict rapid convergence of the solvers in theory, as well as the solutions observed from practical computations.
Read moreAn effective algorithm for a surface mounting machine in printed circuit board assembly
This paper considers the problem of minimizing the time required to populate a printed circuit board using a surface mounting machine. The total assembly time depends on two optimization problems; reel assignment problem (RAP) and pick-and-place sequencing problem (PAPSP). We formulate RAP as a quadratic integer programming problem and PAPSP as an asymmetric travelling salesman problem. Since these problems are NP-hard, we focus on the development of heuristics that yield near optimal solutions in a reasonable time. The implementation of these methods have achieved an average saving of 31% over randomly generated sequences in total assembly time.
Read moreThe Sequence Reconstruction Problem
Despite recent advances, assembly of genomes from the high-throughput data generated by the next-generation sequencing (NGS) technologies remains one of the most challenging tasks in modern biology. Here we address the sequence reconstruction problem, whereby, for a given collection of subsequences or factors, one has to determine the set of sequences compliant with the collection. First, we give a brief review of sequencing technologies, along with an exposition of the advantages and shortcomings of the existing algorithmic approaches to sequence assembly. In addition, we enumerate some properties of subsequences, which have been overlooked in the existing heuristic solutions despite their effect on the quality of the assembly. We then give an overview of the sequence reconstruction problem from a language-theoretic perspective, and present a comprehensive review of theoretical results that may prove relevant to the genome assembly problem. Finally, we outline a new optimization-based formulation which casts the sequence reconstruction problem as a quadratic integer programming problem.
Read moreConstrained Optimization of L-Lysine Production Based on Metabolic Flux Using a Mathematical Programming Method.
Constrained optimization for microbial fermentation was studied. For optimization, we used not the maximum principle but a nonlinear programming method because of the need to consider many metabolic reactions. In the case of L-lysine fermentation, the optimization problem in L-lysine production was formulated as a nonlinear programming problem. In general, the state equations based on material balances are represented as differential equations, but such equations which are dependent on time can not be applied to a nonlinear programming problem. Therefore, the state equations were made discrete in a time base, and a new single vector which is not dependent on time was substituted. From these formulae, the objective function and the constraints using nonlinear programming problem were defined as the amount of L-lysine produced, and as a metabolic reaction model and empirical equations, respectively. Computer program was developed to solve this constrained nonlinear programming problem. The applied algorithm of the computer programming was a sequential quadratic programming method (SQP method). When the constrained nonlinear programming problem is solved using the SQP method, the maximum amount of L-lysine produced and the optimal feeding rate of L-threonine could be calculated. From the calculated results, it was clear that introduction of the equality and inequality constraints was easy. L-Lysine at a concentration up to 75.3 g/l could be produced when the fermentation was carried out under optimal conditions.
Read moreEnergy management for vehicular electric power systems
The electric energy consumption in passenger vehicles is rapidly increasing. To limit the associated increase in fuel consumption, an energy management system has been developed. This system exploits the fact that the losses in the internal combustion engine vary with the operating point, and uses the possibility to temporarily store electric energy in a battery, such that electric energy is only produced at moments when it is cheap to generate. To come to a practically applicable solution, a vehicle model is derived, containing only the component characteristics relevant for this application. The energy management problem is formulated as an optimization problem. The fuel consumption over a driving cycle is minimized, while respecting physical limitations of the components and maintaining an acceptable energy level of the battery. Several optimization methods are studied to come to a solution. The dynamic optimization problem is solved using Dynamic Programming. After rewriting it as a static optimization problem and approximating the cost function by a quadratic function, the problem is solved using Quadratic Programming, which requires less computation time. A real-time implementable strategy has been derived from the Quadratic Programming problem, that does not require a prediction of the future driving cycle. This strategy compares the current cost of producing electric energy with the estimated average cost. By adapting the average cost based on the energy level of the battery, it is ensured that the battery energy level will remain around the desired value. Simulations show that a fuel reduction up till 2% can be obtained on a conventional vehicle without major hardware changes. Higher reductions are possible on the exhaust emissions. To predict and explain the amount of fuel reduction that can be obtained with a given vehicle configuration, a set of engineering rules is derived based on typical component characteristics. Their results correspond reasonably well with the simulations. An advanced power net topology is studied which contains both a battery and an ultracapacitor that are connected by a DC-DC converter and a switch. Because of the increased complexity, this system is modeled using linear and piecewise linear approximations of the component characteristics, such that the energy management problem can be casted as a Linear Programming problem. The discrete switch makes it a Mixed Integer Linear Programming Problem. A realtime strategy, similar to the strategy for the conventional power net, has been derived. The addition fuel reduction that is obtained with the dual storage power net is small, because the maximum profit that can be obtained with an ideal lossless battery is not much higher than with a normal battery. Subsequently, hybrid electric vehicles are studied that use an Integrated Starter Generator which can be used for generating electric power and for vehicle propulsion. Several conSummary figurations are studied with respect to their potential fuel reduction. Configurations that enable start-stop operation of the engine obtain a much higher fuel reduction, up to 40%. The controllers are tested in real-time on a Hardware-in-the-Loop environment, where a vehicle simulation model is combined with existing electric components. It is shown that the electric power setpoints provided by an energy management strategy can be realized in practice.
Read moreJoint Placement of Phasor and Power Flow Measurements for Observability of Power Systems
We consider the problem of joint optimal placement of phasor measurement units (PMU) and conventional measurements to ensure full observability in power systems. The formulation is initially posed as a nonlinear integer programming problem and then transformed in to an equivalent integer linear programming (ILP) problem by introducing auxiliary variables and constraints. The resulting ILP problem is solved for the optimal solution on IEEE 14-, 57-, and 118-bus systems considering zero-injection buses. To extend the formulation to large-scale systems, two heuristics are proposed where the nonlinear problem is decomposed into two separate problems of lesser complexity. The heuristics are evaluated on standard IEEE test cases and a large 2383-bus Polish system. The heuristics yield solutions close to optimal (difference of 1 PMU) solutions on standard IEEE systems, while substantially reducing problem complexity and run time. The placement results obtained with the proposed formulation require fewer PMUs for observability compared to systems with fixed locations of conventional measurements. The results thus potentially provide a more economical solution to system observability compared to those obtained solely with PMU placement.
Read moreMODIFIED PARTICLE SWARM OPTIMIZATION INCORPORATED AN INTEGRATED APPROACH FOR SOLUTION OF QUADRATIC PROGRAMMING PROBLEMS USING PENALTY METHOD
The Quadratic Programming problem QPP is a special type of Non-linear linear programming problem in which the objective function is a multivariate quadratic function subject to linear constraints. Constraints can be equalities and inequalities. Many classical methods such as the graphical method, Beale’s method, Wolfe’s method, Karush-Kuhn Tucker conditions, etc. solve the QPP problem. Several non- traditional techniques like, Genetic algorithm, Particle swarm optimization, and Artificial bee colony algorithms have been introduced for the solution of different optimization problems. We used the Penalty method with Modified Particle swarm optimization (MPSO) incorporated integrated constriction factor and inertia weight to solve quadratic programming problems. Several computations have performed using the software MATLAB and the computational outcomes are compared with different variants such as Inertia and constriction factor, integrated inertia weight and constriction, Factor PSO-1 and integrated inertia weight and constriction Factor PSO-II approach. Only one random variable is used, r2 is used in terms of r1. Different modified parameters are used and the result of QPP.
Read moreMathematical Model of Object Classifier based on Bayesian Approach
The paper claims that the primary importance in solving the classification problem is to find the conditions for dividing the General complexity into classes, determine the quality of such a bundle, and verify the classifier model. We consider a mathematical model of a non-randomized classifier of features obtained without a teacher, when the number of classes is not set a priori, but only its upper bound is set. The mathematical model is presented in the form of a statement of a minimax conditional extreme task, and it is a problem of searching for the matrix of belonging of objects to a class, and representative (reference) elements within each class. The development of the feature classifier is based on the synthesis of two-dimensional probability density in the coordinate space: classes-objects. Using generalized functions, the probabilistic problem of finding the minimum Bayesian risk is reduced to a deterministic problem on a set of non-randomized classifiers. At the same time, the use of specially introduced constraints fixes non-randomized decision rules and plunges the integer problem of nonlinear programming into a General continuous nonlinear problem. For correct synthesis of the classifier, the dispersion curve of the isotropic sample is necessary. It is necessary to use the total intra-class and inter-class variance to characterize the quality of classification. The classification problem can be interpreted as a particular problem of the theory of catastrophes. Under the conditions of limited initial data, a minimax functional was found that reflects the quality of classification for a quadratic loss function. The developed mathematical model is classified as an integer nonlinear programming problem. The model is given using polynomial constraints to the form of a General problem of nonlinear continuous programming. The necessary conditions for the bundle into classes are found. These conditions can be used as sufficient when testing the hypothesis about the existence of classes.
Read moreAlgorithms for Nonlinear Programming.
: Several algorithms for solving problems in linear, quadratic, and nonlinear programming, network flows, and facilities location were developed and analyzed. Results include: (1) The analysis of the computational complexity of the problem of determining an optimally sparse representation of the null space of a matrix, and the development of worst-case bounds for the shadow-vertex simplex algorithm and several heuristics for distance constrained discrete facility location problems and conditional covering problems; (2) The development of efficient algorithms for dense and sparse assignment problems, strictly convex quadratic programming problems, and a nonlinear programming problem that arises when maximizing a correlation coefficient subject to linear constraints; and (3) The application of iterative methods to large sparse equality-constraind quadratic programs and the development of multiple constraint deletion strategies for active-set algorithms for linearly consrained nonlinear programming problems. (Author)
Read more