Mathematical Optimization in Air Traffic Management.
Mathematical programming approaches to classification problems.
Mathematical programming within the context of a generalized data base management system
Maximal association for the sum of squares of a contingency table
Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach.
Metasearch information fusion using linear programming
For a specific query merging the returned results from multiple search engines, in the form of a metasearch aggregation, can provide significant improvement in the quality of relevant documents. This paper suggests a minimax linear programming (LP) formulation for fusion of multiple search engines results. The paper proposes a weighting method to include the importance weights of the underlying search engines. This is a two-phase approach which in the first phase a new method for computing the importance...
Metasearch information fusion using linear programming
For a specific query merging the returned results from multiple search engines, in the form of a metasearch aggregation, can provide significant improvement in the quality of relevant documents. This paper suggests a minimax linear programming (LP) formulation for fusion of multiple search engines results. The paper proposes a weighting method to include the importance weights of the underlying search engines. This is a two-phase approach which in...
Méthode d'aide à la décision sur des évaluations multicritères par plusieurs juges
L'évaluation multicritère est un problème bien connu souvent traité par des méthodes de surclassement. Nous avons ici envisagé le cas général de plusieurs juges et agrégé les différentes évaluations pour construire une matrice de préférences, ramenant ainsi le problème à un problème de comparaisons par paires. Nous avons cherché des solutions optimales de classement en appliquant un algorithme d'affectation quadratique particulier.
Método primal dual para modelos de planificación con costes cóncavos y limitaciones de capacidad.
Este trabajo estudia el problema de planificación de la producción representado por un modelo de costes cóncavos sujeto a limitaciones de capacidad. La relajación lineal del modelo es analizada usando un enfoque primal-dual. Las soluciones del dual se obtienen resolviendo para cada producto modelos sin restricciones de capacidad asignando un precio a las mismas. El primal reducido supone un test de admisibilidad de dichas soluciones. El dual reducido permite calcular los nuevos precios recomendados...
Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics
The numerical solution of granular dynamics problems with Coulomb friction leads to the problem of minimizing a convex quadratic function with semidefinite Hessian subject to a separable conical constraints. In this paper, we are interested in the numerical solution of this problem. We suggest a modification of an active-set optimal quadratic programming algorithm. The number of projection steps is decreased by using a projected Barzilai-Borwein method. In the numerical experiment, we compare our...
Minimizing costs can be costly.
Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine
Assume that tasks must be processed by one machine in a fixed sequence. The processing time, the preferred starting time and the earliness and tardiness costs per time unit are known for each task. The problem is to allocate each task a starting time such that the total cost incurred by the early and tardy tasks is minimum. Garey et al. have proposed a nice algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to the case of asymmetric...
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine
Assume that n tasks must be processed by one machine in a fixed sequence. The processing time, the preferred starting time and the earliness and tardiness costs per time unit are known for each task. The problem is to allocate each task a starting time such that the total cost incurred by the early and tardy tasks is minimum. Garey et al. have proposed a nice O(nlogn) algorithm for the special case of symmetric and task-independent costs. In this paper we first extend that algorithm to the...
Minimizing the fuel consumption of a vehicle from the Shell Eco-marathon: a numerical study
We apply four different methods to study an intrinsically bang-bang optimal control problem. We study first a relaxed problem that we solve with a naive nonlinear programming approach. Since these preliminary results reveal singular arcs, we then use Pontryagin’s Minimum Principle and apply multiple indirect shooting methods combined with homotopy approach to obtain an accurate solution of the relaxed problem. Finally, in order to recover a purely bang-bang solution for the original problem, we...
Modèle adaptant les politiques de personnel aux besoins prévisionnels
Modèle dynamique d'optimisation à long terme d'un réseau de transport d'énergie électrique
Modélisation du service de surveillance douanière terrestre
Multi-Item Inventory Model With Probabilistic Price Dependent Demand and Imprecise Goal and Constraints
Multiobjective Thermal Generation Dispatch