A review of deterministic optimization methods in engineering and management

DOI10.1155/2012/756023zbMath1264.90002WikidataQ58911770 ScholiaQ58911770MaRDI QIDQ1955154

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

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C30: Nonlinear programming

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Global optimization of signomial geometric programming problems, An enhanced logarithmic method for signomial programming with discrete variables

Uses Software

• GGPECP
• APOGEE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
• Handbook of generalized convexity and generalized monotonicity
• Treating free variables in generalized geometric global optimization programs
• Solving planning and design problems in the process industry using mixed integer and global optimization
• Global optimization. Scientific and engineering case studies
• A review of recent advances in global optimization
• On generalized geometric programming problems with non-positive variables
• Global solution of optimization problems with signomial parts
• Invexity and optimization
• Convex underestimation for posynomial functions of positive variables
• Generalized convexity and vector optimization
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables
• A tutorial on geometric programming
• Some transformation techniques with applications in global optimization
• A mixed-integer optimization framework for the synthesis and analysis of regulatory networks
• An analytical model for the container loading problem
• Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
• A constrained nonlinear 0-1 program for data allocation
• High performance algorithms and software in nonlinear optimization. Conference, HPSNO 97, Ischia, Italy, June 1997
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
• Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
• Convex extensions and envelopes of lower semi-continuous functions
• Convex envelopes of monomials of odd degree
• A global optimization algorithm for the three-dimensional packing problem
• An application of nonlinear optimization in molecular biology
• Handbook of global optimization. Vol. 2
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• On optimization approach for multidisk vertical allocation problems
• Trigonometric convex underestimator for the base functions in Fourier space
• Convex envelopes for edge-concave functions
• A polyhedral branch-and-cut approach to global optimization
• Global optimization of 0-1 hyperbolic programs
• Approximately global optimization for assortment problems using piecewise linearization techniques
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Product disaggregation in global optimization and relaxations of rational programs
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Finding all solutions of nonlinearly constrained systems of equations
• State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
• A branch-and-cut method for 0-1 mixed convex programming
• Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
• Finding multiple optimal solutions of signomial discrete programming problems with free variables
• Generalized Benders decomposition
• Geometric programming with signomials
• Global optimization in engineering design
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Convex relaxation for solving posynomial programs
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• A Minimax Portfolio Selection Rule with Linear Programming Solution
• An Efficient Global Approach for Posynomial Geometric Programming Problems
• Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
• Convex underestimation strategies for signomial functions
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Geometric Programming: Methods, Computations and Applications
• Principles of Optimal Design
• Duality Theory for Geometric Programming
• Linearizing Geometric Programs
• Canonical Cuts on the Unit Hypercube
• Analysis of bounds for multilinear functions
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Semidefinite relaxations of fractional programs via novel convexification techniques