scientific article; zbMATH DE number 895009

DOI10.1002/(SICI)1520-6750(199606)43:4%3C503::AID-NAV4%3E3.0.CO;2-BMaRDI QIDQ4883167zbMATH OpenFDO

Authors Meltem Denizel, S. Selcuk Erenguc, Hanif D. Sherali

Publication date 6 November 1996

Full work available at URL https://doi.org/10.1002/(SICI)1520-6750(199606)43:4%3C503::AID-NAV4%3E3.0.CO;2-B

zbMATH Keywords

convex envelopenonconvex fixed-charge functions

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Recommendations

• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• Extended formulations for convex envelopes
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Convex envelopes generated from finitely many compact convex sets
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems

Cited in

(6)

• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand

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 Q4883167)