Feasible rounding approaches for equality constrained mixed-integer optimization problems

A feasible rounding approach is a novel technique to compute good feasible points for mixed-integer optimization problems. The central idea of this approach is the construction of a continuously described inner parallel set for which any rounding of any of its elements is feasible in the original mixed-integer problem. It is known that this approach … Read more

A Nonstandard Simplex Algorithm for Linear Programming

The simplex algorithm travels, on the underlying polyhedron, from vertex to vertex until reaching an optimal vertex. With the same simplex framework, the proposed algorithm generates a series of feasible points (which are not necessarily vertices). In particular, it is exactly an interior point algorithm if the initial point used is interior. Computational experiments show … Read more