We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the...
A STRONGLY POLYNOMIAL ALGORITHM FOR A SPECIAL CLASS OF LINEAR PROGRAMS We extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains specia... I Adler,S Cosares - 《Operations Research》 被引量: 42发表: ...
Over the rationals, the general linear programming problem is equivalent to the convex hull problem of determining if a given m 脳 n matrix H has a nontrivial nonnegative zero. We give a polynomial time algorithm that either finds a nontrivial nonnegative zero of H , or it obtains a ...
For each polytope we derive several classes of facet-defining inequalities and show that for some of these classes the corresponding separation problem can be solved in polynomial time. This leads to a polynomial-time algorithm for pairwise sequence alignment that is not based on dynamic programming...
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP 来自 iAacademic 喜欢 0 阅读量: 133 作者:L Li,KC Toh 摘要: Convex quadratic semidefinite programming (QSDP) has been widely applied in solving engineering and scientific problems such as nearest ...
Linear programmingPROJECTIONSYSTEMSThis article proposes a polynomial-time algorithm for convex quadratic optimization subject to linear inequalities. The running time of the algorithm is polynomial in the binary size of the input data and in the logarithm of the reciprocal of the given accuracy....
In particular, if the number of variables controlled by the inner decision maker can be considered to be constant, then the algorithm is a polynomial time algorithm. The algorithm is also well suited to parallel implementation.关键词: Theoretical or Mathematical/ decision theory linear programming ...
Yang Y (2009) Arc-search path-following interior-point algorithm for linear programming. Optimization Online. http://www.optimization-online.org/DB_HTML/2009/08/2375.html Yang Y (2011) A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur J Oper Res 215:25–38...
Todd, M. (1986), ‘Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming’, Mathematical Programming 35 , 173– 192. MATH MathSciNetTodd, M.J., Polynomial Expected Behavior of a Pivoting Algorithm for Linear Complementarity and Linear Programming ...
Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. The complexity of the proposed algorithm is polynomial time, and it is O(n/sup 6/L) for matching graphs of size n. The developed algorithm is compared to two...