# A Novel Algorithm for Linear Programming

Source: [A Novel Algorithm for Linear Programming](<https://www.sota2.com/research/paper/68fa50331e209131ce96969a>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-06-04T05:02:01.985Z

Authors: K. Eswaran

Published: 2013-03-20T13:57:11.000Z

## Abstract

The problem of optimizing a linear objective function,given a number of linear constraints has been a long standing problem ever since the times of Kantorovich, Dantzig and von Neuman. These developments have been followed by a different approach pioneered by Khachiyan and Karmarkar.   In this paper we present an entirely new method for solving an old optimization problem in a novel manner, a technique that reduces the dimension of the problem step by step and interestingly is recursive. A theorem which proves the correctness of the approach is given.   The method can be extended to other types of optimization problems in convex space, e.g. for solving a linear optimization problem subject to nonlinear constraints in a convex region.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1303.4942>)

[PDF](<https://arxiv.org/pdf/1303.4942.pdf>)