Different transformations for solving non-convex trim-loss problems by MINLP

DOI10.1016/S0377-2217(97)00066-0zbMATH Open0955.90095OpenAlexW1970686413WikidataQ127442499 ScholiaQ127442499MaRDI QIDQ1291782FDOQ1291782

Authors: Iiro Harjunkoski, Ray Pörn, Hans Skrifvars, 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

Recommendations

• Solving a two-dimensional trim-loss with MILP
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• Trim loss optimization by an improved differential evolution
• Solving nonlinear mixed integer stochastic problems: a global perspective

zbMATH Keywords

optimizationinteger linear programmingmixed integer nonlinear programmingtrim-loss problems

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Integer programming (90C10) Mixed integer programming (90C11)

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• Title not available (Why is that?)
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Generalized Benders decomposition
• Solving Large-Scale Zero-One Linear Programming Problems
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• The trim-loss and assortment problems: A survey
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• An LP-based approach to cutting stock problems with multiple objectives

Cited In (36)

• Mixed integer nonlinear programming tools: a practical overview
• Polyhedral approximation in mixed-integer convex optimization
• On the facet defining inequalities of the mixed-integer bilinear covering set
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• Nonlinear chance-constrained problems with applications to hydro scheduling
• Lift-and-project cuts for convex mixed integer nonlinear programs
• An algorithmic framework for convex mixed integer nonlinear programs
• Alternative configurations for cutting machines in a tube cutting mill
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
• A review of recent advances in global optimization
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• A new model for complete solutions to one-dimensional cutting stock problems.
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
• Preface
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
• Global solution of optimization problems with signomial parts
• A disjunctive cut strengthening technique for convex MINLP
• The stochastic trim-loss problem
• Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
• Mixed integer linear programming formulation techniques
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A recipe for finding good solutions to MINLPs
• Extended formulations in mixed-integer convex programming
• On solving generalized convex MINLP problems using supporting hyperplane techniques
• Trim loss optimization by an improved differential evolution
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• Global optimization of mixed-integer signomial programming problems
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• Facets of a mixed-integer bilinear covering set with bounds on variables
• An algorithm for the determination of optimal cutting patterns
• Domain reduction techniques for global NLP and MINLP optimization
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
• Mixed integer nonlinear programming tools: an updated practical overview
• Inexact solution of NLP subproblems in MINLP

This page was built for publication: Different transformations for solving non-convex trim-loss problems by MINLP

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