Models and solution techniques for production planning problems with increasing byproducts

DOI10.1007/S10898-014-0167-1MaRDI QIDQ2250099zbMATH OpenOpenAlexFDO

Authors Srikrishna Sridhar, Jeffrey T. Linderoth, James Luedtke

Publication date 4 July 2014

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-014-0167-1

zbMATH Keywords

mixed integer nonlinear programmingpiecewise linear approximationproduction planning

Mathematics Subject Classification ID

Production models (90B30) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Recommendations

• Formulation for a fixed-charge, separable nonlinear production planning problem
• scientific article; zbMATH DE number 2084779
• A stochastic production planning problem with nonlinear cost
• Production Planning by Mixed Integer Programming
• OPTIMIZING CHEMICAL PLANT OPERATION BY MIXED INTEGER PROGRAMMING

Cites work

• A composite algorithm for a concave-cost network flow problem
• Adaptively refined dynamic program for linear spline regression
• Branching and bounds tighteningtechniques for non-convex MINLP
• Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Global optimization using special ordered sets
• Locally ideal formulations for piecewise linear functions with indicator variables
• Location, scheduling, design and integer programming
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Nonconvex, lower semicontinuous piecewise linear optimization
• Objective function approximations in mathematical programming
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• On the Solution of Discrete Programming Problems
• Polyhedral methods for piecewise-linear functions. I: The lambda method
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• The convergence rate of the sandwich algorithm for approximating convex functions
• Using Piecewise Linear Functions for Solving MINLPs

Cited in

(5)

• A single-item lot-sizing problem with a by-product and inventory capacities
• Towards circular economy in production planning: challenges and opportunities
• Optimistic optimization for continuous nonconvex piecewise affine functions
• Formulation for a fixed-charge, separable nonlinear production planning problem
• Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems

This page was built for publication: Models and solution techniques for production planning problems with increasing byproducts

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