Inner search methods for linear programming
Input and output passivity of complex dynamical networks with general topology.
Input reconstruction by means of system inversion: A geometric approach to fault detection and isolation in nonlinear systems
In this paper the classical detection filter design problem is considered as an input reconstruction problem. Input reconstruction is viewed as a dynamic inversion problem. This approach is based on the existence of the left inverse and arrives at detector architectures whose outputs are the fault signals while the inputs are the measured system inputs and outputs and possibly their time derivatives. The paper gives a brief summary of the properties and existence of the inverse for linear and nonlinear...
Inradius und Dicke konvexer Körper aus optimierungstheoretischer Sicht
Inspection policies : comparisons and modifications
Integer Linear Programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots. These...
Integer programming approaches for minimum stabbing problems
The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to...
Integer Programming Formulation of the Bilevel Knapsack Problem
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an integer program reformulation of BKP. We show that the...
Intégrabilité des temps de renouvellement des files d'attente et applications
Interactive approach based on stochastic dominance
Interactive compromise hypersphere method and its applications
The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of the proposed...
Interactive compromise hypersphere method and its applications
The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of the proposed...
Interactive Method for Solving Multi-Objective Convex Programs
Interactive multi-objective optimization for simulated moving bed processes
Interior-Point Algorithms for a Class of Convex Optimization Problems
Interloss time in loss system.
Internet shopping optimization problem
A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses...
Interpolative fuzzy algorithms for intelligent controllers and decision making
Interpretación de los precios sombra en presencia de degeneración.
El propósito de nuestro trabajo es analizar la interpretación económica de las variables duales como "precios sombra" cuando la solución posible básica óptima del problema de programación lineal es degenerada. Resolvemos algunos ejemplos que ilustran esta interpretación usando el programa LINDO. Finalmente planteamos una modificación a la propuesta de Gal (1986) para llevar a cabo el análisis de sensibilidad en presencia de degeneración.
Interpretation and optimization of the -means algorithm
The paper gives a new interpretation and a possible optimization of the well-known -means algorithm for searching for a locally optimal partition of the set which consists of disjoint nonempty subsets , . For this purpose, a new divided -means algorithm was constructed as a limit case of the known smoothed -means algorithm. It is shown that the algorithm constructed in this way coincides with the -means algorithm if during the iterative procedure no data points appear in the Voronoi diagram....