Tesis sobre el tema "Mathematical programming"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Mathematical programming".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Koch, Thorsten. "Rapid mathematical programming". [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=973541415.
Texto completoMoreno, Dávila Julio Moreno Davila Julio. "Mathematical programming for logic inference /". [S.l.] : [s.n.], 1990. http://library.epfl.ch/theses/?nr=784.
Texto completoSharifi, Mokhtarian Faranak. "Mathematical programming with LFS functions". Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56762.
Texto completoSteffy, Daniel E. "Topics in exact precision mathematical programming". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39639.
Texto completoSmith, Barbara Mary. "Bus crew scheduling using mathematical programming". Thesis, University of Leeds, 1986. http://etheses.whiterose.ac.uk/1053/.
Texto completoAras, Raghav. "Mathematical programming methods for decentralized POMDPs". Thesis, Nancy 1, 2008. http://www.theses.fr/2008NAN10092/document.
Texto completoIn this thesis, we study the problem of the optimal decentralized control of a partially observed Markov process over a finite horizon. The mathematical model corresponding to the problem is a decentralized POMDP (DEC-POMDP). Many problems in practice from the domains of artificial intelligence and operations research can be modeled as DEC-POMDPs. However, solving a DEC-POMDP exactly is intractable (NEXP-hard). The development of exact algorithms is necessary in order to guide the development of approximate algorithms that can scale to practical sized problems. Existing algorithms are mainly inspired from POMDP research (dynamic programming and forward search) and require an inordinate amount of time for even very small DEC-POMDPs. In this thesis, we develop a new mathematical programming based approach for exactly solving a finite horizon DEC-POMDP. We use the sequence form of a control policy in this approach. Using the sequence form, we show how the problem can be formulated as a mathematical progam with a nonlinear object and linear constraints. We thereby show how this nonlinear program can be linearized to a 0-1 mixed integer linear program (MIP). We present two different 0-1 MIPs based on two different properties of a DEC-POMDP. The computational experience of the mathematical programs presented in the thesis on four benchmark problems (MABC, MA-Tiger, Grid Meeting, Fire Fighting) shows that the time taken to find an optimal joint policy is one or two orders or magnitude lesser than the exact existing algorithms. In the problems tested, the time taken drops from several hours to a few seconds or minutes
Aras, Raghav Charpillet François Dutech Alain. "Mathematical programming methods for decentralized POMDPs". S. l. : Nancy 1, 2008. http://www.scd.uhp-nancy.fr/docnum/SCD_T_2008_0092_ARAS.pdf.
Texto completoHochreiter, Ronald. "Applied Mathematical Programming and Modelling 2016". edp sciences, 2017. http://dx.doi.org/10.1051/itmconf/20171400001.
Texto completoReeves, Laurence H. "Mathematical Programming Applications in Agroforestry Planning". DigitalCommons@USU, 1991. https://digitalcommons.usu.edu/etd/6495.
Texto completoViolin, Alessia. "Mathematical programming approaches to pricing problems". Doctoral thesis, Università degli studi di Trieste, 2014. http://hdl.handle.net/10077/10863.
Texto completoThere are many real cases where a company needs to determine the price of its products so as to maximise its revenue or profit. To do so, the company must consider customers’ reactions to these prices, as they may refuse to buy a given product or service if its price is too high. This is commonly known in literature as a pricing problem. This class of problems, which is typically bilevel, was first studied in the 1990s and is NP-hard, although polynomial algorithms do exist for some particular cases. Many questions are still open on this subject. The aim of this thesis is to investigate mathematical properties of pricing problems, in order to find structural properties, formulations and solution methods that are as efficient as possible. In particular, we focus our attention on pricing problems over a network. In this framework, an authority owns a subset of arcs and imposes tolls on them, in an attempt to maximise his/her revenue, while users travel on the network, seeking for their minimum cost path. First, we provide a detailed review of the state of the art on bilevel pricing problems. Then, we consider a particular case where the authority is using an unit toll scheme on his/her subset of arcs, imposing either the same toll on all of them, or a toll proportional to a given parameter particular to each arc (for instance a per kilometre toll). We show that if tolls are all equal then the complexity of the problem is polynomial, whereas in case of proportional tolls it is pseudo-polynomial. We then address a robust approach taking into account uncertainty on parameters. We solve some polynomial cases of the pricing problem where uncertainty is considered using an interval representation. Finally, we focus on another particular case where toll arcs are connected such that they constitute a path, as occurs on highways. We develop a Dantzig-Wolfe reformulation and present a Branch-and-Cut-and-Price algorithm to solve it. Several improvements are proposed, both for the column generation algorithm used to solve the linear relaxation and for the branching part used to find integer solutions. Numerical results are also presented to highlight the efficiency of the proposed strategies. This problem is proved to be APX-hard and a theoretical comparison between our model and another one from the literature is carried out.
Un problème classique pour une compagnie est la tarification de ses produits à vendre sur le marché, de façon à maximiser les revenus. Dans ce contexte, il est important que la société prenne en compte le comportement de ses clients potentiels, puisque si le prix est trop élevé, ils peuvent décider de ne rien acheter. Ce problème est communément connu dans la littérature comme un problème de tarification ou "pricing". Une approche de programmation biniveau pour ce problème a été introduite dans les années 90, révélant sa difficulté. Cependant, certains cas particuliers peuvent être résolus par des algorithmes polynomiaux, et il y a encore de nombreuses questions ouvertes sur le sujet. Cette thèse de doctorat porte sur les propriétés mathématiques des problèmes de tarification, fixant l’objectif de déterminer différentes formulations et méthodes de résolution les plus efficaces possibles, en se concentrant sur les problèmes appliqués aux réseaux de différents types. Dans les problèmes de tarification sur réseau, nous avons deux entités : une autorité qui possède un certain sous-ensemble d’arcs, et impose des péages, avec l’intention de maximiser les revenus provenant de celle-ci, et des utilisateurs qui choisissent leur chemin de moindre coût sur l’ensemble du réseau. Dans la première partie de la thèse une analyse détaillée de l’état de l’art sur les problèmes de tarification biniveau est présentée, suivie, dans la deuxième partie, par une analyse de cas particuliers polynomiaux. En particulier, nous considérons le cas où l’autorité utilise un péage unitaire sur son sous-ensemble d’arcs, soit en choisissant le même péage sur chaque arc, soit en choisissant un péage proportionnel à un paramètre donné pour chaque arc (par exemple, un péage par kilomètre). Dans le premier cas de péages égaux, il est démontré que la complexité du problème est polynomiale, tandis que dans le second cas de péages proportionnels, elle est pseudo-polynomiale. Ensuite, nous présentons une première approche d’optimisation robuste pour les problèmes de tarification sur réseau, de manière à inclure de l’incertitude sur la valeur exacte des paramètres dans le modèle, qui est typique dans les problèmes réels. Cette incertitude est représentée en utilisant des intervalles pour les paramètres et nous proposons, pour certains cas, des algorithmes de résolution polynomiaux. La troisième et dernière partie de la thèse concerne un cas difficile, le problème de tarification sur réseau dans lequel les arcs sont connectés de manière à constituer un chemin, comme c’est le cas pour les autoroutes. Initialement, nous prouvons que ce problème est APX-dur, renforçant le résultat connu jusqu’à maintenant. Ensuite, nous présentons des nouvelles formulations plus fortes, et en particulier, nous développons une reformulation de type Danztig-Wolfe, résolue par un algorithme de Branch-and-Cut-and-Price. Enfin, nous proposons différentes stratégies pour améliorer les performances de l’algorithme, pour ce qui concerne l’algorithme de génération de colonnes utilisé pour résoudre la relaxation linéaire, et pour ce qui concerne la résolution du problème avec variables binaires. Les résultats numériques complètent les résultats théoriques, en mettant en évidence l’efficacité des stratégies proposées.
Un classico problema aziendale è la determinazione del prezzo dei prodotti da vendere sul mercato, in modo tale da massimizzare le entrate che ne deriveranno. In tale contesto è importante che l’azienda tenga in considerazione il comportamento dei propri potenziali clienti, in quanto questi ultimi potrebbero ritenere che il prezzo sia troppo alto e decidere dunque di non acquistare. Questo problema è comunemente noto in letteratura come problema di tariffazione o di “pricing”. Tale problema è stato studiato negli anni novanta mediante un approccio bilivello, rivelandone l’alta complessità computazionale. Tuttavia alcuni casi particolari possono essere risolti mediante algoritmi polinomiali, e ci sono sono ancora molte domande aperte sull’argomento. Questa tesi di dottorato si focalizza sulle proprietà matematiche dei problemi di tariffazione, ponendosi l’obiettivo di determinarne formulazioni e metodi risolutivi più efficienti possibili, concentrandosi sui problemi applicati a reti di vario tipo. Nei problemi di tariffazione su rete si hanno due entità: un’autorità che possiede un certo sottoinsieme di archi e vi impone dei pedaggi, con l’intento di massimizzare le entrate che ne derivano, e gli utenti che scelgono il proprio percorso a costo minimo sulla rete complessiva (a pedaggio e non). Nella prima parte della tesi viene affrontata una dettagliata analisi dello stato dell’arte sui problemi di tariffazione bilivello, seguita, nella seconda parte, dall’analisi di particolari casi polinomiali del problema. In particolare si considera il caso in cui l’autorità utilizza uno schema di pedaggio unitario sul suo sottoinsieme di archi, imponendo o lo stesso pedaggio su ogni arco, o un pedaggio proporzionale a un dato parametro relativo ad ogni arco (ad esempio un pedaggio al chilometro). Nel primo caso di pedaggi uguali, si dimostra che la complessità del problema è polinomiale, mentre nel secondo caso di pedaggi proporzionali è pseudo-polinomiale. In seguito viene affrontato un approccio di ottimizzazione robusta per alcuni problemi di tariffazione su rete, in modo da includere nei modelli un’incertezza sul valore esatto dei parametri,tipica dei problemi reali. Tale incertezza viene rappresentata vincolando i parametri in degli intervalli e si propongono, per alcuni casi, algoritmi risolutivi polinomiali. La terza e ultima parte della tesi riguarda un caso computazionalmente difficile, in cui gli archi tariffabili sono connessi in modo tale da costituire un cammino, come avviene per le autostrade. Inizialmente si dimostra che tale problema è APX-hard, rafforzando il risultato finora conosciuto. In seguito si considerano formulazioni piùforti, e in particolare si sviluppa una riformulazione di Danztig-Wolfe, risolta tramite un algoritmo di Branch-and-Cut-and-Price. Infine si propongono diverse strategie per migliorare le performance dell’algoritmo, sia per quanto riguarda l’algoritmo di generazione di colonne utilizzato per risolvere il rilassamento lineare, sia per quanto riguarda la risoluzione del problema con variabili binarie. Risultati numerici complementano quelli teorici ed evidenziano l’efficacia delle strategie proposte.
XXV Ciclo
1985
Violin, Alessia. "Mathematical programming approaches to pricing problems". Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209173.
Texto completoTo do so, the company must consider customers' reactions to these prices, as they may refuse to buy a given product or service if its price is too high. This is commonly known in literature as a pricing problem.
This class of problems, which is typically bilevel, was first studied in the 1990s and is NP-hard, although polynomial algorithms do exist for some particular cases. Many questions are still open on this subject.
The aim of this thesis is to investigate mathematical properties of pricing problems, in order to find structural properties, formulations and solution methods that are as efficient as possible. In particular, we focus our attention on pricing problems over a network. In this framework, an authority owns a subset of arcs and imposes tolls on them, in an attempt to maximise his/her revenue, while users travel on the network, seeking for their minimum cost path.
First, we provide a detailed review of the state of the art on bilevel pricing problems.
Then, we consider a particular case where the authority is using an unit toll scheme on his/her subset of arcs, imposing either the same toll on all of them, or a toll proportional to a given parameter particular to each arc (for instance a per kilometre toll). We show that if tolls are all equal then the complexity of the problem is polynomial, whereas in case of proportional tolls it is pseudo-polynomial.
We then address a robust approach taking into account uncertainty on parameters. We solve some polynomial cases of the pricing problem where uncertainty is considered using an interval representation.
Finally, we focus on another particular case where toll arcs are connected such that they constitute a path, as occurs on highways. We develop a Dantzig-Wolfe reformulation and present a Branch-and-Cut-and-Price algorithm to solve it. Several improvements are proposed, both for the column generation algorithm used to solve the linear relaxation and for the branching part used to find integer solutions. Numerical results are also presented to highlight the efficiency of the proposed strategies. This problem is proved to be APX-hard and a theoretical comparison between our model and another one from the literature is carried out.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Bettinelli, A. "MATHEMATICAL PROGRAMMING ALGORITHMS FOR TRANSPORTATION PROBLEMS". Doctoral thesis, Università degli Studi di Milano, 2010. http://hdl.handle.net/2434/150079.
Texto completoCosta, Alberto. "Applications of Reformulations in Mathematical Programming". Phd thesis, Palaiseau, Ecole polytechnique, 2012. https://pastel.hal.science/docs/00/74/60/83/PDF/Phd_Costa.pdf.
Texto completoMathematical programming is a technique that can be used to solve real-world optimization problems, where one wants to maximize, or minimize, an objective function subject to some constraints on the decision variables. The key features of mathematical programming are the creation of a model for describing the problem (the so called formulation), and the implementation of efficient algorithms to solve it (also called solvers). In this thesis, we focus on the first point. More precisely, we study some problems arising from different domains, and starting from the most natural models for describing them, we propose alternative formulations, which share some properties with the original models but are somehow better (for instance in terms of computational time needed to obtain the solution by the solver). These new models are called reformulations. We follow the classification of reformulations proposed by Liberti in [Reformulations in Mathematical Programming: Definitions and Systematics, RAIRO-OR, 43(1):55-86, 2009]: exact reformulations (also called opt-reformulations), narrowings, relaxations. This thesis is concerned with three mathematical programming applications where the reformulation was crucial to obtain a good solution. The first problem tackled herein is graph clustering by means of modularity maximization. Since this problem is NP-hard, several heuristics are proposed. We focus on a divisive hierarchical algorithm which works by recursively splitting a cluster into two new clusters in an optimal way. This splitting step is performed by solving a convex binary quadratic program. This is reformulated exactly to a more compact form without changing the optimal solutions set (exact reformulation). We also evaluate the impact provided by the reduction of the number of symmetric global optima of the problem, which is also an important topic of the next part of this thesis. The computational times are considerably reduced with respect to the original formulation. The second problem tackled in the thesis is the Packing of Equal Circles in a Square (PECS), where one wants to place non-overlapping equal circles in a unit square in such a way as to maximize the common radius. One of the reasons why the problem is hard to solve is the presence of several symmetric optimal solutions, and consequently a very large Branch-and-Bound tree. Some of the symmetric optima are made infeasible by adjoining some Symmetry Breaking Constraints (SBCs) to the formulation, thereby obtaining a narrowing. Both computational time and size of the Branch-and-Bound tree outperform the ones provided by the original formulation. The third application considered in the thesis is that of computing the convex relaxation for multilinear problems, and to compare the "primal" formulation and another one obtained using a "dual" representation. Although these two relaxations are both already known in the literature, we make a striking observation, i. E. , that the dual relaxation leads to a faster and more stable solution process as regards CPU time
Costa, Alberto. "Applications of Reformulations in Mathematical Programming". Phd thesis, Ecole Polytechnique X, 2012. http://pastel.archives-ouvertes.fr/pastel-00746083.
Texto completoBorg, Andreas. "Designing for the incorporation of programming in mathematical education : Programming as an instrument for mathematical problem solving". Licentiate thesis, Karlstads universitet, Institutionen för pedagogiska studier (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85625.
Texto completoThis study explored Swedish upper secondary school students’ use of programming for mathematical purposes. The aim of the study was to investigate the process through which students learn how to use a programming environment as a technical artefact during mathematical problem solving and how the orchestration of such learning situations could facilitate this process. In order to study the students’ use of the programming environment, design-based research was used as the main methodological approach and the Instrumental Approach served as the theoretical framework. The design involved the development of mathematical tasks to be tried out with students, as well as the orchestration of the learning situation within the classroom. The findings revealed how the students experienced several difficulties when trying to use the programming environment as a technical mathematical artefact. These difficulties were related to the fact that the mathematical affordances offered by the programming environment initially were unclear to many of the students, as well as to the handling of more specific computational concepts such as nested loops. The findings also revealed that the transformation of mathematical notations and ideas into programming code caused students difficulties.
Heipcke, Susanne. "Combined modelling and problem solving in mathematical programming and constraint programming". Thesis, University of Buckingham, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297665.
Texto completoSundbom, Tobias. "Mathematical programming based approaches in credit scoring". Thesis, Uppsala University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-120980.
Texto completoChuang, Poon-Hwei. "Fuzzy mathematical programming in civil engineering systems". Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/7802.
Texto completoNahum, Carole. "Second order sensitivity analysis in mathematical programming". Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74349.
Texto completoIf a point x$ sb0$ does not satisfy a certain Second Order Sufficient Condition (SOS) for optimality (that does not require any constraint qualification, see, e.g., BEN-ISRAEL, BEN-TAL and ZLOBEC (81)), then we prove that the knowledge of the second order properties (derivative, Hessian) of the functions is not enough to conclude that the point is optimal.
When the functions are continuously perturbed, what is the local behavior of an optimal solution x$ sb0$ and of the associate optimal value? The stability and sensitivity of the mathematical model are addressed. We present a new method for solving this problem. Our approach does not rely on the classical Lagrangian coefficients (which cannot be always defined) but rather on power series expansions because we use the primal formulations of optimality.
In the regular case, when Strict complementarity slackness holds, we recover Fiacco's results (FIACCO (83)). On the other hand, when Strict complementarity slackness does not hold, we extensively generalize Shapiro's Theorems (SHAPIRO (85)) since we do not assume Robinson's second order condition (ROBINSON (80)) but the SOS condition.
In the non-regular case, no general algorithm for computing the derivative of the optimizing point with respect to the parameters had been presented up to now.
The approach is extended to analyze the evolution of the set of Pareto minima of a multiobjective nonlinear program. In particular, we define the derivative of a point-to-set map. Our notion seems more adequate than the contingent derivative (AUBIN (81)), though the latter can easily be deduced from the former. This allows to get information about the sensitivity of the set of Pareto minima. A real-life example shows the usefulness and the simplicity of our results. Also, an application of our method to industry planning (within a general framework of Input Optimization) is made in the ideal case of a linear model.
Patsiatzis, Dimitrios. "Optimal process plant layout using mathematical programming". Thesis, University College London (University of London), 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.406748.
Texto completoEsche, Alexander. "Mathematical Programming and Magic| The Gathering(RTM)". Thesis, Northern Illinois University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10689404.
Texto completoIn this paper mathematical programming techniques were used to determine the optimal strategy for playing Magic: The Gathering®. Games with the cards Lightning Bolt, Mountain, and Vexing Devil were evaluated using the minimax algorithm to determine the winner when all information about the cards is assumed known to both players. Computation time was shortened through the use of an evaluation function, a random forest algorithm that had been trained on 1000 completed games. A winning percentage was established for each pair of decks where the number of creatures was less than eight. Using linear programming, the optimal mixed strategy was then calculated. By repeating the simulations, a standard deviation for the winning percentages was estimated. Techniques from robust optimization were then used to determine the optimal strategy under different possible variations. Last, an imperfect information player was constructed that made choices based on guessing the order of the cards in its deck and the composition of the opponent's deck, playing through the perfect information games of these guesses, and making the choice that won in most of these simulations. With decks of eight or fewer creatures, this imperfect information player played below or near a player who used an aggressive heuristic. When the number of possible creatures was increased to 16, the imperfect information player's performance was better than the aggressive heuristic.
Viaud, Quentin. "Mathematical programming methods for complex cutting problems". Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0350.
Texto completoThis thesis deals with a two-dimensional bin-packing problem with defects on bins from the glass industry. Cutting patterns have to be exact 4-stage guillotine and items defect-free. A standard way to solve it isto use Dantzig-Wolfe reformulation with column generation and branch-and price.This is impossible in our case due to large instance size. We first study and solve the defect-free pricing problem with an incremental labelling algorithm based on a dynamic program (DP), represented as a flow problem in a hypergraph. Our method is generic for guillotine knapsack problems but fails to solve large instance in a short amount of time. Instead we solve the defect freebin-packing problem with a DP and a diving heuristic. This DP generatesnon-proper columns, cutting patterns that cannot be in an integer solution.We adapt standard diving heuristic to this “non-proper” case while keeping itseffectiveness. We then extend the diving heuristic to deal with defects. Ourfirst proposal heuristically repairs a given defect-free solution. Secondly the defect-free diving heuristic is adjusted to handle defects during column fixing.Our industrial results outline the effectiveness of our methods
Colombo, F. "MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS". Doctoral thesis, Università degli Studi di Milano, 2014. http://hdl.handle.net/2434/234164.
Texto completoLee, Seungjae. "Mathematical programming algorithms for equilibrium road traffic assignment". Thesis, University College London (University of London), 1995. http://discovery.ucl.ac.uk/1318036/.
Texto completoCOSTA, PEDRO FRANCA FERREIRA DA. "OPTIMIZATION OF THE OFFLOADING LOGISTICS USING MATHEMATICAL PROGRAMMING". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=25301@1.
Texto completoThe growth of daily oil production and the high costs involved in oil logistics, specifically the upstream logistics and the production logistics itself, adding to the current downturn in oil prices, are becoming increasingly relevant considering the major economic impacts caused by eventual failure in logistics processes. In this context, a linear programming model was developed. It provides the optimization of offloading platforms operation coupled to the service window of various vessels, so there is no need to interrupt the production of any of those platforms, allowing that all demands are met. In any case, this method seeks to minimize operational costs by reducing the distances traveled and the number of chartered vessels. The mathematical model was applied in a case study consisting of three different scenarios. The result obtained allows effective decision making that will define the number of shuttle tankers to be chartered for a certain period of time.
Al-Samara, Mohammad Ahmad. "Elastoplastic dynamics of skeletal structures by mathematical programming". Thesis, Imperial College London, 1986. http://hdl.handle.net/10044/1/37390.
Texto completoClemence, Robert D. "A type calculus for mathematical programming modeling languages". Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA238160.
Texto completoDissertation supervisor: Bradley, Gordon H. "September 1990." Description based on title screen viewed on December 17, 2009. DTIC Descriptor(s): Mathematical models, sizes (dimensions), validation, models, programming languages, drug addiction, algebra, mathematical programming, language, junctions, calculus, homogeneity, integrated systems, mathematical logic. DTIC Identifier(s): Programming languages, mathematical models, calculus, linear programming. Author(s) subject terms: Data types, integrated modeling, linear programming, model validation, mathematical programming software, special purpose languages. Includes bibliographical references (p. 129-132). Also available in print.
Vielma, Centeno Juan Pablo. "Mixed integer programming approaches for nonlinear and stochastic programming". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29624.
Texto completoCommittee Chair: Nemhauser, George; Committee Co-Chair: Ahmed, Shabbir; Committee Member: Bill Cook; Committee Member: Gu, Zonghao; Committee Member: Johnson, Ellis. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Loucopoulos, Constantine. "Mathematical Programming Approaches to the Three-Group Classification Problem". Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc279363/.
Texto completoShen, Yijiang. "Binary image restoration by positive semidefinite programming and signomial programming". Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/HKUTO/record/B39557431.
Texto completoCregger, Michael L. "The general mixed-integer linear programming problem an empirical analysis /". Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1993. http://www.kutztown.edu/library/services/remote_access.asp.
Texto completoZhu, Yuntao. "Semidefinite programming under uncertainty". Online access for everyone, 2006. http://www.dissertations.wsu.edu/Dissertations/summer2006/y%5Fzhu%5F073106.pdf.
Texto completoCoetzee, Carla. "Mathematical thinking skills needed by first year programming students". Diss., University of Pretoria, 2016. http://hdl.handle.net/2263/60991.
Texto completoDissertation (MEd)--University of Pretoria, 2016.
Science, Mathematics and Technology Education
MEd
Unrestricted
Antipova, Ekaterina. "Advanced mathematical programming tools for alternative energy systems design". Doctoral thesis, Universitat Rovira i Virgili, 2013. http://hdl.handle.net/10803/124102.
Texto completoQue, Norbert S. Civil & Environmental Engineering Faculty of Engineering UNSW. "Identification of cohesive crack fracture parameters using mathematical programming". Awarded by:University of New South Wales. School of Civil and Environmental Engineering, 2003. http://handle.unsw.edu.au/1959.4/19189.
Texto completoFerris, Michael Charles. "Weak sharp minima and penalty functions in mathematical programming". Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292969.
Texto completoBuelga, Ana Sanchez. "Mathematical programming studies of short run oil refinery rents". Thesis, Queen Mary, University of London, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416439.
Texto completoSANTOS, DEBORA ANDREA DE OLIVEIRA. "DECOMPOSITION IN MATHEMATICAL PROGRAMMING APPLIED TO COMPUTATIONAL GREEN NETWORKS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=25702@1.
Texto completoThe growing energy consumption has already become a global concern and currently more than forty countries are involved in researches and programs in order to create mechanisms to save it. This work deals with the energy-aware Traffic Engineering problem applied to the backbone of an IP network in which the used routing protocol is a SPF (Shortest Path First) one, such as OSPF (Open Shortest Path First), for example. The proposed approach considers the problem of switching-off nodes (routers) and circuits, for energy saving; and it also considers the problem of ensuring a maximum utilization level by the circuits, towards to assure QoS requirements. In order to solve the optimization problem, rather than adopting heuristic methods, we propose the direct processing by means of Benders decomposition, crumbling a complicated and hard to solve problem into several smaller ones whose resolution is more simple and whose convergence is faster.
Gu, D. W. "Design of non-linear control systems via mathematical programming". Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37714.
Texto completoSingh, Navneet. "Efficiency and performance of some algorithms in mathematical programming". Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/38133.
Texto completoIncludes bibliographical references (leaves 39-40).
by Navneet Singh.
M.Eng.
Qiang, Feng. "Parallel problem generation for structured problems in mathematical programming". Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11688.
Texto completoDias, da Silva Gustavo. "Symmetries and Distances : two intriguing challenges in Mathematical Programming". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX008/document.
Texto completoThis thesis is mostly dedicated to study and discuss two important challenges existing not only in the field of Mathematical Programming: symmetries and distances. In the background we take a look into Semidefinite Programming (SDP) and its pertinency as one of the major tools employed nowadays to solve hard Mathematical Programs (MP). After the introductory Chapter 1, we discuss about symmetries in Chapter 2 and about distances in Chapter 5. In between them we present two short chapters that we actually prefer to call as entr’actes: their content is not necessarily worthy of publication yet, but they do provide a connection between the two seemingly separate Chapters 2 and 5, which are the ones containing the main contributions of this thesis. It is widely known that symmetric MPs are harder to solve to global optimality using Branch-and-Bound (B&B) type algorithms, given that the solution symmetry is reflected in the size of the B&B tree. It is also well-known that some of the solution symmetries are usually evident in the formulation, which makes it possible to attempt to deal with symmetries as a preprocessing step. Implementation-wise, one of the simplest approaches is to break symmetries by adjoining Symmetry-Breaking Constraints (SBC) to the formulation, thereby removing some symmetric global optima, then solve the reformulation with a generic solver. Sets of such constraints can be generated from each orbit of the action of the symmetries on the variable index set. It is unclear, however, whether and how it is possible to choose two or more separate orbits to generate SBCs which are compatible with each other (in the sense that they do not make all global optima infeasible). In Chapter 2 we discuss and test a new concept of Orbital Independence (OI) that clarifies this issue. The numerical experiences conducted using public MILPs and MINLPs emphasize the correctness and usefulness of the OI theory. Binary Quadratic Programming (BQP) is used to investigate symmetries and SDP in Entr'acte 3. Symmetric Binary Quadratic Programs having a certain symmetry structure are generated and used to exemplify the conditions under which the usage of SBCs is majoritarily advantageous. A preliminary discussion about the impact of symmetries and SBCs in the performance of SDP solvers is also carried out. The Euclidean Steiner Tree Problem is studied in Entr'acte 4. Two models (which are exact reformulations of an existing formulation) are derived, as well as SDP relaxations. A heuristic algorithm based on both the mathematical models and the OI principles presented in Chapter 2 is also proposed. As concerns these methods, preliminary results on a small set of well-known instances are provided. Finally and following up the Distance Geometry subject, in Chapter 5 we cope with the most fundamental problem arising in the field of Distance Geometry, the one of realizing graphs in Euclidean spaces: it asks to find a realization of an edge-weighted undirected graph in RK for some given K such that the positions for adjacent vertices respect the distance given by the corresponding edge weight. The Euclidean Distance Geometry Problem (EDGP) is of great importance since it has many applications to science and engineering. It is notoriously difficult to solve computationally, and most of the methods proposed so far either do not scale up to useful sizes, or unlikely identify good solutions. In fact, the need to constrain the rank of the matrix representing feasible solutions of the EDGP is what makes the problem so hard. Intending to overcome these issues, we propose a two-steps heuristic algorithm based on SDP (or more precisely based on the very recent Diagonally Dominant Programming paradigm) and the explicitly modeling of Rank Constraints. We provide extensive computational testing against randomly generated instances as well as against feasible realistic protein conformation instances taken from the Protein Data Bank to analyze our method
Zhou, Fangjun. "Nonmonotone methods in optimization and DC optimization of location problems". Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/21777.
Texto completo沈逸江 y Yijiang Shen. "Binary image restoration by positive semidefinite programming and signomial programming". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39557431.
Texto completoKostin, Andrey. "Development of advanced mathematical programming methods for supply chain management". Doctoral thesis, Universitat Rovira i Virgili, 2013. http://hdl.handle.net/10803/108957.
Texto completoThe aim of this thesis is to provide a decision-support tool for the strategic planning of supply chains (SCs). The task consists of determining the number, location and capacities of all SC facilities, their expansion policy, the transportation links that need to be established, and the production rates and flows of all materials involved in the network. The problem is formulated as a mixed-integer linear programming (MILP) model, which is solved using several mathematical programming tools. First, a decomposition strategy was developed to expedite the solving procedure. Second, the approximation algorithm was utilized to solve the stochastic version of the MILP. Finally, the multi-objective model was developed to incorporate the trade-off between economical and ecological issues. All formulations were applied to a real case based on the Argentinean sugarcane industry. The tools presented are intended to help policy-makers in the strategic planning of infrastructures for chemicals production.
Sahlit, Carmen Lucia de Mesquita. "Mathematical programming methods for dynamically loaded rigid-plastic framed structures". Thesis, Imperial College London, 1992. http://hdl.handle.net/10044/1/7819.
Texto completoGrodal, Evert Olaus. "Designing primary hydrocarbon production separation systems : a mathematical programming formulation". Thesis, Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/12084.
Texto completoAli, Syed Zahid. "A mathematical programming approach to cellular mobile radio network design". Thesis, Imperial College London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269005.
Texto completoUlker, Ozgur. "Office space allocation by using mathematical programming and meta-heuristics". Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/13604/.
Texto completoRosa, Joao Miguel Feu. "Mathematical programming applied to diet problems in a Brazilian region". Thesis, Lancaster University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.332375.
Texto completo