Relevant bibliographies by topics / Infeasibility

Contents

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

Academic literature on the topic 'Infeasibility'

Author: Grafiati
Published: 4 June 2021
Last updated: 3 February 2022

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 'Infeasibility.'

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 "Infeasibility"

1

Schweikard, Achim, and Fabian Schwarzer. "Detecting geometric infeasibility." Artificial Intelligence 105, no. 1-2 (1998): 139–59. http://dx.doi.org/10.1016/s0004-3702(98)00076-9.

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

Artemov, Sergei, and Roman Kuznets. "Logical omniscience as infeasibility." Annals of Pure and Applied Logic 165, no. 1 (2014): 6–25. http://dx.doi.org/10.1016/j.apal.2013.07.003.

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

GREENBERG, HARVEY J. "Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility." IMA Journal of Management Mathematics 1, no. 2 (1986): 99–109. http://dx.doi.org/10.1093/imaman/1.2.99.

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

GREENBERG, HARVEY J. "Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility." IMA Journal of Management Mathematics 2, no. 1 (1988): 39–50. http://dx.doi.org/10.1093/imaman/2.1.39.

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

Kämpke, Thomas. "The geometry of linear infeasibility." Applied Mathematics and Computation 129, no. 2-3 (2002): 317–37. http://dx.doi.org/10.1016/s0096-3003(01)00042-x.

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

Cechlárová, Katarína, and Pavel Dikoxe. "Resolving infeasibility in extremal algebras." Linear Algebra and its Applications 290, no. 1-3 (1999): 267–73. http://dx.doi.org/10.1016/s0024-3795(98)10248-3.

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

Almeida, Euclides, and Argimiro R. Secchi. "Solving dynamic optimization infeasibility problems." Computers & Chemical Engineering 36 (January 2012): 227–46. http://dx.doi.org/10.1016/j.compchemeng.2011.07.003.

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

Liu, Minghui, and Gábor Pataki. "Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming." Mathematical Programming 167, no. 2 (2017): 435–80. http://dx.doi.org/10.1007/s10107-017-1136-5.

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

Andersen, Kent, Quentin Louveaux, and Robert Weismantel. "Certificates of linear mixed integer infeasibility." Operations Research Letters 36, no. 6 (2008): 734–38. http://dx.doi.org/10.1016/j.orl.2008.08.003.

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

Chinneck, John W. "MINOS(IIS): Infeasibility analysis using MINOS." Computers & Operations Research 21, no. 1 (1994): 1–9. http://dx.doi.org/10.1016/0305-0548(94)90057-4.

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

Dissertations / Theses on the topic "Infeasibility"

1

Brown, Adam. "Infeasibility of solving finite mathematical problems." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86989.

Full text
Abstract:
We prove that the decision problem for finite mathematical state- ments, though recursive, is infeasible in seemingly any realistic model of computation. In particular, we construct of a set of finite mathematical statements which can only be feasibly solved by programs long enough to explicitly encode a decision for each statement. This result was published in Hungarian, in 1973, by Michael Makkai and appears here for the first time in English. In this paper we: 1) elucidate Makkai's proof as an adaptation of Gödel's first incompleteness proof, 2) strengthen his 1973 result and 3) ref
APA, Harvard, Vancouver, ISO, and other styles
2

Call, Mikael. "Shortest Path Routing Modelling, Infeasibility and Polyhedra." Doctoral thesis, Linköpings universitet, Optimeringslära, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-85547.

Full text
Abstract:
The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. This is of utmost importance. Traffic in IP networks is commonly routed along shortest paths with respect to auxiliary link weights, e.g. using the OSPF or IS-IS protocol. Here, shortest path routing is indirectly controlled via the link weights only, and it is therefore crucial to have a profound understanding of the shortest path routing mechanism to solve traffic engineering problems in IP
APA, Harvard, Vancouver, ISO, and other styles
3

Tran, Ngoc Nguyen. "Infeasibility detection and regularization strategies in nonlinear optimization." Thesis, Limoges, 2018. http://www.theses.fr/2018LIMO0059/document.

Full text
Abstract:
Dans cette thèse, nous nous étudions des algorithmes d’optimisation non linéaire. D’une part nous proposons des techniques de détection rapide de la non-réalisabilité d’un problème à résoudre. D’autre part, nous analysons le comportement local des algorithmes pour la résolution de problèmes singuliers. Dans la première partie, nous présentons une modification d’un algorithme de lagrangien augmenté pour l’optimisation avec contraintes d’égalité. La convergence quadratique du nouvel algorithme dans le cas non-réalisable est démontrée théoriquement et numériquement. La seconde partie est dédiée à
APA, Harvard, Vancouver, ISO, and other styles
4

Vada, Jostein. "Prioritized infeasibility handling in linear model predictive control : optimality and efficiency." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2000. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1425.

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

Enns, Linda C. "Root pressure, a reexamination of the infeasibility of the osmometer mechanism." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ36926.pdf.

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

Banjac, Goran. "Operator splitting methods for convex optimization : analysis and implementation." Thesis, University of Oxford, 2018. https://ora.ox.ac.uk/objects/uuid:17ac73af-9fdf-4cf6-a946-3048da3fc9c2.

Full text
Abstract:
Convex optimization problems are a class of mathematical problems which arise in numerous applications. Although interior-point methods can in principle solve these problems efficiently, they may become intractable for solving large-scale problems or be unsuitable for real-time embedded applications. Iterations of operator splitting methods are relatively simple and computationally inexpensive, which makes them suitable for these applications. However, some of their known limitations are slow asymptotic convergence, sensitivity to ill-conditioning, and inability to detect infeasible problems.
APA, Harvard, Vancouver, ISO, and other styles
7

Aguilera, Cabanas Jorge Antonio. "Robustesse et visualisation de production de mélanges." Thesis, Grenoble, 2011. http://www.theses.fr/2011GRENM052/document.

Full text
Abstract:
Le procédé de fabrication de mélanges (PM) consiste à déterminer les proportions optimales à mélanger d'un ensemble de composants de façon que le produit obtenu satisfasse un ensemble de spécifications sur leurs propriétés. Deux caractéristiques importantes du problème de mélange sont les bornes dures sur les propriétés du mélange et l'incertitude répandue dans le procédé. Dans ce travail, on propose une méthode pour la production de mélanges robustes en temps réel qui minimise le coût de la recette et la sur-qualité du mélange. La méthode est basée sur les techniques de l'Optimisation Robuste
APA, Harvard, Vancouver, ISO, and other styles
8

Alami, Mohsen. "Interval Based Parameter Identification for System Biology." Thesis, Linköpings universitet, Reglerteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-75161.

Full text
Abstract:
This master thesis studies the problem of parameter identification for system biology. Two methods have been studied. The method of interval analysis uses subpaving as a class of objects to manipulate and store inner and outer approximations of compact sets. This method works well with the model given as a system of differential equations, but has its limitations, since the analytical expression for the solution to the ODE is not always obtainable, which is needed for constructing the inclusion function. The other method, studied, is SDP-relaxation of a nonlinear and non-convex feasibility pro
APA, Harvard, Vancouver, ISO, and other styles
9

Sinop, Ali Kemal. "Graph Partitioning and Semi-definite Programming Hierarchies." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/145.

Full text
Abstract:
Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, clustering and image segmentation. Unfortunately such problems are notorious for the huge gap between known best known approximation algorithms and hardness of approximation results. In this thesis, we study approximation algorithms for graph partitioning problems using a strong hierarchy of relaxati
APA, Harvard, Vancouver, ISO, and other styles
10

Sahraoui, Youcef. "Short-term hydropower production scheduling : feasibility and modeling." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX025/document.

Full text
Abstract:
Dans le secteur électrique et chez EDF, l'optimisation mathématique est utilisée pour modéliser et résoudre des problèmes de gestion de la production d'électricité.Citons quelques applications : la modélisation des problèmes d'équilibre des marchés, la gestion des risques d'épuisement des barrages, la programmation des arrêts de tranches nucléaires.Plus particulièrement l'hydroélectricté est une énergie renouvelable, peu chère, flexible mais limitée.Exploiter l'hydraulique constitue donc un enjeu important.Nous nous intéressons à des problèmes d'optimisation de Programmation Non Linéaire en No
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Infeasibility"

1

Feasibility and infeasibility in optimization: Algorithms and computational methods. Springer, 2008.

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

Feasibility and Infeasibility in Optimization. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-74932-7.

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

Chinneck, John W. W. Feasibility and Infeasibility in Optimization : : Algorithms and Computational Methods. Springer, 2010.

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

The Global Free Trade Error: The Infeasibility of Ricardo's Comparative Advantage Theory. Routledge, 2017.

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

Book chapters on the topic "Infeasibility"

1

Felsner, Stefan, and Nicole Morawe. "Infeasibility of Systems of Halfspaces." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55566-4_18.

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

Buldas, Ahto, Aleksandr Lenin, Jan Willemson, and Anton Charnamord. "Simple Infeasibility Certificates for Attack Trees." In Advances in Information and Computer Security. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64200-0_3.

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

Gärling, Tommy. "The Feasible Infeasibility of Activity Scheduling." In Human Behaviour and Traffic Networks. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07809-9_10.

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

Liffiton, Mark H., and Ammar Malik. "Enumerating Infeasibility: Finding Multiple MUSes Quickly." In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38171-3_11.

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

Chinneck, John W., and Wojtek Michalowski. "MOLP Formulation Assistance Using LP Infeasibility Analysis." In Multi-Objective Programming and Goal Programming. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-87561-8_8.

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

Mencía, Raúl, Carlos Mencía, and Ramiro Varela. "Repairing Infeasibility in Scheduling via Genetic Algorithms." In From Bioinspired Systems and Biomedical Applications to Machine Learning. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19651-6_25.

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

Ray, Tapabrata, Hemant Kumar Singh, Amitay Isaacs, and Warren Smith. "Infeasibility Driven Evolutionary Algorithm for Constrained Optimization." In Constraint-Handling in Evolutionary Optimization. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00619-7_7.

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

Katz, Jonathan, Aishwarya Thiruvengadam, and Hong-Sheng Zhou. "Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption." In Public-Key Cryptography – PKC 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36362-7_2.

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

Dachman-Soled, Dana, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, and Dominique Schröder. "Feasibility and Infeasibility of Secure Computation with Malicious PUFs." In Advances in Cryptology – CRYPTO 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44381-1_23.

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

Subramani, K., and Piotr Wojciechowski. "Read-Once Certification of Linear Infeasibility in UTVPI Constraints." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14812-6_36.

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

Conference papers on the topic "Infeasibility"

1

Delahaye, Mickaël. "IPEG: Utilizing Infeasibility." In 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2011. http://dx.doi.org/10.1109/icstw.2011.91.

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

Suleiman, Wael, Fumio Kanehiro, and Eiichi Yoshida. "Infeasibility-free inverse kinematics method." In 2015 IEEE/SICE International Symposium on System Integration (SII). IEEE, 2015. http://dx.doi.org/10.1109/sii.2015.7404996.

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

Budiono, Tri A., and Kok Wai Wong. "Memetic algorithm behavior on timetabling infeasibility." In TENCON 2011 - 2011 IEEE Region 10 Conference. IEEE, 2011. http://dx.doi.org/10.1109/tencon.2011.6129070.

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

Li, Sihui, and Neil Dantam. "Learning Proofs of Motion Planning Infeasibility." In Robotics: Science and Systems 2021. Robotics: Science and Systems Foundation, 2021. http://dx.doi.org/10.15607/rss.2021.xvii.064.

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

Khorshid, E., and A. Falah. "Enhancing Infeasibility Detection Method for Mechanical Design Problems." In ASME 2013 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/imece2013-63651.

Full text
Abstract:
This paper presents the application of the Multistart point technique in order to enhance a previous existing infeasibility detection method based on Sequential Quadratic Programming (SQP) used for detecting modeling errors by finding the Minimum Intractable Subsystem (MIS) of constraints. This new method showed a great potential in detecting infeasibility without countering the problems of the initial starting point faced by many methods for Nonlinear Programming Problems. The real performance of the anticipated method is demonstrated by solving complex mechanical systems were inconsistency c
APA, Harvard, Vancouver, ISO, and other styles
6

Song, Yingbo, Michael E. Locasto, Angelos Stavrou, Angelos D. Keromytis, and Salvatore J. Stolfo. "On the infeasibility of modeling polymorphic shellcode." In the 14th ACM conference. ACM Press, 2007. http://dx.doi.org/10.1145/1315245.1315312.

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

Li, Sihui, and Neil T. Dantam. "Towards General Infeasibility Proofs in Motion Planning*." In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2020. http://dx.doi.org/10.1109/iros45743.2020.9340804.

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

Dimarogonas, Dimos V., and Kostas J. Kyriakopoulos. "Further results on formation infeasibility and velocity alignment." In 2007 46th IEEE Conference on Decision and Control. IEEE, 2007. http://dx.doi.org/10.1109/cdc.2007.4434680.

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

Sharma, Deepak, and Prem Soren. "Infeasibility driven approach for bi-objective evolutionary optimization." In 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2013. http://dx.doi.org/10.1109/cec.2013.6557659.

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

Li, Dafu, and Na Zhao. "Discussion on the infeasibility study of key projects." In 2011 International Conference on Multimedia Technology (ICMT). IEEE, 2011. http://dx.doi.org/10.1109/icmt.2011.6002760.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Infeasibility' 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