Gotowa bibliografia na temat „Mathematical programming”
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 „Mathematical programming”.
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 "Mathematical programming"
Vasileva, Natalia, Vladimir Grigorev-Golubev i Irina Evgrafova. "Mathematical programming in Mathcad and Mathematica". E3S Web of Conferences 419 (2023): 02007. http://dx.doi.org/10.1051/e3sconf/202341902007.
Pełny tekst źródłaElphick, Clive, R. W. Cottle, M. L. Kelmanson i B. Korte. "Mathematical Programming." Journal of the Operational Research Society 36, nr 4 (kwiecień 1985): 342. http://dx.doi.org/10.2307/2582424.
Pełny tekst źródłaElphick, Clive. "Mathematical Programming". Journal of the Operational Research Society 36, nr 4 (kwiecień 1985): 342. http://dx.doi.org/10.1057/jors.1985.59.
Pełny tekst źródłaWilson, J. M., K. L. Hoffman, R. H. F. Jackson i J. Telgen. "Computational Mathematical Programming". Journal of the Operational Research Society 39, nr 8 (sierpień 1988): 792. http://dx.doi.org/10.2307/2583777.
Pełny tekst źródłaHowitt, Richard E. "Positive Mathematical Programming". American Journal of Agricultural Economics 77, nr 2 (maj 1995): 329–42. http://dx.doi.org/10.2307/1243543.
Pełny tekst źródłaWilson, J. M. "Computational Mathematical Programming". Journal of the Operational Research Society 39, nr 8 (sierpień 1988): 792. http://dx.doi.org/10.1057/jors.1988.137.
Pełny tekst źródłaWasserman, A. L., i R. H. Eckhouse. "Mathematical-oriented programming". Computer 21, nr 6 (czerwiec 1988): 89–95. http://dx.doi.org/10.1109/2.954.
Pełny tekst źródłaOley, L. A. "Mathematical programming techniques". European Journal of Operational Research 21, nr 1 (lipiec 1985): 139–40. http://dx.doi.org/10.1016/0377-2217(85)90098-0.
Pełny tekst źródłaSachs, E. "Computational mathematical programming". European Journal of Operational Research 39, nr 2 (marzec 1989): 227–28. http://dx.doi.org/10.1016/0377-2217(89)90199-9.
Pełny tekst źródłaСальков i Nikolay Sal'kov. "Graph-analytic Solution of Some Special Problems of Quadratic Programming". Geometry & Graphics 2, nr 1 (3.03.2014): 3–8. http://dx.doi.org/10.12737/3842.
Pełny tekst źródłaRozprawy doktorskie na temat "Mathematical programming"
Koch, Thorsten. "Rapid mathematical programming". [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=973541415.
Pełny tekst źródłaMoreno, Dávila Julio Moreno Davila Julio. "Mathematical programming for logic inference /". [S.l.] : [s.n.], 1990. http://library.epfl.ch/theses/?nr=784.
Pełny tekst źródłaSharifi, 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.
Pełny tekst źródłaSteffy, Daniel E. "Topics in exact precision mathematical programming". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39639.
Pełny tekst źródłaSmith, Barbara Mary. "Bus crew scheduling using mathematical programming". Thesis, University of Leeds, 1986. http://etheses.whiterose.ac.uk/1053/.
Pełny tekst źródłaAras, Raghav. "Mathematical programming methods for decentralized POMDPs". Thesis, Nancy 1, 2008. http://www.theses.fr/2008NAN10092/document.
Pełny tekst źródłaIn 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.
Pełny tekst źródłaHochreiter, Ronald. "Applied Mathematical Programming and Modelling 2016". edp sciences, 2017. http://dx.doi.org/10.1051/itmconf/20171400001.
Pełny tekst źródłaReeves, Laurence H. "Mathematical Programming Applications in Agroforestry Planning". DigitalCommons@USU, 1991. https://digitalcommons.usu.edu/etd/6495.
Pełny tekst źródłaViolin, Alessia. "Mathematical programming approaches to pricing problems". Doctoral thesis, Università degli studi di Trieste, 2014. http://hdl.handle.net/10077/10863.
Pełny tekst źródłaThere 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
Książki na temat "Mathematical programming"
Vajda, S. Mathematical programming. Mineola, N.Y: Dover Publications, 2009.
Znajdź pełny tekst źródłaKarmanov, V. G. Mathematical programming. Moscow: Mir Publishers, 1989.
Znajdź pełny tekst źródłaMathematical programming. Mineola, N.Y: Dover Publications, 2009.
Znajdź pełny tekst źródłaD, Lawrence Kenneth, red. Mathematical programming. Amsterdam: JAI/Elsevier, 2004.
Znajdź pełny tekst źródłaHoffman, K. L., R. H. F. Jackson i J. Telgen, red. Computation Mathematical Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/bfb0121175.
Pełny tekst źródłaSchittkowski, Klaus, red. Computational Mathematical Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-82450-0.
Pełny tekst źródłaLai, Young-Jou, i Ching-Lai Hwang. Fuzzy Mathematical Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-48753-8.
Pełny tekst źródłaMathematical programming applications. New York: Macmillan, 1987.
Znajdź pełny tekst źródła1946-, Schittkowski Klaus, i North Atlantic Treaty Organization. Scientific Affairs Division., red. Computational mathematical programming. Berlin: Springer-Verlag, 1985.
Znajdź pełny tekst źródłaL, Hoffman K., Jackson Richard Henry Frymuth, Telgen J, Mathematical Programming Society (U.S.). Committee on Algorithms. i NATO Advanced Study Institute on Computational Mathematical Programming (1984 : Bad Windsheim, Germany), red. Computational mathematical programming. Amsterdam: North-Holland, 1987.
Znajdź pełny tekst źródłaCzęści książek na temat "Mathematical programming"
Shekhar, Shashi, i Hui Xiong. "Mathematical Programming". W Encyclopedia of GIS, 651. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_762.
Pełny tekst źródłaLiu, Baoding. "Mathematical Programming". W Theory and Practice of Uncertain Programming, 1–8. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-89484-1_1.
Pełny tekst źródłaValliant, Richard, Jill A. Dever i Frauke Kreuter. "Mathematical Programming". W Statistics for Social and Behavioral Sciences, 129–68. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93632-1_5.
Pełny tekst źródłaJohnson, Ellis L. "Mathematical Programming". W Operations Research Proceedings, 7. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74862-2_3.
Pełny tekst źródłaSmith, D. Lloyd. "Mathematical Programming". W Mathematical Programming Methods in Structural Plasticity, 1–21. Vienna: Springer Vienna, 1990. http://dx.doi.org/10.1007/978-3-7091-2618-9_1.
Pełny tekst źródłaBelenky, Alexander S. "Mathematical Programming". W Applied Optimization, 13–90. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4757-6075-0_2.
Pełny tekst źródłaValliant, Richard, Jill A. Dever i Frauke Kreuter. "Mathematical Programming". W Practical Tools for Designing and Weighting Survey Samples, 129–61. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6449-5_5.
Pełny tekst źródłaWang, Lin. "Mathematical Programming". W Encyclopedia of Systems Biology, 1185–86. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_405.
Pełny tekst źródłaWeik, Martin H. "mathematical programming". W Computer Science and Communications Dictionary, 985. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11178.
Pełny tekst źródłaKhan, Aman. "Mathematical Programming". W Cost and Optimization in Government, 197–236. Second Edition. | New York : Routledge, 2017. | Series: Public Administration and Public Policy | Previous edition: 2000.: Routledge, 2017. http://dx.doi.org/10.4324/9781315207674-7.
Pełny tekst źródłaStreszczenia konferencji na temat "Mathematical programming"
Jing Gong i Jiaqi Ji. "Integration of Constraint Programming and mathematical programming". W 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579785.
Pełny tekst źródłaZhaotao Yin i Tieke Li. "The integration of constraint programming and mathematical programming". W 2008 IEEE International Conference on Service Operations and Logistics, and Informatics. IEEE, 2008. http://dx.doi.org/10.1109/soli.2008.4682825.
Pełny tekst źródłaMessac, Achille, Emanuel Melachrinoudis i Cyriaque Sukam. "Physical programming - A mathematical perspective". W 38th Aerospace Sciences Meeting and Exhibit. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2000. http://dx.doi.org/10.2514/6.2000-686.
Pełny tekst źródłaLent, Arnold. "Phase Recovery Via Mathematical Programming". W 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, redaktor William A. Pearlman. SPIE, 1989. http://dx.doi.org/10.1117/12.970160.
Pełny tekst źródłaShir, Ofer M. "Introductory mathematical programming for EC". W GECCO '20: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3377929.3389869.
Pełny tekst źródłaShir, Ofer M. "Introductory mathematical programming for EC". W GECCO '18: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3205651.3207871.
Pełny tekst źródłaShir, Ofer M. "Introductory mathematical programming for EC". W GECCO '21: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3449726.3461409.
Pełny tekst źródłaShir, Ofer M. "Introductory mathematical programming for EC". W GECCO '22: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3520304.3533630.
Pełny tekst źródłaWang, Ganming. "Mathematical programming applications in finance". W Second International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2022), redaktorzy Shi Jin i Wanyang Dai. SPIE, 2023. http://dx.doi.org/10.1117/12.2672763.
Pełny tekst źródłaAmbrus-Somogyi, K. "Mathematical programming in the engineering education". W 2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics (SISY). IEEE, 2012. http://dx.doi.org/10.1109/sisy.2012.6339562.
Pełny tekst źródłaRaporty organizacyjne na temat "Mathematical programming"
Mamgasarian, Olivi L. Machine Learning via Mathematical Programming. Fort Belvoir, VA: Defense Technical Information Center, listopad 1999. http://dx.doi.org/10.21236/ada382583.
Pełny tekst źródłaHo, James K. Nonprocedural Implementation of Mathematical Programming Algorithms. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1988. http://dx.doi.org/10.21236/ada203392.
Pełny tekst źródłaMacal, C. M., i A. P. Hurter. Solution of mathematical programming formulations of subgame perfect equilibrium problems. Office of Scientific and Technical Information (OSTI), luty 1992. http://dx.doi.org/10.2172/10134527.
Pełny tekst źródłaGoldfarb, Donald, i Garud Iyengar. Algorithms for Mathematical Programming with Emphasis on Bi-level Models. Office of Scientific and Technical Information (OSTI), maj 2014. http://dx.doi.org/10.2172/1132080.
Pełny tekst źródłaXu, Li. Fuzzy multiobjective mathematical programming in economic systems analysis: design and method. Portland State University Library, styczeń 2000. http://dx.doi.org/10.15760/etd.471.
Pełny tekst źródłaShokaliuk, Svitlana V., Yelyzaveta Yu Bohunenko, Iryna V. Lovianova i Mariya P. Shyshkina. Technologies of distance learning for programming basics lessons on the principles of integrated development of key competences. [б. в.], lipiec 2020. http://dx.doi.org/10.31812/123456789/3888.
Pełny tekst źródłaKnighton, Shane A. A Network-Based Mathematical Programming Approach to Optimal Rostering of Continuous Heterogeneous Workforces. Fort Belvoir, VA: Defense Technical Information Center, maj 2005. http://dx.doi.org/10.21236/ada433267.
Pełny tekst źródłaGoldfarb, D. Algorithms for mathematical programming. Annual technical progress report, June 15, 1993--June 14, 1994. Office of Scientific and Technical Information (OSTI), czerwiec 1994. http://dx.doi.org/10.2172/10159667.
Pełny tekst źródłaRioux, Bertrand, Abdullah Al Jarboua, Frederic Murphy i Axel Pierru. Implementing Alternative Pricing Policies in Economic Equilibrium Models Using the Extended Mathematical Programming Framework. King Abdullah Petroleum Studies and Research Center, marzec 2020. http://dx.doi.org/10.30573/ks--2020mp01.
Pełny tekst źródłaWang, Zhi, Mark Gehlhar i Shunli Yao. Reconciling Trade Statistics from China, Hong Kong and Their Major Trading Partners--A Mathematical Programming Approach. GTAP Technical Paper, wrzesień 2007. http://dx.doi.org/10.21642/gtap.tp27.
Pełny tekst źródła