Universal alignment probabilities and subset selection for ordinal optimization

DOI10.1023/A:1022614327007zbMath0873.90076OpenAlexW1554780162MaRDI QIDQ1357520

T. W. Edward Lau, Yu-Chi Ho

Publication date: 10 June 1997

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

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

zbMATH Keywords

ordinal optimizationalignmentordered performance curvesubset selection procedure

Mathematics Subject Classification ID

Nonlinear programming (90C30) Stochastic programming (90C15)

Related Items (16)

An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem ⋮ Constrained ordinal optimization -- a feasibility model based approach ⋮ An ordinal optimization theory-based algorithm for large distributed power systems ⋮ Quantifying heuristics in the ordinal optimization framework ⋮ Universal alignment probability revisited ⋮ Universal alignment probability revisited ⋮ Multi-objective ordinal optimization for simulation optimization problems ⋮ Comparison of selection rules for ordinal optimization ⋮ The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems ⋮ Ordinal optimization with subset selection rule ⋮ A soft approach for hard continuous optimization ⋮ Vector ordinal optimization ⋮ Simulation optimization: a review of algorithms and applications ⋮ Constraint ordinal optimization ⋮ Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline ⋮ An explanation of ordinal optimization: Soft computing for hard problems

Cites Work

• Using a standard clock technique for efficient simulation
• Ordinal optimization of DEDS
• Easily searched encodings for number partitioning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal alignment probabilities and subset selection for ordinal optimization