Construction of test problems for concave minimization under linear and nonlinear constraints

DOI10.1023/A:1022636914306zbMath0908.90211OpenAlexW164412929MaRDI QIDQ1265043

Khosrow Moshirvaziri

Publication date: 28 February 1999

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

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

zbMATH Keywords

global optimizationconcave minimizationlinear programmingcomputational experimentsnonconvex optimizationnonlinear programmingtest problemsreverse convex programs

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization, Test problem construction for linear bilevel programming problems

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Convex programs with an additional reverse convex constraint
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• A new technique for generating quadratic programming test problems
• A generalization of the construction of test problems for nonconvex optimization
• Construction of test problems for a class of reverse convex programs
• Test problem construction for linear bilevel programming problems
• Construction of large-scale global minimum concave quadratic test problems
• Computational experience using an edge search algorithm for linear reverse convex programs
• Generation of large-scale quadratic programs for use as global optimization test problems
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Methods for Global Concave Minimization: A Bibliographic Survey
• Global minimum test problem construction