A penalty approach to linear programs with many two-sided constraints

DOI10.1007/978-3-030-77876-7_14MaRDI QIDQ2117633zbMATH OpenOpenAlexFDO

Authors P. I. Stetsyuk, Andreas Fischer, Oksana Pichugina

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-77876-7_14

zbMATH Keywords

linear programming\(r\)-algorithmGNU octavenon-smooth penalty method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 977754
• Linear programming with nonparametric penalty programs and iterated thresholding
• A Newton method for linear programming
• Quadratic approximation of penalty functions for solving large-scale linear programs
• Robust solutions of uncertain linear programs

Cites work

• scientific article; zbMATH DE number 1971713 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• scientific article; zbMATH DE number 3249572 (Why is no real title available?)
• A Modeling Language for Mathematical Programming
• Algorithms of nondifferentiable optimization: development and application
• Nondifferentiable optimization and polynomial problems
• Robust energy cost optimization of water distribution system with uncertain demand
• Robust optimization
• Shor's \(r\)-algorithms: theory and practice
• Theory and software implementations of Shor's \(r\)-algorithms

Cited in

(3)

• Linear programming with nonparametric penalty programs and iterated thresholding
• On using exterior penalty approaches for solving linear programming problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation

Describes a project that uses

Uses Software

• Octave
• AMPL
• CPLEX
• Gurobi
• GLPK
• NEOS

This page was built for publication: A penalty approach to linear programs with many two-sided constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117633)