Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0604171

A New Algorithm for Linear Programming

Dhananjay P. Mehendale
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The new algorithm is based on the idea of treating the objective function as a parameter. We form a matrix of coefficients, made-up of the coefficients of the variables defined in the problem itself, and the coefficients of variables defined newly, for converting inequalities into equations, namely, slack variables if it is the maximization problem, or, surplus variables if it is the minimization problem. The system of equations we use consist of the objective equation and equations obtained from inequalities defining constraint imposed by the problem. We obtain reduced-row-echelon-form, R, for this matrix containing only one unknown, namely, the objective function itself as an unknown parameter, d, say. This matrix in the reduced-row-echelon-form contains columns (column vectors) corresponding to basic variables and non-basic variables. If all the entries in the columns corresponding to non-basic variables in R are already nonnegative then we will see that we have almost reached to the solution and nothing much is left to be done. If there are columns corresponding to non-basic variables which contain some negative entries then we will require to apply suitable row transformations, at most $m$ in number if there are m rows in R, as we will see below, to make all the entries in the columns corresponding to non-basic variables nonnegative. We then proceed to show that the method developed above for linear programming naturally extends to nonlinear programming problems. For nonlinear programming problems, we use the technique of Grobner bases, since Grobner basis is an equivalent of reduced row echelon form for a system of nonlinear equations.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dhananjay P. Mehendale. 2019-03-13. A New Algorithm for Linear Programming. https://arxiv.org/abs/math/0604171

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Hilbert's 8th Problem

This note takes the probabilistic half of the Riemann Xi story on its own terms. Every object in the subject is a first passage time: Riemann's kernel is the law of the logarithm of a sum of two hitting times of a three dimensional Bessel process, Polya's approximation is the first passage of a Brownian motion with drift, and the reciprocal Xi function, under the Riemann hypothesis, is the Laplace transform of an infinite convolution of exponentials whose rates are the squared zeros. That reciprocal is written as $F_α(s)=ξ(α)/ξ(α+\sqrt s)$, and complete monotonicity, unconditional for $α\ge1$, is conjectured to persist to the critical basepoint $α=1/2$. Kent's eigenvalue expansion says which laws can arise this way, namely those whose Thorin measure is a Dirichlet spectrum with unit atoms, and Krein's inverse spectral theory turns the hypothesis into the existence of a string. The passage from Riemann to Polya is a flow, not a jump: the Cauchy semigroup on Thorin measures, each step an Esscher tilt followed by a Brownian subordination along a curvature family of hyperbolic Bessel processes, with the arithmetic surviving as Fourier modes damped like $e^{-2πk\varepsilon}$. The arithmetic lives in the atoms and nowhere else. Approximations rank by what they keep: Polya keeps neither atoms nor tempering and is off by a factor of three, a fitted Bessel dimension reaches one per cent, and a few atoms with an erfc tempering stay better than one part in a thousand across four decades. And the flow runs backwards: the Thorin measure of the reciprocal is evaluated from a prime sieve with no reference to any zero, and nonnegative deconvolution of it returns the first ten zero ordinates with unit masses, nine of them to four decimals and one to three. All identities are verified with mpmath, and the scripts are included.

math.GM↗
arXiv2026

Dynamical Geometry of Principal Bundle Constrained Systems: Compatible Pairs, Contact Degeneration, and Adapted Metrics

We study invariant codimension-one constraints on principal bundles through compatible pairs: a constraint distribution and a nonzero coadjoint field parallel for a principal connection. Pairing the field with the connection gives an invariant one-form whose Levi form separates a horizontal curvature contribution from a vertical coadjoint-orbit contribution. This decomposition yields criteria for integrability, contactness, and characteristic reduction; holonomy and stabilizer reductions describe global existence. For evolving compatible pairs, we identify the mixed-curvature obstruction to compatibility and prove that connection transport preserves the Levi geometry. For initially contact data over a closed base of dimension $2n$, we establish matching bounds for the quadratic $H^{n+1}$ cost of contact degeneration: making the paired curvature vanish on a Darboux ball of radius $r$ in time $T$ costs an amount comparable to $[T\log(R_*/r)]^{-1}$. The constructed paths remain contact before $T$, preserve the curvature class, and force the $L^\infty$ norm of every transporting velocity gradient to grow at least as $1/[2(T-t)]$ on the collapsing region in Darboux coordinates. On a closed three-manifold, a contact form preserved by a locally free circle action admits an invariant adapted metric with any prescribed positive curl eigenvalue and unit circle generator. We parametrize all such metrics and prove that their space is contractible. Along the circle-bundle degeneration paths, every continuous tensor limit of normalized adapted metrics is degenerate above the collapsing region.

math.GM↗