Gotowa bibliografia na temat „Programmation linéaire en dimension infinie”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Programmation linéaire en dimension infinie”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Programmation linéaire en dimension infinie"
CHAPOUTOT, P., i F. PRESSENDA. "Conséquences des nouveaux « systèmes d’unités phosphore » sur la formulation des régimes". INRAE Productions Animales 18, nr 3 (15.07.2005): 209–28. http://dx.doi.org/10.20870/productions-animales.2005.18.3.3526.
Pełny tekst źródłaRozprawy doktorskie na temat "Programmation linéaire en dimension infinie"
Leutscher, de las Nieves Marcos. "Contributions to the linear programming approach for mean field games and its applications to electricity markets". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAG010.
Pełny tekst źródłaThis thesis presents three main contributions related to the linear programming approach for mean field games (MFGs).The first part of the thesis is concerned with the theoretical aspects of MFGs allowing simultaneously for optimal stopping, stochastic control and absorption. Using the linear programming formulation for this type of MFGs, a general existence result for MFG Nash equilibria is derived under mild assumptions by means of Kakutani-Fan-Glicksberg's fixed point theorem. This relaxation method is shown to be equivalent to the controlled/stopped martingale approach for MFGs, another relaxation method used in earlier papers in the pure control case. Furthermore, under appropriate conditions, we show that our notion of solution satisfies a partial differential equation (PDE) system, allowing to compare our results with the PDE literature.The second part focuses on a numerical algorithm for approximating the MFG Nash equilibrium taking advantage of the linear programming approach. The convergence of this algorithm is shown for two classes of MFG, MFGs with optimal stopping and absorption, and MFGs with stochastic control and absorption. The numerical scheme belongs to the class of learning procedures. In particular, we apply the Fictitious Play algorithm where the best response at each iteration is computed by solving a linear programming problem.The last part of the thesis deals with an application of MFGs to the long term dynamics of the electricity industry. Different macroeconomic and climate policy scenarios are possible for the coming years, and the exact scenario remains uncertain. Therefore, conventional or renewable producers aiming to exit or enter the market, respectively, are facing uncertainty about the future carbon price and climate policies. Both classes of producers interact through the electricity market price. Nash equilibrium strategies over stopping times are considered and the problem is analyzed through a MFG model. To this end, we develop the linear programming approach for MFGs of optimal stopping with common noise and partial information in discrete time. We show the existence of an MFG Nash equilibrium and the uniqueness of the equilibrium market price. Finally, we extend the numerical algorithm developed in the second part of the thesis to illustrate the model with an empirical example inspired by the UK electricity market
Maïzi, Nadia. "De la dimension infinie à la dimension prospective : variations autour du paradigme d'optimalité". Habilitation à diriger des recherches, Ecole Nationale Supérieure des Mines de Paris, 2012. http://tel.archives-ouvertes.fr/tel-00777330.
Pełny tekst źródłaZhou, Weijun. "Approche thermodynamique pour la commande d’un système non linéaire de dimension infinie : application aux réacteurs tubulaires". Thesis, Lyon 1, 2015. http://www.theses.fr/2015LYO10084/document.
Pełny tekst źródłaThe main objective of this thesis consists to investigate the problem of modelling and control of a nonlinear parameter distributed thermodynamic system : the tubular reactor. We address the control problem of this non linear system relying on the thermodynamic properties of the process. This approach requires to use the classical extensive variables as the state variables. We use the thermodynamic availability as well as the reduced thermodynamic availability (this function is formed from some terms of the thermodynamic availabilty) as Lyapunov functions in order to asymptotically stabilize the tubular reactor aroud a steady profile. The distributed temperature of the jacket is the control variable. Some simulations illustrate these results as well as the eficiency of the control in presence of perturbations. Next we study the Port Hamiltonian representation of irreversible infinite dimensional systems. We propose a Stokes-Dirac structure of a reaction-diffusion system by means of the extension of the vectors of the flux and effort variables. We illustrate this approach on the example of the reaction-diffusion system. For this latter we use the internal energy as well as the opposite of the entropy to obtain Stokes-Dirac structures. We propose also a pseudo-Hamiltonian representation for the two Hamiltonians. Finally we tackle the boundary control problem. The objective is to study the existence of solutions associated to a linearized model of the tubular reactor controlled to the boundary
Maïzi, Nadia. "Réduction au sens de la norme de Hankel de modèles dynamiques de dimension infinie". Phd thesis, École Nationale Supérieure des Mines de Paris, 1992. http://tel.archives-ouvertes.fr/tel-00410522.
Pełny tekst źródłaWu, Tingying. "Models and algorithms for two-echelon capacitated facility location problem with facility size selection". Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLE029.
Pełny tekst źródłaFacility location is one of the most important strategic decisions for firms in globalization. Previous works on facility location in the literature mainly focus on determining the locations of facilities and the flows of products from facilities to customers with the goal of minimizing the sum of facility opening costs, production and logistic costs. However, it’s very important to determine at the same time the appropriate sizes for these facilities because they greatly affects these costs on the long term. Determining facility location and size is always an open problem.In this thesis, we study three new two-echelon capacitated facility location problems (TECFLP) with facility size selection. The two first parts of the wok focus on two-echelon facility location problems with plant and depot size selection, respectively. The third part concentrates on TECFLP considering simultaneously plant and depot size selection. For these problems, three corresponding mixed integer programming models are formulated and then Lagrangean relaxation approaches according to the problems’ characteristics are developed. To further improve the best solutions obtained by the Lagrangean Relaxation approaches, a tabu search, a hybrid variable neighborhood tabu search and a hybrid simulated annealing tabu search are adapted for the three problems respectively. The developed algorithms are tested and evaluated through 810 randomly generated instances. Computational results show ours algorithms can provide high quality solutions within a reasonable computation time
Phan, Duy Nhat. "Algorithmes basés sur la programmation DC et DCA pour l’apprentissage avec la parcimonie et l’apprentissage stochastique en grande dimension". Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0235/document.
Pełny tekst źródłaThese days with the increasing abundance of data with high dimensionality, high dimensional classification problems have been highlighted as a challenge in machine learning community and have attracted a great deal of attention from researchers in the field. In recent years, sparse and stochastic learning techniques have been proven to be useful for this kind of problem. In this thesis, we focus on developing optimization approaches for solving some classes of optimization problems in these two topics. Our methods are based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) which are wellknown as one of the most powerful tools in optimization. The thesis is composed of three parts. The first part tackles the issue of variable selection. The second part studies the problem of group variable selection. The final part of the thesis concerns the stochastic learning. In the first part, we start with the variable selection in the Fisher's discriminant problem (Chapter 2) and the optimal scoring problem (Chapter 3), which are two different approaches for the supervised classification in the high dimensional setting, in which the number of features is much larger than the number of observations. Continuing this study, we study the structure of the sparse covariance matrix estimation problem and propose four appropriate DCA based algorithms (Chapter 4). Two applications in finance and classification are conducted to illustrate the efficiency of our methods. The second part studies the L_p,0regularization for the group variable selection (Chapter 5). Using a DC approximation of the L_p,0norm, we indicate that the approximate problem is equivalent to the original problem with suitable parameters. Considering two equivalent reformulations of the approximate problem we develop DCA based algorithms to solve them. Regarding applications, we implement the proposed algorithms for group feature selection in optimal scoring problem and estimation problem of multiple covariance matrices. In the third part of the thesis, we introduce a stochastic DCA for large scale parameter estimation problems (Chapter 6) in which the objective function is a large sum of nonconvex components. As an application, we propose a special stochastic DCA for the loglinear model incorporating latent variables
Chen, Mei-Ling. "Commandes optimale et robuste des équations aux dérivées partielles régissant le comportement des systèmes hydrauliques à surface libre". Grenoble INPG, 2001. http://www.theses.fr/2001INPG0053.
Pełny tekst źródłaGao, Nan. "Observateurs dynamiques et commande des systèmes : application aux systèmes de grande dimension". Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0081/document.
Pełny tekst źródłaThe present thesis is the result of research conducted in Longwy, within the department Control, Identification, Diagnosis (CID) of Research Center for Automatic Control of Nancy (CRAN). This thesis investigates the problem of dynamic observer (full- and reduced-order) and observer-based control design and their applications to large-scale systems. Firstly, a new form of H-infinity dynamic observer is designed for linear systems in the presence of unknown inputs and disturbances. The proposed observer generalizes the existing results on proportional observer and proportional integral observer. The observer design is based on the solution of linear matrix inequalities (LMI). Both continuous-time and discrete-time systems are considered. Thereafter, by inserting the proposed observer into a closed-loop, an observer-based control is presented for uncertain systems in the presence of disturbances. Based on the parameterization of algebraic constraints obtained from the analysis of the estimation error, the control design is derived from the solution of bilinear matrix inequality, by using a two-steps algorithm. Finally, the obtained results have been extended to large-scale systems. A decentralized observer-based control is proposed for large-scale uncertain systems in the presence of disturbances. These systems are composed of several interconnected subsystems of low dimensions, where the interconnections are assumed to be nonlinear and satisfy quadratic constraints
Martinez, Cléa. "Considération de la dimension humaine dans l'optimisation de tournées de soins et services à domicile soumises à des perturbations". Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALI060.
Pełny tekst źródłaDue to the aging of western populations and the will of decreasing the number of admissions in hospitals and nursing homes, the Home Health Care (HHC) sector expanded in the last decades, as well as the research in this field. HHC agencies face new management issues. They have to modify their inner workings to deal with increasing demands. The routing and scheduling process, mostly done by hand, must be automatized to become faster and more efficient. What's more, the continuous changes within the pool of patients and in the staff make it difficult to plan the tours of the workers. As a result, it is unlikely to complete a schedule without undergoing some adjustments, or a full re-optimization. It directly impacts the satisfaction of the patients, which is one of our main concerns. To limit the turnover, the satisfaction of careworkers must also be encouraged in the routing and scheduling process. We are specifically interested in this last aspect, which received little attention in the literature.Firstly, we study a classic routing and scheduling problem with an unusual objective of preserving the continuity of care, which is a crucial topic in public health problems. Secondly, we suggest an exact method to re-optimize the planning whenever the variations within the pool of patients and careworkers made the current planning obsolete. Then, we develop a heuristic to address the punctual absences of careworkers. Finally, we present a case study. We highlight and analyze the difficulties of applying theoretical methods to real problems
Gardeux, Vincent. "Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN". Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00676449.
Pełny tekst źródła