On the iterative process
On the mathematical aspects of an urban retail model
On the minimum cost multiple-source unsplittable flow problem
The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions and...
On the minimum dummy-arc problem
On the minimum time problem in linear discrete systems with the discrete set of admissible controls
On the monotone upper bound problem.
On the Morávek and Vlach conditions for the existence of a solution to the multi-index problem
On the nonlinear implicit complementarity problem.
On the Numerical Analysis of the Von Karman Equations : Mixed Finite Element Approximation and Continuation Techniques.
On the numerical solution of bound constrained optimization problems
On the numerical solution of implicit two-point boundary-value problems
On the open mapping principle and convex multivalued mappings
On the optimal control of single-stage hybrid manufacturing systems via novel and different variants of particle swarm optimization algorithm.
On the optimum rational function connected with the ADI-method
On the Pallet Loading Problem
On the penalty approximation of quadratic programming problem
On the performance of the particle swarm optimization algorithm with various inertia weight variants for computing optimal control of a class of hybrid systems.
On the problems of computer-assisted treament choice
On the Properties of Linear Programming models for National Planning
On the quadratic fractional optimization with a strictly convex quadratic constraint
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...