Buscar
Mostrando ítems 41-50 de 8739
Joint dynamic probabilistic constraints with projected linear decision rules
(EMAp - Escola de Matemática Aplicada, 2016)
We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see ...
Introdução a programação linear
(Universidade Tecnológica Federal do ParanáCampo Mourao, 2011)
This work presents an exemplified introduction to linear programming, aimed at the resolution of problems.since the modeling part of de the problem, graphical resolution, and resolution by the simplex method and is offsshoots.
Optimal allocation of capacitors in radial distribution systems with distributed generation
(2011-12-19)
This paper presents a mixed-integer linear programming approach to solving the optimal fixed/switched capacitors allocation (OCA) problem in radial distribution systems with distributed generation. The use of a mixed-integer ...
Implementation of a didactic situation of linear programming through geogebra software
(Institute of Electrical and Electronics Engineers, 2019)
The present work exposes the main results of the application of a linear programming activity through the use of Geogebra software developed with future teachers of mathematics, this activity has been designed under the ...
(A, B)-invariant polyhedral sets of linear discrete-time systems
(1999)
The problem of confining the trajectory of a linear discrete-time system in a given polyhedral domain is addressed through the concept of (A, B)-invariance. First, an explicit characterization of (A, B)-invariance of convex ...
Branch and bound algorithm for transmission network expansion planning using DC model
(2007-12-01)
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
Branch and bound algorithm for transmission network expansion planning using DC model
(2007-12-01)
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
(Springer, 2015)
This paper was originally motivated by the problem of providing a point-based formula (only involving the nominal data, and not data in a neighborhood) for estimating the calmness modulus of the optimal set mapping in ...