Enumerative techniques for solving some nonconvex global optimization problems

DOI10.1007/BF01720032MaRDI QIDQ1102205zbMATH OpenFDO

Authors Panos M. Pardalos

Publication date 1988

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01720032

zbMATH Keywords

concave cost network flowenumeration of extreme pointslinear complementaritynonconvex minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 757675
• On the global minimization of concave functions
• scientific article; zbMATH DE number 1163103
• Stability of convex programs under a distributed constraint qualification
• Convex Programming Methods for Global Optimization

Cites work

• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Adjacent extreme flows and application to min concave cost flow problems
• An algorithm for a class of nonlinear fractional problems using ranking of the vertices
• An algorithm for determining all extreme points of a convex polytope
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for the min concave cost flow problem
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
• An implicit enumeration procedure for the general linear complementarity problem
• Computational results on an algorithm for finding all vertices of a polytope
• Concave minimization over a convex polyhedron
• Decomposed enumeration of extreme points in the linear programming problem
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Hard Enumeration Problems in Geometry and Combinatorics
• scientific article; zbMATH DE number 3837777 (Why is no real title available?)
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3733756 (Why is no real title available?)
• scientific article; zbMATH DE number 3557508 (Why is no real title available?)
• Methods for Global Concave Minimization: A Bibliographic Survey
• Minimum Concave Cost Flows in Certain Networks
• Nonlinear cost network models in transportation analysis
• On the application of parallel architectures to a class of operations research problems
• Pivoting rules and redundancy schemes in extreme point enumeration
• Ranking of vertices in the linear fractional programming problem
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Vertex Enumeration Methods

Cited in

(10)

• Global search algorithms for minimum concave-cost network flow problems
• Generalized bilinear programming: An application in farm management
• Nonlinear integer programming by Darwin and Boltzmann mixed strategy
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• An implicit enumeration method for global optimization problems
• Eigenvalue techniques for convex objective, nonconvex optimization problems
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• Generalized algorithm for summing the enumerators of suboptimal solutions
• Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: Enumerative techniques for solving some nonconvex global optimization problems

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