Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint

DOI10.1007/BF02190124zbMath0866.90110MaRDI QIDQ2564166

János Fülöp

Publication date: 7 January 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-boundlinear constraintspenalty methodsconcave functionLagrangian dualityadditional facial reverse convex constraint

Mathematics Subject Classification ID

Related Items (5)

ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ Penalty parameter for linearly constrained 0--1 quadratic programming ⋮ Deriving the properties of linear bilevel programming via a penalty function approach ⋮ Technical efficiency and distance to a reverse convex set ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of a quasi-concave function over an efficient set
• On the global minimization of concave functions
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Constrained global optimization: algorithms and applications
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• Lagrangean duality for facial programs with applications to integer and complementarity problems
• A global optimization approach for the linear two-level program
• A penalty function approach for solving bi-level linear programs
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Optimizing a linear function over an efficient set
• Bilevel linear programming
• Penalty for zero–one integer equivalent problem
• Methods for Global Concave Minimization: A Bibliographic Survey
• A finite cutting plane method for facial disjunctive programs
• Disjunctive Programming
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex Analysis
• Optimization over the efficient set

This page was built for publication: Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint