The infinite-dimensional linear programming problems and their approximationIn this chapter primal and dual abstract
linear programming problems are considered
Single-projection procedure for linear optimizationSingle-projection procedure for
linear optimization
The infinite-dimensional linear programming problems and their approximationIn this chapter primal and dual abstract
linear programming problems are considered
Application of linear programming in budgeting costs for the compensation of employees of budgeting the expenditures using
linear programming. Recommended are calculations and measures to control
Immobile indices in linear Semi-infinite and Copositive Programming Qualifications (CQs). A
linear problem of Copositive
Programming consists in minimization of a
linear function
Development of methods for solving the tasks of the continium linear programming using Legendre polynomials of
linear programming. It demonstrates a technique for solving problems with the use of orthogonal systems
Optimization of perishable goods delivery in supply chains with random demand. If these goods are divisible, then the model is formalized as a
linear programming problem. In this case
On strong duality in linear semidefinite and copositive programming -hard problems.
Given a
linear copositive
prog-ramming problem, we derive for it a new extended dual
Application of linear programming in budgeting costs for the compensation of employees of budgeting the expenditures using
linear programming. Recommended are calculations and measures to control
Nonadditive robust ordinal regression with nonadditivity index and multiple goal linear programming nonadditivity index as well as multiple-goal
linear programming, where the former is used to replace