A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationOutlook and further possible improvements
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: Outlook and...
Rocktäschel, Stefan
2020-01-22 00:00:00
[In this Chapter, we discuss an extension of the proposed algorithm to the nonconvex case. Therefore, we introduce the concept of convex underestimators. As we have seen in Example 2.13, the assumption of convexity of f and g for (MOMICP) in Assumption 2.9 can be very restricting.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-branch-and-bound-algorithm-for-multiobjective-mixed-integer-convex-kjViKla7YT
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationOutlook and further possible improvements
[In this Chapter, we discuss an extension of the proposed algorithm to the nonconvex case. Therefore, we introduce the concept of convex underestimators. As we have seen in Example 2.13, the assumption of convexity of f and g for (MOMICP) in Assumption 2.9 can be very restricting.]
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.