Se estudia el problema de decisión (Θ,Δ,ρ) cuando Θ es un intervalo finito de R y el decisor posee información acerca de las probabilidades de una partición de Θ en subintervalos, de la monotonía de las f.d.d. en dichos intervalos y de algunas restricciones sobre los momentos de la distribución y ciertos generalizadores de éstas dentro de este contexto.
Consideramos la conexión que existe entre la información de Kullback y los tests admisibles óptimos en el conjunto de riesgos de Neyman-Pearson, usando para ello el estudio de problemas de programación matemática de tipo infinito. Se obtienen resultados que caracterizan un subconjunto de soluciones Bayes como consecuencia del conocimiento de la información, así como una medida de discriminación entre hipótesis para el conjunto de riesgos.
At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems....
This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount of generating units within a power system subject to operating constraints. The LR framework is applied to relax coupling constraints of the optimization problem. Thus, the UCP is separated into independent optimization...
A previous paper by the same authors presented a general theory solving (finite horizon) feasibility and optimization problems for linear dynamic discrete-time systems with polyhedral constraints. We derived necessary and sufficient conditions for the existence of solutions without assuming any restrictive hypothesis. For the solvable cases we also provided the inequative feedback dynamic system, that generates by forward recursion all and nothing but the feasible (or optimal, according to the cases)...
The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness...
In this work, an alternative for sliding surface design based on linear and bilinear matrix inequalities is proposed. The methodology applies for reduced and integral sliding mode control, both continuous- and discrete-time; it takes advantage of the Finsler's lemma to provide a greater degree of freedom than existing approaches for sliding subspace design. The sliding surfaces thus constructed are systematically found via convex optimization techniques, which are efficiently implemented in commercially...
El propósito de este trabajo es dar una construcción explícita del test de máxima potencia para un constraste de hipótesis paramétrico en el que tanto la hipótesis nula como la hipótesis alternativa son simples, utilizando para ello técnicas del Análisis Funcional y de Programación Matemática.