4 papers
Cycling problems in linear programming
Yaguang Yang
This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fa…
A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Yaguang Yang
In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration numbers are derived. Applying one of the bounds to some special linear programming (LP) prob…
An Infeasible Interior-point Arc-search Algorithm for Nonlinear Constrained Optimization
Einosuke Iida, Yaguang Yang, Makoto Yamashita
In this paper, we propose an infeasible arc-search interior-point algorithm for solving nonlinear programming problems. Most algorithms based on interior-point methods are categori…
A note on the diameter of convex polytope
Yaguang Yang
This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diame…