All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 4 Next

Displaying 61 – 80 of 112

Showing per page

Representación finita de sistemas de infinitas inecuaciones.

Miguel Angel Goberna Torrent, Marco A. López Cerdá, Jesús T. Pastor Ciurana (1982)

Trabajos de Estadística e Investigación Operativa

Dado un Problema de Programación Semi-Infinita, si se puede obtener una representación finita del conjunto factible, pueden aplicarse para resolver el problema los métodos de programación con restricciones finitas.En la primera parte se caracterizan los sistemas lineales infinitos que pueden ser reducidos a un sistema finito equivalente, dándose además condiciones suficientes y métodos para efectuar tal reducción. En la segunda parte se establecen diferentes procedimientos de obtención de la representación...

Representation of equilibrium solutions to the table problem of growing sandpiles

Piermarco Cannarsa, Pierre Cardaliaguet (2004)

Journal of the European Mathematical Society

In the dynamical theory of granular matter the so-called table problem consists in studying the evolution of a heap of matter poured continuously onto a bounded domain Ω ⊂ ℝ 2 . The mathematical description of the table problem, at an equilibrium configuration, can be reduced to a boundary value problem for a system of partial differential equations. The analysis of such a system, also connected with other mathematical models such as the Monge–Kantorovich problem, is the object of this paper. Our main...

Representations of non-negative polynomials via KKT ideals

Dang Tuan Hiep (2011)

Annales Polonici Mathematici

This paper studies the representation of a non-negative polynomial f on a non-compact semi-algebraic set K modulo its KKT (Karush-Kuhn-Tucker) ideal. Under the assumption that f satisfies the boundary Hessian conditions (BHC) at each zero of f in K, we show that f can be represented as a sum of squares (SOS) of real polynomials modulo its KKT ideal if f ≥ 0 on K.

Rescaled proximal methods for linearly constrained convex problems

Paulo J.S. Silva, Carlos Humes (2007)

RAIRO - Operations Research

We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that bounds the subgradient...

Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques

Hadda Cherroun, Alain Darte, Paul Feautrier (2007)

RAIRO - Operations Research

The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....

Resolución por programación paramétrica del problema multiobjetivo lineal difuso.

Miguel Delgado, José Luis Verdegay, Amparo Vila (1985)

Trabajos de Estadística e Investigación Operativa

En este artículo se propone una solución difusa al problema Multiobjetivo Lineal Difuso. Tal solución contiene, como valores particulares, las soluciones puntuales que otros autores han obtenido. El método que se emplea es independiente de las funciones de pertenencia que se consideren. El problema también se extiende al caso en que el conjunto de restricciones sea, junto con los objetivos, difuso.

Currently displaying 61 – 80 of 112