Relevant bibliographies by topics / Infinite-Dimensional linear programming

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Infinite-Dimensional linear programming'

Author: Grafiati
Published: 1 June 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Infinite-Dimensional linear programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Infinite-Dimensional linear programming"

1

Appa, Gautam, Edward J. Anderson, and Peter Nash. "Linear Programming in Infinite-Dimensional Spaces." Journal of the Operational Research Society 40, no. 1 (1989): 109. http://dx.doi.org/10.2307/2583085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Appa, Gautam. "Linear Programming in Infinite-Dimensional Spaces." Journal of the Operational Research Society 40, no. 1 (1989): 109–10. http://dx.doi.org/10.1057/jors.1989.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Romeijn, H. Edwin, Robert L. Smith, and James C. Bean. "Duality in infinite dimensional linear programming." Mathematical Programming 53, no. 1-3 (1992): 79–97. http://dx.doi.org/10.1007/bf01585695.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

López, M. A. "Linear programming in infinite-dimensional spaces." European Journal of Operational Research 36, no. 1 (1988): 134–35. http://dx.doi.org/10.1016/0377-2217(88)90019-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Romeijn, H. Edwin, and Robert L. Smith. "Shadow Prices in Infinite-Dimensional Linear Programming." Mathematics of Operations Research 23, no. 1 (1998): 239–56. http://dx.doi.org/10.1287/moor.23.1.239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ho, Tvu-Ying, Yuung-Yih Lur, and Soon-Yi Wu. "The Difference between Finite Dimensional Linear Programming Problems and Infinite Dimensional Linear Programming Problems." Journal of Mathematical Analysis and Applications 207, no. 1 (1997): 192–205. http://dx.doi.org/10.1006/jmaa.1997.5279.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Taksar, Michael I. "Infinite-Dimensional Linear Programming Approach to SingularStochastic Control." SIAM Journal on Control and Optimization 35, no. 2 (1997): 604–25. http://dx.doi.org/10.1137/s036301299528685x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vinh, N. T., D. S. Kim, N. N. Tam, and N. D. Yen. "Duality gap function in infinite dimensional linear programming." Journal of Mathematical Analysis and Applications 437, no. 1 (2016): 1–15. http://dx.doi.org/10.1016/j.jmaa.2015.12.043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Balbas, Alejandro, and Antonio Heras. "Duality theory for infinite-dimensional multiobjective linear programming." European Journal of Operational Research 68, no. 3 (1993): 379–88. http://dx.doi.org/10.1016/0377-2217(93)90194-r.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kariotoglou, Nikolaos, Maryam Kamgarpour, Tyler H. Summers, and John Lygeros. "The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes." Journal of Artificial Intelligence Research 60 (October 4, 2017): 263–85. http://dx.doi.org/10.1613/jair.5500.

Full text
Abstract:
One of the most fundamental problems in Markov decision processes is analysis and control synthesis for safety and reachability specifications. We consider the stochastic reach-avoid problem, in which the objective is to synthesize a control policy to maximize the probability of reaching a target set at a given time, while staying in a safe set at all prior times. We characterize the solution to this problem through an infinite dimensional linear program. We then develop a tractable approximation to the infinite dimensional linear program through finite dimensional approximations of the decisi
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Infinite-Dimensional linear programming"

1

Badikov, Sergey. "Infinite-dimensional linear programming and model-independent hedging of contingent claims." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/59069.

Full text
Abstract:
We consider model-independent pathwise hedging of contingent claims in discrete-time markets, in the framework of infinite-dimensional linear programmes (LP). The dual problem can be formulated as optimization over the set of martingale measures subject to market constraints. Absence of model-independent arbitrage plays a crucial role in ensuring that both the primal and the dual problems are well posed and there is no duality gap. In fact we show that different notions of model-independent arbitrage are required to prove duality results in various settings. We then specialize this duality the
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Cette thèse présente trois contributions principales liées à l'approche de programmation linéaire pour les jeux à champ moyen (MFGs).La première partie de la thèse traite les aspects théoriques des MFGs permettant simultanément arrêt optimal, contrôle stochastique et absorption. En utilisant la formulation de programmation linéaire pour ce type de MFGs, un résultat général d'existence pour les équilibres de Nash MFG est dérivé sous des hypothèses faibles à travers du théorème de point fixe de Kakutani-Fan-Glicksberg. Nous montrons que cette méthode de relaxation est équivalente à l'approche pa
APA, Harvard, Vancouver, ISO, and other styles
3

Bo-JyunJian and 簡伯均. "An algorithm for infinite-dimensional linear programming problems on Lp space." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/35605374250240399546.

Full text
Abstract:
碩士<br>國立成功大學<br>數學系應用數學碩博士班<br>98<br>This thesis studies the infinite-dimensional linear programming problems of integral type. The decision variable is taken in the Lp space where 1＜p＜infty and required to have an upper bound and a lower bound by continuous functions on a compact interval. To simplify the original problems, we transform them to equivalent problems. Two numerical algorithms are proposed for solving these problems and the convergence properties of the algorithms are given. Some numerical examples are also given to implement the proposed algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Infinite-Dimensional linear programming"

1

Anderson, E. J. Linear programming in infinite-dimensional spaces: Theory and applications. Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Banks, H. Thomas. Optimal feedback control infinite dimensional parabolic evolution systems: Approximation techniques. National Aeronautics and Space Administration, Langley Research Center, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1954-, Anderson E. J., and Philpott A. B. 1956-, eds. Infinite programming: Proceedings of an International Symposium on Infinite Dimensional Linear Programming, held at Churchill College, Cambridge, United Kingdom, September 7-10, 1984. Springer-Verlag, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Philpott, Andrew B., and Edward J. Anderson. Infinite Programming: Proceedings of an International Symposium on Infinite Dimensional Linear Programming Churchill College, Cambridge, United Kingdom, September 7-10 1984. Springer London, Limited, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Butnariu, D., and A. N. Iusem. Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Butnariu, D., and A. N. Iusem. Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization (Applied Optimization). Springer, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Infinite-Dimensional linear programming"

1

Rubio, J. E. "Nonlinear Optimal Control Problems as Infinite-Dimensional Linear Programming Problems." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-46564-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"On the Approximation of an Infinite-Dimensional Linear Programming Problem." In Proceedings of the Eighth International Colloquium on Differential Equations, Plovdiv, Bulgaria, 18–23 August, 1997. De Gruyter, 1998. http://dx.doi.org/10.1515/9783112313923-023.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Infinite-Dimensional linear programming"

1

Elia, Nicola, Munther A. Dahleh, and Ignacio J. Diaz-Bobillo. "Controller Design via Infinite-Dimensional Linear Programming." In 1993 American Control Conference. IEEE, 1993. http://dx.doi.org/10.23919/acc.1993.4793265.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fabien, Brian C. "Dynamic System Optimization Using Higher-Order Runge-Kutta Discretization." In ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-39421.

Full text
Abstract:
This paper evaluates some numerical methods for the approximate solution dynamic system optimization problems. The paper considers the optimization of dynamic systems that are subject to equality and inequality constraints. These types of problems include optimal control and parameter identification optimization problems. The numerical solution technique is based on transforming the infinite dimensional dynamic system optimization problem into a finite dimensional nonlinear programming (NLP) problem. This solution method is realized by; (i) approximating the control input using a finite set of
APA, Harvard, Vancouver, ISO, and other styles
3

Fabien, Brian C. "Implementation of an Algorithm for the Direct Solution of Optimal Control Problems." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48750.

Full text
Abstract:
This paper presents the implementation of a numerical algorithm for the direct solution of optimal control and parameter identification problems. The problems may include differential equations that define the state, inequality constraints, and equality constraints at the initial and final times. The numerical method is based on transforming the infinite dimensional optimal control problem into a finite dimensional nonlinear programming problem. The transformation technique involves dividing the time interval of interest into a mesh that need not be uniform. In each subinterval of the mesh the
APA, Harvard, Vancouver, ISO, and other styles
4

Saad, Hussein, Eduardo Divo, Sandra Boetcher, Jeff Brown, and Alain Kassab. "A Robust and Efficient Thermographic NDE Tool Based on an Inverse VoF Meshless Method." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-36758.

Full text
Abstract:
A novel computational tool based on the Localized Radial-basis Function (RBF) Collocation (LRC) Meshless method coupled with a Volume-of-Fluid (VoF) scheme capable of accurately and efficiently solving transient multi-dimensional heat conduction problems in composite and heterogeneous media is formulated and implemented. While the LRC Meshless method lends its inherent advantages of spectral convergence and ease of automation, the VoF scheme allows to effectively and efficiently simulate the location, size, and shape of cavities, voids, inclusions, defects, or de-attachments in the conducting
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Infinite-Dimensional linear programming' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography