Ordinal optimization with subset selection rule

DOI10.1023/A:1015317022797zbMATH Open1015.90076OpenAlexW1485347502MaRDI QIDQ700726FDOQ700726

Authors: D. Kharzeev 

Publication date: 8 October 2002

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

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

Recommendations

• scientific article; zbMATH DE number 1060043
• Comparison of selection rules for ordinal optimization
• Ordinal Optimization
• Vector ordinal optimization
• Ordinal optimisation and simulation

zbMATH Keywords

ordinal optimizationgoal softening

Mathematics Subject Classification ID

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

Cites Work

• Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
• Ordinal optimization of DEDS
• Universal alignment probabilities and subset selection for ordinal optimization
• An ordinal optimization approach to optimal control problems
• Ordinal optimization approach to rare event probability problems
• Title not available (Why is that?)
• On the numerical solutions of stochastic optimization problem
• Explanation of goal softening in ordinal optimization

Cited In (4)

• An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem
• Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty
• Subset Selection with Additional Order Information
• Using ordinal optimization approach to improve efficiency of selection procedures

This page was built for publication: Ordinal optimization with subset selection rule

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