Testing the R-strategy for a reverse convex problem

DOI10.1023/A:1008260227877MaRDI QIDQ1265183zbMATH OpenOpenAlexFDO

Authors A. S. Strekalovskiĭ, 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 optimality conditionsglobal searchreverse-convex problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• On convergence of a global search strategy for reverse convex problems
• Reverse convex problems: an approach based on optimality conditions
• scientific article; zbMATH DE number 686916
• Global optimization for special reverse convex programming
• On a local search for reverse convex problems

Cited in

(13)

• Construction of test problems for a class of reverse convex programs
• Global optimization and multi knapsack: a percolation algorithm.
• A new necessary and sufficient global optimality condition for canonical DC problems
• Outer approximation algorithms for canonical DC problems
• Extended reverse-convex programming: an approximate enumeration approach to global optimization
• Reverse convex programs: stability and global optimality
• Piecewise convex maximization approach to multiknapsack
• scientific article; zbMATH DE number 686916 (Why is no real title available?)
• Solving DC programs using the cutting angle method
• On a local search for reverse convex problems
• Reverse convex problems: an approach based on optimality conditions
• Global optimization for special reverse convex programming
• On convergence of a global search strategy for reverse convex problems

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

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