A review of deterministic optimization methods in engineering and management
DOI10.1155/2012/756023zbMATH Open1264.90002OpenAlexW2120113688WikidataQ58911770 ScholiaQ58911770MaRDI QIDQ1955154FDOQ1955154
Ming-Hua Lin, Chian-Son Yu, Jung-Fa Tsai
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/756023
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Solving mixed integer nonlinear programs by outer approximation
- Convex extensions and envelopes of lower semi-continuous functions
- Handbook of global optimization. Vol. 2
- A polyhedral branch-and-cut approach to global optimization
- A branch-and-cut method for 0-1 mixed convex programming
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Canonical Cuts on the Unit Hypercube
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Finding all solutions of nonlinearly constrained systems of equations
- A review of recent advances in global optimization
- Invexity and optimization
- A tutorial on geometric programming
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Geometric programming with signomials
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Handbook of generalized convexity and generalized monotonicity
- Generalized convexity and vector optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- A minimax portfolio selection rule with linear programming solution
- An efficient global approach for posynomial geometric programming problems
- Convex underestimation strategies for signomial functions
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- On generalized geometric programming problems with non-positive variables
- Global solution of optimization problems with signomial parts
- Convex envelopes of monomials of odd degree
- Convex envelopes for edge-concave functions
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving planning and design problems in the process industry using mixed integer and global optimization
- An analytical model for the container loading problem
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Linearizing Geometric Programs
- Analysis of bounds for multilinear functions
- Treating free variables in generalized geometric global optimization programs
- Product disaggregation in global optimization and relaxations of rational programs
- Global optimization. Scientific and engineering case studies
- State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
- Convex underestimation for posynomial functions of positive variables
- Principles of Optimal Design
- Duality Theory for Geometric Programming
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Convex relaxation for solving posynomial programs
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- Approximately global optimization for assortment problems using piecewise linearization techniques
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Geometric Programming: Methods, Computations and Applications
- A constrained nonlinear 0-1 program for data allocation
- Global optimization of 0-1 hyperbolic programs
- A global optimization algorithm for the three-dimensional packing problem
- A mixed-integer optimization framework for the synthesis and analysis of regulatory networks
- An application of nonlinear optimization in molecular biology
- Global optimization in engineering design
- Trigonometric convex underestimator for the base functions in Fourier space
- High performance algorithms and software in nonlinear optimization. Conference, HPSNO 97, Ischia, Italy, June 1997
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- On optimization approach for multidisk vertical allocation problems
Cited In (2)
Uses Software
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)