integer problem
Recently Published Documents


TOTAL DOCUMENTS

36
(FIVE YEARS 6)

H-INDEX

5
(FIVE YEARS 0)

2022 ◽  
Author(s):  
Leonardo Delarmelina Secchin ◽  
Guilherme Matiussi Ramalho ◽  
Claudia Sagastizábal ◽  
Paulo Silva ◽  
Kenny Vinente

The day-ahead problem of finding optimal dispatch and prices for the Brazilian power system is modeled as a mixed-integer problem, with nonconvexities related to fixed costs and minimal generation requirements for some thermal power plants. The computational tool DESSEM is currently run by the independent system operator, to define the dispatch for the next day in the whole country. DESSEM also computes marginal costs of operation that CCEE, the trading chamber, uses to determine the hourly prices for energy commercialization. The respective models sometimes produce an infeasible output. This work analyzes theoretically those infeasibilities, and proposes a prioritization to progressively resolve the constraint violation, in a manner that is sound from the practical point of view. Pros and cons of different mathematical formulations are analyzed. Special attention is put on robustness of the model, when the optimality requirements for the unit-commitment problem vary.


Author(s):  
S. Sathyapriya

The Travelling Salesman problem is considered as a binary integer problem. For this problem, several stop variables and subtours are discussed. The stops are generated and the distance between those stops are found, consequently the graphs are drawn. Further the variables are declared and the constraints are framed. Then the initial problem is visualised along with the subtour constraints in order to achieve the required output.


Author(s):  
Mounir Marrakchi ◽  
Mounira Belmabrouk

In this paper, we focus on schedulings of 2-steps graph with constant task cost obtained when parallelizing algorithm solving triangular linear system. We present three scheduling approaches having the same least theoretical execution time. The first is designed through solving a 0-1 integer problem by Mixed Integer Programming (MIP), the second is based on the Critical Path Algorithm (CPA) and the third is a particular Column-Oriented Scheduling (COS). The MIP approach experiments were carried out and confirmed that the makespan values of the MIP scheduling coincide with those of the corresponding lower bound already reached. Experimental results of the last two approaches detailing both makespans and efficiencies are presented and show that their practical performances differ though they are theoretically identical. We compare also these results to those of the appropriate procedure in to so-called PLASMA library (Parallel Linear Algebra for Scalable Multi-core Architectures)


Author(s):  
Elias Munapo

The chapter presents a new approach to improve the verification process of optimality for the general knapsack linear integer problem. The general knapsack linear integer problem is very difficult to solve. A solution for the general knapsack linear integer problem can be accurately estimated, but it can still be very difficult to verify optimality using the brach and bound related methods. In this chapter, a new objective function is generated that is also used as a more binding equality constraint. This generated equality constraint can be shown to significantly reduce the search region for the branch and bound-related algorithms. The verification process for optimality proposed in this chapter is easier than most of the available branch and bound-related approaches. In addition, the proposed approach is massively parallelizable allowing the use of the much needed independent parallel processing.


Author(s):  
Mehrdad Ahmadi Kamarposhti ◽  
Ersan Kabalci ◽  
Reza Alayi

Reconstructing power systems has changed the traditional planning of power systems and has raised new challenges in transmission expansion planning (TEP). In this paper, investment cost, cost of density and dependability have been considered three objectives of optimization. Also, multi-objective genetic algorithm NSGAII was used to solve this non-convex and mixed integer problem. A fuzzy decision method has been used to choose the final optimal answer from the Pareto solutions obtained from NSGAII. Moreover, to confirm the efficiency of NSGAII multi-objective genetic algorithm in solving TEP problem, the algorithm was implemented in an IEEE 24 bus system and the gained results were compared with previous works in this field.


Author(s):  
Aleksandr Batenkov ◽  
Kirill Batenkov ◽  
Andrey Bogachev ◽  
Vladislav Mishin

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.


Sign in / Sign up

Export Citation Format

Share Document