A mathematical programming problem with a convex irregular feasible set

DOI10.1016/0041-5553(90)90203-5MaRDI QIDQ3363071zbMATH OpenOpenAlexFDO

Authors V. N. Nefedov

Publication date 1990

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(90)90203-5

zbMATH Keywords

dimensional reductionconvex constraintsregularity conditionsapproximate method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited in

(1)

• Irreducible infeasible sets in convex mixed-integer programs

This page was built for publication: A mathematical programming problem with a convex irregular feasible set

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