scientific article; zbMATH DE number 1016946
The book belongs to the field of stochastic programming that arose in the fifties and sixties. Namely, at this time it was recognised that the random character of some parameters in optimization models cannot be neglected. As a result of this fact a new field of mathematical programming theory, called ``stochastic programming, arose and has developed rather quickly as an independent part of mathematical programming. The monograph under review is devoted to special types of stochastic programming problems. In particular it is devoted to the problems with probability and quantile objective. It is known that (under rather general assumptions) the corresponding objective functions are close to each other. Both authors are specialists in the above mentioned directions of stochastic programming. The book is divided into 4 chapter. Examples of applications leading to the investigated types of stochastic problems are (mainly) introduced in chapter one. In the second chapter we can find the necessary mathematical tools for the investigation of the problems. Mathematical properties of the problems are investigated there. We can find (in this chapter) not only the investigation of the convexity and continuity but also existence conditions for differentiability of the objective functionals. Moreover, the forms of gradient vectors are presented. The case when the underlying probability measure is unknown is investigated in chapter 3. To this end kernel estimates, bounds of probability as well as properties of quasi-convex functions are recalled. The last chapter is devoted to the methods and algorithms for solving the problems. The relationship between the solutions of the two investigated problems can also be found in this chapter. The chapters are completed by individual lists of references According to the knowledge of the reviewer this is the first monograph dealing completely with these special types of stochastic programming problems.
- Fundamentals of the linearization method for quantile analysis with small random parameters
- Convexity properties of probability and quantile functions in optimization problems
- Bilateral estimation of the Bellman function in the problems of optimal stochastic control of discrete systems by the probabilistic performance criterion
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- Convergence conditions for the observed mean method in stochastic programming
- Convex properties of the quantile function in stochastic programming
- Approximation and contamination bounds for probabilistic programs
- Optimization of the quantile criterion for the convex loss function by a stochastic quasigradient algorithm
- Sufficient conditions for quasiconcavity of the probability function
- Two-stage problem of quantile optimization of an investment project
- Sample approximations of bilevel stochastic programming problems with probabilistic and quantile criteria
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters
- Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion
- Refined estimation of the Bellman function for stochastic optimal control problems with probabilistic performance criterion
- General properties of two-stage stochastic programming problems with probabilistic criteria
- Minimax estimation by probabilistic criterion
- Quantile criterion-based control of the securities portfolio with a nonzero ruin probability
- Variable neighborhood search for stochastic linear programming problem with quantile criterion
- Deterministic equivalents for the problems of stochastic programming with probabilistic criteria
- Parallelization of the quantile function optimization algorithms
- A two-step capital variation model: optimization by different statistical criteria
- Thin and heavy tails in stochastic programming
- Risk aversion in two-stage stochastic integer programming
- Stochastic problem of competitive location of facilities with quantile criterion
- Problems in stochastic programming with probabilistic criteria
- On convex parameterization of robust control design for minimizing (conditional) performance at risk
- On the equivalence in stochastic programming with probability and quantile objectives
- A numerical method for two-stage stochastic programs under uncertainty
- On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- Approximation of the quantile minimization problem with decision rules
- Application of the smooth approximation of the probability function in some applied stochastic programming problems
- Problem Statement for Preparing a Single Batch of End Product Under Uncertainty
- An inner-outer approximation approach to chance constrained optimization
- On stochastic linear programming problems with the quantile criterion
- Computation of some stochastic linear programming problems with Cauchy and extreme value distributions
- Smooth Approximation of the Quantile Function Derivatives
- Safety-first portfolio selection
- Optimal retention of the trajectories of a discrete-time stochastic system in a tube: one problem statement
- Distributionally robust optimization by probability criterion for estimating a bounded signal
- Parametric algorithm for finding a guaranteed solution to a quantile optimization problem
- An algorithm to solve a quantile optimization problem with loss function having a separable structure, and its application to an aerospace problem
- Choosing a strategy based on the maximin quantile criterion in a game of a company with several groups of clients
- Analysis and comparisons of some solution concepts for stochastic programming problems
- Portfolio reshaping under 1st-order stochastic dominance constraints by the exact penalty function methods
- Optimization of the area of a takeoff and landing runway
- Construction of confidence absorbing set for analysis of static stochastic systems
- Solution to a two-step logistics problem in a quintile statement
- Comparison of the quantile and guaranteeing approaches to system analysis
- Optimization of the quantile function on the basis of kernel estimates
- Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization
- Application of the bootstrap method for estimation of the quantile function
- Minimax nature of the linear estimates of the indefinite stochastic vector from the generalized probabilistic criteria
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339054)