Similar Search Results

The radius of robust feasibility of uncertain mathematical programs : a survey and recent developments

Goberna, Miguel A.; Jeyakumar, Vaithilingam; Li, Guoyin; … - In: European journal of operational research : EJOR 296 (2022) 3, pp. 749-763

Persistent link: https://www.econbiz.de/10013206043

Implementing the simplex method as a cutting-plane method, with a view to regularization

Fábián, Csaba; Papp, Olga; Eretnek, Krisztián - In: Computational Optimization and Applications 56 (2013) 2, pp. 343-368

We show that the simplex method can be interpreted as a cutting-plane method, assuming that a special pricing rule is used. This approach is motivated by the recent success of the cutting-plane method in the solution of special stochastic programming problems. We focus on the special linear...

Persistent link: https://www.econbiz.de/10010998256

Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices

Mehrotra, Sanjay; Li, Zhifeng - In: Journal of Global Optimization 49 (2011) 4, pp. 623-649

Persistent link: https://www.econbiz.de/10008925260

A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints

Charkhgard, Hadi; Savelsbergh, Martin W. P.; Talebian, … - In: Computers & operations research : and their … 89 (2018), pp. 17-30

Persistent link: https://www.econbiz.de/10011755078

A regularized simplex method

Fábián, Csaba I.; Eretnek, Krisztián; Papp, Olga - In: Central European journal of operations research : CEJOR … 23 (2015) 4, pp. 877-898

Persistent link: https://www.econbiz.de/10011597876