Different transformations for solving non-convex trim-loss problems by MINLP
From MaRDI portal
Publication:1291782
DOI10.1016/S0377-2217(97)00066-0zbMath0955.90095OpenAlexW1970686413WikidataQ127442499 ScholiaQ127442499MaRDI QIDQ1291782
Hans Skrifvars, Ray Pörn, Iiro Harjunkoski, Tapio Westerlund
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00066-0
Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Linear programming (90C05)
Related Items
Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, A disjunctive cut strengthening technique for convex MINLP, Global Optimization of Mixed-Integer Signomial Programming Problems, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, A review of recent advances in global optimization, An algorithm for the determination of optimal cutting patterns, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Extended Formulations in Mixed-Integer Convex Programming, Alternative configurations for cutting machines in a tube cutting mill, Mixed integer nonlinear programming tools: an updated practical overview, LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization, On solving generalized convex MINLP problems using supporting hyperplane techniques, A recipe for finding good solutions to MINLPs, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Facets of a mixed-integer bilinear covering set with bounds on variables, Inexact solution of NLP subproblems in MINLP, Lift-and-project cuts for convex mixed integer nonlinear programs, Domain reduction techniques for global NLP and MINLP optimization, An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming, A new model for complete solutions to one-dimensional cutting stock problems., On the facet defining inequalities of the mixed-integer bilinear covering set, Global solution of optimization problems with signomial parts, Trim loss optimization by an improved differential evolution, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, An algorithmic framework for convex mixed integer nonlinear programs, Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Polyhedral approximation in mixed-integer convex optimization, Preface, Mixed Integer Linear Programming Formulation Techniques, The stochastic trim-loss problem, Mixed integer nonlinear programming tools: a practical overview, Nonlinear chance-constrained problems with applications to hydro scheduling
Cites Work
- Unnamed Item
- The trim-loss and assortment problems: A survey
- An LP-based approach to cutting stock problems with multiple objectives
- Generalized Benders decomposition
- An Automatic Method of Solving Discrete Programming Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
