Polyhedral annexation, dualization and dimension reduction technique in global optimization

DOI10.1007/BF00119933zbMath0752.90077MaRDI QIDQ1200635

Hoang Tuy

Publication date: 16 January 1993

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

zbMATH Keywords

global optimizationconcave minimizationdimension reductionnonconvex optimizationdualizationpolyhedral annexationlinearly constrained quasiconcave minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION ⋮ A d.c. optimization method for single facility location problems ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ An efficient solution method for rank two quasiconcave minimization problems ⋮ Solving a class of multiplicative programs with 0-1 knapsack constraints ⋮ The complementary convex structure in global optimization ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ A generalized duality and applications ⋮ Polyhedral annexation, dualization and dimension reduction technique in global optimization ⋮ A global optimization approach for the linear two-level program ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming

Cites Work

• On a class of quadratic programs
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• On nonconvex optimization problems with separated nonconvex variables
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Linear multiplicative programming
• Generalized linear multiplicative and fractional programming
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyhedral annexation, dualization and dimension reduction technique in global optimization