Results 51 to 60 of about 733 (116)

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

, 2011
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro, Margot, Francois, Qualizza, Andrea   +2 more
core   +2 more sources

Comparison of the formulations for a hub-and-spoke network design problem under congestion [PDF]

, 2016
In this paper, we study the hub location problem with a power-law congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on valid inequalities of perspective ...
Kargar, K, Kian, R
core   +2 more sources

An Automated Load Restoration Approach for Improving Load Serving Capabilities in Smart Urban Networks

Urban Science
In this paper, a very fast and reliable strategy for load restoration utilizing optimal distribution feeder reconfiguration (DFR) is developed. The automated network configuration switches can improve the resilience of a microgrid (MG) equipped with a ...
Ali Esmaeel Nezhad, Mohammad Sadegh Javadi, Farideh Ghanavati, Toktam Tavakkoli Sabour   +3 more
doaj   +1 more source

Unit commitment with valve-point loading effect [PDF]

, 2014
Valve-point loading affects the input-output characteristics of generating units, bringing the fuel costs nonlinear and nonsmooth. This has been considered in the solution of load dispatch problems, but not in the planning phase of unit commitment.
Ana Viana, Ana Viana, João Pedro Pedroso, João Pedro Pedroso, Mikio Kubo, Mikio Kubo, Rua Do Campo Alegre   +6 more
core   +1 more source

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

, 2017
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin, 2016). The main
AA Ageev, AV Eremeev, AV Eremeev, JW Osborne, L Greco, MR Garey, PA Borisovsky, PA Borisovsky, T Waal de   +8 more
core   +1 more source

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs [PDF]

, 2013
Quadratic Convex Reformulation (QCR) is a technique that was originally proposed for quadratic 0-1 programs, and then extended to various other problems.
Galli, Laura, Letchford, Adam
core   +1 more source

Model Predictive Control-Based Energy Management System for Cooperative Optimization of Grid-Connected Microgrids

Energies
This paper presents a model predictive control (MPC)-based energy management system (EMS) for optimizing cooperative operation of networked microgrids (MGs).
Sungmin Lim, Jaekyu Lee, Sangyub Lee
doaj   +1 more source

Maximum Resilience of Artificial Neural Networks

, 2017
The deployment of Artificial Neural Networks (ANNs) in safety-critical applications poses a number of new verification and certification challenges. In particular, for ANN-enabled self-driving vehicles it is important to establish properties about the ...
IE Grossmann, L Pulina, L Pulina, N Bjørner, S Rajan, Y Xu, YS Abu-Mostafa   +6 more
core   +1 more source

Emergency Response Strategy for Power System Resilience Improvement Based on Network Reconfiguration and Mobile Emergency Generator Deployment

Energies
Power distribution systems face increasing threats from high-impact, low-probability (HILP) events caused by extreme weather conditions such as floods, typhoons, droughts, and heatwaves.
Arif Fikri Malek, Hazlie Mokhlis, Nurulafiqah Nadzirah Mansor, Jasrul Jamani Jamian, Hasmaini Mohamad, Lilik Jamilatul Awalin, Suhail Afzal, Munir Azam   +7 more
doaj   +1 more source

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming

, 2019
Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxations and spatial branching work similar as mixed integer programming (MIP ...
A Forsgren, AH Land, AH Land, B Davey, C Mészáros, GP McCormick, GR Kocis, HW Kuhn, I Quesada, J Kronqvist, J Nocedal, J Nocedal, J Viswanathan, J Witzig, JF Benders, JP Marques-Silva, L Liberti, LG Khachiyan, MA Duran, ML Ginsberg, MR Kılınç, OK Gupta, P Bonami, R Fletcher, R Horst, RE Bixby, RJ Dakin, RM Stallman, S Mehrotra, S Vigerske, SA Vavasis, T Achterberg, T Achterberg, T Achterberg, T Berthold, T Berthold, T Westerlund, Y Jiang   +37 more
core   +1 more source