Поиск

Автор

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

Тип статьи

DOI

ORCID

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

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

Репозиторий

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

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

In this chapter primal and dual abstract linear programming problems are considered

Single-projection procedure for linear optimization

In this chapter primal and dual abstract linear programming problems are considered

of budgeting the expenditures using linear programming. Recommended are calculations and measures to control

Qualifications (CQs). A linear problem of Copositive Programming consists in minimization of a linear function

of linear programming. It demonstrates a technique for solving problems with the use of orthogonal systems

. If these goods are divisible, then the model is formalized as a linear programming problem. In this case

-hard problems. Given a linear copositive prog-ramming problem, we derive for it a new extended dual

of budgeting the expenditures using linear programming. Recommended are calculations and measures to control

nonadditivity index as well as multiple-goal linear programming, where the former is used to replace

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