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

DOI10.1007/978-3-030-77876-7_14zbMATH Open1489.90057OpenAlexW3172403983MaRDI QIDQ2117633FDOQ2117633

Oksana Pichugina, P. I. Stetsyuk, Andreas Fischer

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Modeling Language for Mathematical Programming
• Nondifferentiable optimization and polynomial problems
• Algorithms of nondifferentiable optimization: development and application
• Shor's \(r\)-algorithms: theory and practice
• Theory and software implementations of Shor's \(r\)-algorithms
• Robust energy cost optimization of water distribution system with uncertain demand

Cited In (1)

• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation

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)