On network flow equations and splitting formulas for sojourn times in queueing networks.
On Newton's polygons, Gröbner bases and series expansions of perturbed polynomial programs
In this note we consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter ε. Recently, the theory of Gröbner bases was used to show that solutions of the system of first order optimality conditions can be represented as Puiseux series in ε in a neighbourhood of ε = 0. In this paper we show that the determination of the branching order and the order of the pole (if...
On nonlinear variational inequalities.
On Nonnegative Solutions of Random Systems of Linear Inequalities.
On non-normal asymptotic behavior of optimal solutions for stochastic programming problems and on related problems of mathematical statistics
On numerical solution of a variational inequality of the 4th order by finite element method
The problem of a thin elastic plate, deflection of which is limited below by a rigid obstacle is solved. Using Ahlin's and Ari-Adini's elements on rectangles, the convergence is established and SOR method with constraints is proposed for numerical solution.
On numerical solution of optimal control problems with nonsmooth objectives: Application to economic models
On optimal replacement policy
A system with a single activated unit which can be in states is considered. Inspections of the system are carried out at discrete time instants. The process of deterioration of the unit is supposed to be Markovian. The unit by its operation brings an income which is monotonically dependent on its state. A replacement of the unit is associated with certain costs. The paper gives an effective algorithm for finding the replacement strategy maximizing the average income of the system per unit time....
On optimal route planning evading cubes in the three space.
On optimizing a maximin nonlinear function subject to replicated quasi-arborescence-like constraints.
In this paper we present the motivation for using the Truncated Newton method in an algorithm that maximises a non-linear function with additional maximin-like arguments subject to a network-like linear system of constraints. The special structure of the network (so-termed replicated quasi-arborescence) allows to introduce the new concept of independent superbasic sets and, then, using second-order information about the objective function without too much computer effort and storage.
On Orthogonal Linear ...1 Approximation.
On parameters of an evaluation function for heuristic search as a path problem
On polyhedral games
On precision of stochastic optimization based on estimates from censored data
In the framework of a stochastic optimization problem, it is assumed that the stochastic characteristics of optimized system are estimated from randomly right-censored data. Such a case is frequently encountered in time-to-event or lifetime studies. The analysis of precision of such a solution is based on corresponding theoretical properties of estimated stochastic characteristics. The main concern is to show consistency of optimal solution even in the random censoring case. Behavior of solutions...
On primal-dual stability in convex optimization.
On properties of solutions for two functional equations arising in dynamic programming.
On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P 0 and Q 0.
On robustness of set-valued maps and marginal value functions
The ideas of robust sets, robust functions and robustness of general set-valued maps were introduced by Chew and Zheng [7,26], and further developed by Shi, Zheng, Zhuang [18,19,20], Phú, Hoffmann and Hichert [8,9,10,17] to weaken up the semi-continuity requirements of certain global optimization algorithms. The robust analysis, along with the measure theory, has well served as the basis for the integral global optimization method (IGOM) (Chew and Zheng [7]). Hence, we have attempted to extend the...
On robustness of the regularity property of maps
On Rohn's relative sensitivity coefficient of the optimal value for a linear-fractional program
In this note we consider a linear-fractional programming problem with equality linear constraints. Following Rohn, we define a generalized relative sensitivity coefficient measuring the sensitivity of the optimal value for a linear program and a linear-fractional minimization problem with respect to the perturbations in the problem data. By using an extension of Rohn's result for the linear programming case, we obtain, via Charnes-Cooper variable change, the relative sensitivity coefficient for...