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

DOI10.1007/s10589-013-9562-7zbMath1318.90048OpenAlexW2000318029MaRDI QIDQ377719

Olga Papp, Csaba I. Fábián, Krisztián Eretnek

Publication date: 7 November 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9562-7

zbMATH Keywords

linear programmingstochastic programmingconvex programmingsimplex methodcutting-plane method

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Stochastic programming (90C15)

Related Items (1)

A regularized simplex method

Uses Software

• DEVEX
• LPbook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A regularized simplex method
• Processing second-order stochastic dominance models using cutting-plane representations
• Integrated chance constraints: reduced forms and an algorithm
• Computational aspects of minimizing conditional value-at-risk
• Efficient nested pricing in the simplex algorithm
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• The simplex method. A probabilistic analysis
• Newton's method for convex programming and Tschebyscheff approximation
• Pivot rules for linear programming: A survey on recent theoretical developments
• A piecewise linear dual phase-1 algorithm for the simplex method
• A general pricing scheme for the simplex method
• Bundle-type methods for inexact data
• Stochastic linear programming. Models, theory, and computation
• Steepest-edge simplex algorithms for linear programming
• A generalized dual phase-2 simplex algorithm.
• Computational techniques of the simplex method
• Linear optimization and extensions
• Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
• New variants of bundle methods
• A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
• Solving two-stage stochastic programming problems with level decomposition
• Generalized upper bounding techniques
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
• Level bundle methods for oracles with on-demand accuracy
• Linear Inequalities and Related Systems. (AM-38)
• The Cutting-Plane Method for Solving Convex Programs
• Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
• New Formulations for Optimization under Stochastic Dominance Constraints
• Smoothed analysis of algorithms
• Solving Real-World Linear Programs: A Decade and More of Progress
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A central cutting plane algorithm for the convex programming problem
• On a dual method for a specially structured linear programming problem with application to stochastic programming
• A Practical Geometrically Convergent Cutting Plane Algorithm
• Pivot selection methods of the Devex LP code
• Linear programming. Foundations and extensions

This page was built for publication: Implementing the simplex method as a cutting-plane method, with a view to regularization