A review of deterministic optimization methods in engineering and management
From MaRDI portal
Summary: With the increasing reliance on modeling optimization problems in practical applications, a number of theoretical and algorithmic contributions of optimization have been proposed. The approaches developed for treating optimization problems can be classified into deterministic and heuristic. This paper aims to introduce recent advances in deterministic methods for solving signomial programming problems and mixed-integer nonlinear programming problems. A number of important applications in engineering and management are also reviewed to reveal the usefulness of the optimization methods.
Recommendations
- A review of recent advances in global optimization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Some recent developments in deterministic global optimization
- Recent developments and trends in global optimization
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A constrained nonlinear 0-1 program for data allocation
- A global optimization algorithm for the three-dimensional packing problem
- A minimax portfolio selection rule with linear programming solution
- A mixed-integer optimization framework for the synthesis and analysis of regulatory networks
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A polyhedral branch-and-cut approach to global optimization
- A review of recent advances in global optimization
- A tutorial on geometric programming
- An analytical model for the container loading problem
- An application of nonlinear optimization in molecular biology
- An efficient global approach for posynomial geometric programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Analysis of bounds for multilinear functions
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Canonical Cuts on the Unit Hypercube
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convex envelopes for edge-concave functions
- Convex envelopes of monomials of odd degree
- Convex extensions and envelopes of lower semi-continuous functions
- Convex relaxation for solving posynomial programs
- Convex underestimation for posynomial functions of positive variables
- Convex underestimation strategies for signomial functions
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Duality Theory for Geometric Programming
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Finding all solutions of nonlinearly constrained systems of equations
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Generalized Benders decomposition
- Generalized convexity and vector optimization
- Geometric programming with signomials
- Geometric Programming: Methods, Computations and Applications
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization in engineering design
- Global optimization of 0-1 hyperbolic programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Global optimization. Scientific and engineering case studies
- Global solution of optimization problems with signomial parts
- Handbook of generalized convexity and generalized monotonicity
- Handbook of global optimization. Vol. 2
- High performance algorithms and software in nonlinear optimization. Conference, HPSNO 97, Ischia, Italy, June 1997
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 2068068 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- scientific article; zbMATH DE number 1440902 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Invexity and optimization
- Linearizing Geometric Programs
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- On generalized geometric programming problems with non-positive variables
- On optimization approach for multidisk vertical allocation problems
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Principles of Optimal Design
- Product disaggregation in global optimization and relaxations of rational programs
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Solving mixed integer nonlinear programs by outer approximation
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Some transformation techniques in global optimization
- Some transformation techniques with applications in global optimization
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Treating free variables in generalized geometric global optimization programs
- Trigonometric convex underestimator for the base functions in Fourier space
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(3)
This page was built for publication: A review of deterministic optimization methods in engineering and management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955154)
