Reverse convex problems: an approach based on optimality conditions

DOI10.1155/JAMDS/2006/29023zbMath1147.90383MaRDI QIDQ868408

Ider Tseveendorj

Publication date: 5 March 2007

Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129296

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Duality and optimality conditions for reverse convex programs via a convex decomposition

Cites Work

• Reverse convex programming
• Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
• Global optimality conditions for nonconvex optimization
• Global optimization and multi knapsack: a percolation algorithm.
• Characterization of local solutions for a class of nonconvex programs
• Piecewise-convex maximization problems: algorithm and computational experiments
• Introduction to global optimization
• Extremal problems on complements of convex sets
• Canonical DC programming problem: Outer approximation methods revisited
• Methods of embedding-cutting off in problems of mathematical programming
• Computational experience using an edge search algorithm for linear reverse convex programs
• The Validity of a Family of Optimization Methods
• Convex analysis and global optimization
• A new approach to optimization under monotonic constraint
• Duality for anticonvex programs.
• An approach to the solution of integer optimization problems
• Piecewise-convex maximization problems.

This page was built for publication: Reverse convex problems: an approach based on optimality conditions