Поиск

Автор

Ключевое слово

Тип статьи

DOI

ORCID

Дополнительно:

Период публикации

Репозиторий

По вашему запросу найдено документов: 25546

Страница 18 из 2555

supply chain a challenge. The commonly used optimization techniques based on linear programming require a

-point methods for linear optimization (LO) problem. We define a new proximity function for (LO) by a new kernel

–Hilbert vector problem and linear ODEs, for the n-dimensional homogeneous linear conjugation problem on a simple

solutions for a homogeneous linear conjugation problem for a three-dimensional vector. We show that

Linearly-quadratic mappings of finite-dimensional linear spaces over reals are considered. A

problems of fractional-linear conjugation. The main result of the paper is the following one: known two

The problem of constructing n-linear (n 2) plane vector elds with isolated critical point and given

of constructing an iterative point is a linear programming problem, in which constraints are polyhedrons

linear programming problem independently of the type of functions which define the solving problem

technologies (EXCEL, Mathematica) are discussed. The example of 2 variants of linear (4-factor) multiple

Страница 18 из 2555