Results 21 to 30 of about 3,006 (163)

Price‐based unit commitment with decision‐dependent uncertainty in hourly demand

open access: yesIET Smart Grid, 2022
The price‐based unit commitment (PBUC) problem aims to optimise the power generating units' schedules to meet the system demand with the objective to maximise the generation companies' (GENCOs') profit.
Jinshun Su   +2 more
doaj   +1 more source

An Algorithm for Solving Quadratic Programming Problems [PDF]

open access: yesComputer Science Journal of Moldova, 1997
Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix ...
V. Moraru
doaj  

Energy Efficiency Maximization for Multi-Cell Multi-Carrier NOMA Networks

open access: yesSensors, 2020
As energy efficiency (EE) is a key performance indicator for the future wireless network, it has become a significant research field in communication networks. In this paper, we consider multi-cell multi-carrier non-orthogonal multiple access (MCMC-NOMA)
Abuzar B. M. Adam   +2 more
doaj   +1 more source

SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX [PDF]

open access: yesJournal of Engineering Science (Chişinău), 2022
The purpose of this paper is the approach of a mathematical model dedicated to planning the consecutive days off of a company’s employees. Companies must find a flexible work schedule between employees, always considering the satisfaction of work tasks ...
MORARU, Vasile   +2 more
doaj   +1 more source

Tree-serial parametric dynamic programming with flexible prior model for image denoising [PDF]

open access: yesКомпьютерная оптика, 2018
We consider here image denoising procedures, based on computationally effective tree-serial parametric dynamic programming procedures, different representations of an image lattice by the set of acyclic graphs and non-convex regularization of a new type ...
Pham Cong Thang   +1 more
doaj   +1 more source

Primal-Dual Method of Solving Convex Quadratic Programming Problems [PDF]

open access: yesComputer Science Journal of Moldova, 2000
This paper presents a primal-dual method for solving quadratic programming problems. The method is based on finding an exact solution of a finite sequence of unconstrained quadratic prigraamming problems and on finding an aproximative solution of ...
V. Moraru
doaj  

Global solution of non-convex quadratically constrained quadratic programs [PDF]

open access: yesOptimization Methods and Software, 2017
The class of mixed-integer quadratically constrained quadratic programs (QCQP) consists of minimizing a quadratic function under quadratic constraints where the variables could be integer or continuous. On a previous paper we introduced a method called MIQCR for solving QCQPs with the following restriction: all quadratic sub-functions of purely ...
Elloumi, Sourour, Lambert, Amélie
openaire   +2 more sources

Twin Support Vector Regression Model Based on Heteroscedastic Gaussian Noise and Its Application

open access: yesIEEE Access, 2022
The main purpose of twin support vector regression (TSVR) is to find linear or nonlinear relationships in sample data, and then predict future data. TSVR is the decomposition of a large convex quadratic programming problem into two small convex quadratic
Shiguang Zhang   +3 more
doaj   +1 more source

Ellipsoid Bounds for Convex Quadratic Integer Programming

open access: yesSIAM Journal on Optimization, 2015
Summary: Solving convex quadratic integer minimization problems by a branch-and-bound algorithm requires tight lower bounds on the optimal objective value. To obtain such dual bounds, we follow the approach of \textit{C. Buchheim} et al. [Math. Program. 135, No.
Christoph Buchheim   +2 more
openaire   +3 more sources

Dynamic Positioning Capability Assessment Based on Optimal Thrust Allocation

open access: yesPolish Maritime Research, 2023
The article presents an efficient method of optimal thrust allocation over the actuators in a dynamically positioned ship, according to the DNV-ST-0111 standard, Level 1.
Piekło Agnieszka   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy