Loading [MathJax]/jax/output/SVG/config.js
Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2014, Issue 5, Pages 67–82 (Mi at9094)  
This article is cited in 1 scientific paper (total in 1 paper)

Stochastic Systems, Queuing Systems

On reduction of the two-stage problem of quantile optimization to the problem of convex programming

A. I. Kibzuna, O. M. Khromova

a Moscow State Aviation Institute, Moscow, Russia
Full-text PDF (250 kB) Citations (1)
References:
PDF
HTML
Abstract: Consideration was given to the two-stage problem of stochastic programming with a quantile criterion. The case of bilinear loss function which is linear separately in the normally distributed random factors and the strategies was studied. An algorithm was proposed based on solving the parametric problem of convex programming with the scalar parameter selected with the use of the dichotomy method. The solution proved to be guaranteeing for the original problem. An example was discussed.
Presented by the member of Editorial Board: A. V. Nazin

Received: 29.11.2013
English version:
Automation and Remote Control, 2014, Volume 75, Issue 5, Pages 859–871
DOI: https://doi.org/10.1134/S0005117914050051
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. I. Kibzun, O. M. Khromova, “On reduction of the two-stage problem of quantile optimization to the problem of convex programming”, Avtomat. i Telemekh., 2014, no. 5, 67–82; Autom. Remote Control, 75:5 (2014), 859–871
Citation in format AMSBIB
\Bibitem{KibKhr14}
\by A.~I.~Kibzun, O.~M.~Khromova
\paper On reduction of the two-stage problem of quantile optimization to the problem of convex programming
\jour Avtomat. i Telemekh.
\yr 2014
\issue 5
\pages 67--82
\mathnet{http://mi.mathnet.ru/at9094}
\transl
\jour Autom. Remote Control
\yr 2014
\vol 75
\issue 5
\pages 859--871
\crossref{https://doi.org/10.1134/S0005117914050051}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000335955000005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84901255791}
Linking options:
  • https://www.mathnet.ru/eng/at9094
  • https://www.mathnet.ru/eng/at/y2014/i5/p67
    • This publication is cited in the following 1 articles:
    1. Kibzun A., “Comparison of Two Algorithms For Solving a Two-Stage Bilinear Stochastic Programming Problem With Quantile Criterion”, Appl. Stoch. Models. Bus. Ind., 31:6 (2015), 862–874  crossref  mathscinet  isi  scopus
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:369
    Full-text PDF :67
    References:70
    First page:38
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025