An algorithm to solve a quantile optimization problem with loss function having a separable structure, and its application to an aerospace problem

DOI10.1002/asmb.2475MaRDI QIDQ6574632

Sergey V. Ivanov, A. S. Stepanova, A. I. Kibzun

Publication date: 18 July 2024

Published in: Applied Stochastic Models in Business and Industry (Search for Journal in Brave)

zbMATH Keywords

variable neighborhood searchsample average approximationquantile objectiverunway

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of the area of a takeoff and landing runway
• Sample average approximation method for chance constrained programming: Theory and applications
• Variable neighborhood search
• On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
• Chance-Constrained Programming
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• Deterministic Solutions for a Class of Chance-Constrained Programming Problems
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Concavity and efficient points of discrete distributions in probabilistic programming.
• A simulated annealing approach for reliability-based chance-constrained programming

This page was built for publication: An algorithm to solve a quantile optimization problem with loss function having a separable structure, and its application to an aerospace problem