Testing the \({\mathfrak R}\)-strategy for a reverse convex problem

DOI10.1023/A:1008260227877zbMath0908.90244OpenAlexW1584752067MaRDI QIDQ1265183

Alexander S. Strekalovsky, Ider Tseveendorj

Publication date: 27 September 1998

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

Full work available at URL: https://doi.org/10.1023/a:1008260227877

zbMATH Keywords

global searchglobal optimality conditionsreverse-convex problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (6)

Reverse convex problems: an approach based on optimality conditions ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Global optimization and multi knapsack: a percolation algorithm. ⋮ Solving DC programs using the cutting angle method ⋮ Outer approximation algorithms for canonical DC problems ⋮ Piecewise convex maximization approach to multiknapsack

This page was built for publication: Testing the \({\mathfrak R}\)-strategy for a reverse convex problem