scholarly journals On mixed-integer sets with two integer variables

2011 ◽  
Vol 39 (5) ◽  
pp. 305-309 ◽  
Author(s):  
Sanjeeb Dash ◽  
Santanu S. Dey ◽  
Oktay Günlük
Author(s):  
John C. Steuben ◽  
Cameron J. Turner

The optimization of mixed-integer problems is a classic problem with many industrial and design applications. A number of algorithms exist for the numerical optimization of these problems, but the robust optimization of mixed-integer problems has been explored to a far lesser extent. We present here a general methodology for the robust optimization of mixed-integer problems using nonuniform rational B-spline (NURBs) based metamodels and graph theory concepts. The use of these techniques allows for a new and powerful definition of robustness along integer variables. In this work, we define robustness as an invariance in problem structure, as opposed to insensitivity in the dependent variables. The application of this approach is demonstrated on two test problems. We conclude with a performance analysis of our new approach, comparisons to existing approaches, and our views on the future development of this technique.


2010 ◽  
Vol 133 (1-2) ◽  
pp. 337-363 ◽  
Author(s):  
Daniel Bienstock ◽  
Benjamin McClosky

2015 ◽  
Vol 240 (1) ◽  
pp. 95-117 ◽  
Author(s):  
Alberto Del Pia ◽  
Robert Weismantel

2010 ◽  
Vol 124 (1-2) ◽  
pp. 455-480 ◽  
Author(s):  
Kent Andersen ◽  
Quentin Louveaux ◽  
Robert Weismantel

2005 ◽  
Vol 105 (1) ◽  
pp. 29-53 ◽  
Author(s):  
Sanjeeb Dash ◽  
Oktay Günlük

Algorithms ◽  
2020 ◽  
Vol 13 (9) ◽  
pp. 235 ◽  
Author(s):  
Bruno Colonetti ◽  
Erlon Cristian Finardi ◽  
Welington de Oliveira

Independent System Operators (ISOs) worldwide face the ever-increasing challenge of coping with uncertainties, which requires sophisticated algorithms for solving unit-commitment (UC) problems of increasing complexity in less-and-less time. Hence, decomposition methods are appealing options to produce easier-to-handle problems that can hopefully return good solutions at reasonable times. When applied to two-stage stochastic models, decomposition often yields subproblems that are embarrassingly parallel. Synchronous parallel-computing techniques are applied to the decomposable subproblem and frequently result in considerable time savings. However, due to the inherent run-time differences amongst the subproblem’s optimization models, unequal equipment, and communication overheads, synchronous approaches may underuse the computing resources. Consequently, asynchronous computing constitutes a natural enhancement to existing methods. In this work, we propose a novel extension of the asynchronous level decomposition to solve stochastic hydrothermal UC problems with mixed-integer variables in the first stage. In addition, we combine this novel method with an efficient task allocation to yield an innovative algorithm that far outperforms the current state-of-the-art. We provide convergence analysis of our proposal and assess its computational performance on a testbed consisting of 54 problems from a 46-bus system. Results show that our asynchronous algorithm outperforms its synchronous counterpart in terms of wall-clock computing time in 40% of the problems, providing time savings averaging about 45%, while also reducing the standard deviation of running times over the testbed in the order of 25%.


Author(s):  
Ryohei Yokoyama ◽  
Koichi Ito

To attain the highest economic and energy saving characteristics of gas turbine cogeneration plants, it is necessary to rationally determine capacities and numbers of gas turbines and auxiliary equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. Some optimization approaches based on the mixed-integer linear programming have been proposed to this design problem. However, equipment capacities have been treated as continuous variables, and correspondingly performance characteristics and capital costs of equipment have been assumed to be continuous functions with respect to their capacities. This is because if equipment capacities are treated discretely, the number of integer variables increases drastically, and the problem becomes too difficult to solve. As a result, the treatment of equipment capacities as continuous variables causes discrepancies between existing and optimized values of capacities, and expresses the dependence of performance characteristics and capital costs on capacities with worse approximations. In this paper, an optimal design method is proposed in consideration of discreteness of equipment capacities. A formulation for keeping the number of integer variables as small as possible is presented to solve the optimal design problem easily. This method is applied to the design of a gas turbine cogeneration plant, and its validity and effectiveness are clarified.


2021 ◽  
Vol 9 (ICRIE) ◽  
Author(s):  
Kamel A. Almohseen ◽  

The use of the traditional linear programming is not possible when an if-condition is to be imposed on the model unless some modifications are made. The difficulty arises due to the fact that the inclusion of if-condition to the generic formulation of the linear programming and its mechanism called "simplex method" is not a trivial task. The mixed integer linear programming seems to be a good candidate to achieve this goal. However, two issues should be satisfied beforehand if one would like to minimize the spill. 1. the reservoir should be full up to the spillway crest level in order for the spillage to occur. 2. the next state of the reservoir after the spill has been occurred should be full as well. Adding binary integer variables to the model helps in achieving the optimal solution in terms of minimum sum of spillage without violating any of the underlying constraints. When the input to the model being altered, the results showed that the model can cope with the uncertainty inherent in any natural inflow process in terms of spillage minimization.


Sign in / Sign up

Export Citation Format

Share Document