L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.
La différentiation automatique et son utilisation en optimisation
In this work, we present an introduction to automatic differentiation, its use in optimization software, and some new potential usages. We focus on the potential of this technique in optimization. We do not dive deeply in the intricacies of automatic differentiation, but put forward its key ideas. We sketch a survey, as of today, of automatic differentiation software, but warn the reader that the situation with respect to software evolves rapidly. In the last part of the paper, we present some...
La programación geométrica en la economía de las producciones ganaderas.
Se modeliza el problema no lineal de producción de carne de vacuno por Programación Geométrica Signomial. Los datos técnicos utilizados se han extraído del trabajo de Epplin y Heady (1984). Se aplican transformaciones inversas y métodos de condensación al problema signomial para simplificar el modelo teórico. Finalmente, se calcula la composición de la ración óptima, bajo distintas consideraciones y se comentan los resultados obtenidos, que confirman y completan otros experimentales ya existentes...
La programmation dynamique de Bellman appliquée au calcul d'un câble électrique à plusieurs dérivations
La programmation mathématique multicritère et la gestion des ressources en eau
La recherche de l'ensemble optimal des itinéraires des véhicules dans une entreprise de transports automobiles extra-urbains
La régularisation dans les problèmes combinatoires et son application au problème des tournées de livraison
La régularisation dans les problèmes combinatoires et son application au problème de sectorisation
L'affectation exponentielle et le problème du plus court chemin dans un graphe
Lagrange multipliers method and quadratic programming in Hilbert space
Lagrange principle and necessary conditions
Lagrangean decomposition for integer programming : theory and applications
Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres.
Large games with only small players and finite strategy sets
Large games of kind considered in the present paper (LSF-games) directly generalize the usual concept of n-matrix games; the notion is related to games with a continuum of players and anonymous games with finitely many types of players, finitely many available actions and distribution dependent payoffs; however, there is no need to introduce a distribution on the set of types. Relevant features of equilibrium distributions are studied by means of fixed point, nonlinear complementarity and constrained...
Large neighborhood improvements for solving car sequencing problems
The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
Large neighborhood improvements for solving car sequencing problems
The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
Large Neighborhood Local Search for the P-Median Problem
Large quadratic programming problems generated by rigid body simulation.
Large-scale nonlinear programming algorithm using projection methods
A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not dependent...
Le point sur quelques méthodes directes de recherche de l'extremum d'une fonction monodimensionnelle unimmodale