Conditions when the problems of linear programming are algorithmically unsolvable (2311.06687v2)

Published 11 Nov 2023 in math.OC

Abstract: We study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find the optimal plan with the constructive real number components. We show that it is impossible to have an algorithm that solves an arbitrary constructive real programming problem.

Abstract PDF HTML Chat (Pro)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper to Video (Beta)

Generate a video overview of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.