Explanation of goal softening in ordinal optimization

DOI10.1109/9.739080zbMath0957.90100OpenAlexW2111827031MaRDI QIDQ4506654

T. W. Edward Lau, Loo Hay Lee, Yu-Chi Ho

Publication date: 17 October 2000

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.739080

zbMATH Keywords

ordinal optimizationstochastic optimizationorder statisticsselection algorithmsalignment probability

Mathematics Subject Classification ID

Stochastic programming (90C15) Optimal stochastic control (93E20)

Related Items (15)

Selecting a Good Stochastic System for the Large Number of Alternatives ⋮ Particle swarm optimization for function optimization in noisy environment ⋮ An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem ⋮ Constrained ordinal optimization -- a feasibility model based approach ⋮ Designing spectral sensitivity curves for use with Artificial Color ⋮ Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Multi-objective ordinal optimization for simulation optimization problems ⋮ The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems ⋮ Ordinal optimization with subset selection rule ⋮ A new approach to discrete stochastic optimization problems ⋮ A soft approach for hard continuous optimization ⋮ A general framework on the simulation-based optimization under fixed computing budget ⋮ Constraint ordinal optimization ⋮ An explanation of ordinal optimization: Soft computing for hard problems ⋮ A probabilistic solution-generator for simulation

This page was built for publication: Explanation of goal softening in ordinal optimization