Cover Image

Conditions when the problems of linear programming are algorithmically unsolvable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chernov, Viktor, Chernov, Vladimir
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Primary 03D78, Secondary 03F60, 90C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asymptotically Optimal Policies for Weakly Coupled Markov Decision Processes
by: Goldsztajn, Diego, et al.
Published: (2024)

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)

Substitution for minimizing/maximizing a tropical linear (fractional) programming
by: Truffet, L.
Published: (2026)

Axiom Beta Implies Elementary Transfinite Recursion
by: Frittaion, Emanuele, et al.
Published: (2026)

A Deep-Inference Sequent Calculus for Basic Propositional Team Logic (Without Delving Too Deep)
by: Anttila, Aleksi, et al.
Published: (2025)

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)

A Baire Category Approach to Besicovitch's Theorem and Measure Regularity
by: Gruner, Emma, et al.
Published: (2026)

Linear Programming Problem Solved By a Special Substitution Method
by: Truffet, Laurent
Published: (2026)

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)

On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales
by: Neri, Morenikeji, et al.
Published: (2024)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
by: Huttegger, Simon M., et al.
Published: (2024)

Deconstructible classes of modules and stability
by: Mazari-Armida, Marcos, et al.
Published: (2025)

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
by: Harrington, Leo A., et al.
Published: (2025)

Large Deviations for Empirical Measures of Self-Interacting Markov Chains
by: Budhiraja, Amarjit, et al.
Published: (2023)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

Distality in Ordered Abelian Groups
by: Okura, Koki
Published: (2026)

The tree pigeonhole principle in the Weihrauch degrees
by: Dzhafarov, Damir, et al.
Published: (2023)

Largeness notions and polytime translation for $\forall Σ^0_3$-consequences of $\mathsf{RT}^2_2$
by: Houérou, Quentin Le, et al.
Published: (2026)

Towards a Finer Classification of Strongly Minimal Sets
by: Baldwin, John T., et al.
Published: (2021)

The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

Large deviations for interacting particle dynamics for finding mixed equilibria in zero-sum games
by: Nilsson, Viktor, et al.
Published: (2022)

Homomorphism Preservation Theorems for Many-Valued Structures
by: Carr, James
Published: (2024)

The adjacent Hindman's theorem and the $\mathbb Z$-Ramsey's theorem
by: Aceves-Martínez, Bruno Fernando, et al.
Published: (2024)

On the Complexity of the Bilevel Shortest Path Problem
by: Henke, Dorothee, et al.
Published: (2024)

The cohesive and stable Ramsey theorems and proof size over a weak base theory
by: Kołodziejczyk, Leszek Aleksander, et al.
Published: (2026)

Strong reducibilities and set theory
by: Schweber, Noah
Published: (2024)

The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)

Hindman and Owings-like theorems without the Axiom of Choice
by: Guzmán-Vega, José A., et al.
Published: (2026)

Ramsey-like theorems for separable permutations
by: Houérou, Quentin Le, et al.
Published: (2025)

Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025)

Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)

The Amalgamation Property for automorphisms of ordered abelian groups
by: Dobrowolski, Jan, et al.
Published: (2022)

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
by: Galliani, Pietro
Published: (2025)