On the Properties of Linear Programming models for National Planning
In this paper, we have studied the problem of minimizing the ratio of two indefinite quadratic functions subject to a strictly convex quadratic constraint. First utilizing the relationship between fractional and parametric programming problems due to Dinkelbach, we reformulate the fractional problem as a univariate equation. To find the root of the univariate equation, the generalized Newton method is utilized that requires solving a nonconvex quadratic optimization problem at each iteration. A...
A multi-server -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.
For a family of maps , d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.
This paper investigates bipolar max-min equations which can be viewed as a generalization of fuzzy relational equations with max-min composition. The relation between the consistency of bipolar max-min equations and the classical boolean satisfiability problem is revealed. Consequently, it is shown that the problem of determining whether a system of bipolar max-min equations is consistent or not is NP-complete. Moreover, a consistent system of bipolar max-min equations, as well as its solution set,...
We investigate diverse separation properties of two convex polyhedral sets for the case when there are parameters in one row of the constraint matrix. In particular, we deal with the existence, description and stability properties of the separating hyperplanes of such convex polyhedral sets. We present several examples carried out on PC. We are also interested in supporting separation (separating hyperplanes support both the convex polyhedral sets at given faces) and permanent separation (a hyperplane...