Results 31 to 40 of about 114,968,292 (129)

An Interior-Point algorithm for Nonlinear Minimax Problems [PDF]

open access: yes
We present a primal-dual interior-point method for constrained nonlinear, discrete minimax problems where the objective functions and constraints are not necessarily convex.
E. Obasanjo, G. Tzallas-Regas, B. Rustem
core  

Digital Twin‐Driven Two‐Stage Bi‐Level Collaborative Operation Strategy for Multi‐Microgrids Considering Energy Sharing and Price Incentives

open access: yesDigital Twins and Applications, Volume 3, Issue 1, January/December 2026.
ABSTRACT To enhance the techno‐economic performance and robustness of multi‐microgrids (MMG) systems, this paper proposes a two‐stage bi‐level collaborative optimisation strategy integrating energy sharing and price incentives. In the day‐ahead stage, the shared energy storage operator (SESO) at the upper level employs conditional Wasserstein ...
Xianghu Cui   +4 more
wiley   +1 more source

A Novel Heterogeneous Graph Attention‐Enhanced Deep Reinforcement Learning‐Based Framework for Production Scheduling in Cloud Manufacturing

open access: yesElectronics Letters, Volume 62, Issue 1, January/December 2026.
This paper introduces a heterogeneous graph attention‐enhanced deep reinforcement learning‐based scheduling framework designed to instantaneously generate high‐quality production plans for production scheduling in cloud manufacturing. The proposed framework has been tested on multiple public datasets and industrial instances, and compared against ...
Shiduo Ning   +5 more
wiley   +1 more source

Equivalent Results in Minimax Theory [PDF]

open access: yes
In this paper we review known minimax results with applications ingame theory and show that these results are easy consequences of thefirst minimax result for a two person zero sum game with finite strategysets published by von Neumann in 1928: Among ...
Kassay, G., Kolumban, J., Frenk, J.B.G.
core  

Multiple fuzzy reasoning approach to fuzzy mathematical programming problems [PDF]

open access: yes, 1991
We suggest solving fuzzy mathematical programming problems via the use of multiple fuzzy reasoning techniques. We show that our approach gives Buckley’s solution [1] to possibilistic mathematical programs when the inequality relations are understood ...
Fullér, Róbert
core   +2 more sources

A GAN‐Based Multi‐Source Uncertainty Modelling and Multi‐Timescale Optimal Dispatch Method for Microgrids

open access: yesIET Generation, Transmission &Distribution, Volume 20, Issue 1, January/December 2026.
A data‐driven scene generation method based on GAN is proposed. A multi‐timescale three‐layer collaborative scheduling architecture is constructed. A centralised‐distributed two‐layer optimisation scheduling architecture is designed. ABSTRACT To address the issues of source‐load imbalance and multi‐timescale mismatch caused by the high penetration of ...
Chenglong Li   +5 more
wiley   +1 more source

Algorithmic principles of mathematical programming

open access: yes, 2002
Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems.
Kern, Walter   +2 more
core   +1 more source

Optimization algorithms combining (meta)heuristics and mathematical programming and its application in engineering

open access: yes, 2018
Complex optimization problems can be tackled by means of mathematical programming methods as well as by means of (meta)heuristic methods. On the one hand, mathematical programming methods give us a guarantee of optimality while (meta)heuristic methods do
Rodríguez, Nibaldo   +3 more
core   +1 more source

On second order duality for nondifferentiable minimax fractional programming problems involving type-I functions [PDF]

open access: yes, 2014
We introduce second order \((C,\alpha ,\rho ,d)\) type-I functions and formulate a second order dual model for a nondifferentiable minimax fractional programming problem. The usual duality relations are established under second order \((F,\alpha ,\rho ,d)
Gupta, S. K., Dangar, D., Ahamd, I.
core   +1 more source

A deep cut ellipsoid algorithm for convex programming [PDF]

open access: yes
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its ...
Zhang, S.   +2 more
core  

Home - About - Disclaimer - Privacy