Solving partially integer-valued optimization problems which are convex relative to a continuous variable

DOI10.1007/BF01068783MaRDI QIDQ3942754zbMATH OpenFDO

Authors V. A. Roshchin, N. V. Semenova, I. V. Sergienko

Publication date 1981

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068783

zbMATH Keywords

approximate algorithmsapproximate solutionBenders' decompositionexact solutionexistence of optimal solutionextension of Benders' methodpartially convex problempartially integer-valued optimization problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Fractional programming (90C32)

Cites work

• scientific article; zbMATH DE number 3679539 (Why is no real title available?)
• Partitioning procedures for solving mixed-variables programming problems

Cited in

(1)

• Sequential approach to the solution of mixed linear programs

This page was built for publication: Solving partially integer-valued optimization problems which are convex relative to a continuous variable

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