scientific article; zbMATH DE number 3819468

MaRDI QIDQ3666602zbMATH OpenFDO

Authors Frank Plastria

Publication date 1982

zbMATH Keywords

computational resultsconstraint droppingKelley's cutting plane algorithmlinearly constrained case

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited in

(5)

• Solving general continuous single facility location problems by cutting planes
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Generalized fractional programming and cutting plane algorithms
• Lower subdifferentiable functions and their minimization by cutting planes
• Fractional programming by lower subdifferentiability techniques

This page was built for publication:

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