A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming.

Angelos Tsoukalas Berç Rustem

Published in: Optim. Lett. (2011)

Keyphrases

cost function
learning algorithm
dynamic programming
search space
np hard
simulated annealing
objective function
search algorithm
optimal solution
probabilistic model
worst case
mathematical model
fixed point
knapsack problem
heuristic methods