THEOREMS OF ALTERNATIVE AND FEASIBILITY/INFEASIBILITY IN MATHEMATICAL PROGRAMMING

UBI, EVALD and UBI, JAAN (2016) THEOREMS OF ALTERNATIVE AND FEASIBILITY/INFEASIBILITY IN MATHEMATICAL PROGRAMMING. Asian Journal of Mathematics and Computer Research, 12 (4). pp. 133-242.

Full text not available from this repository.

Abstract

In this review paper we consider the conditions of solvability of extremal problems with linear constraints. These are derived from the classical theorems of the alternative. In addition we look at nding the initial solution of a linear programming problem and a new version of the artificial basis method, as well as solving least-squares problems and quadratic programming problems. The main ideas are explained by simple examples.

Item Type: Article
Subjects: Euro Archives > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 11 Dec 2023 03:45
Last Modified: 11 Dec 2023 03:45
URI: http://publish7promo.com/id/eprint/4201

Actions (login required)

View Item
View Item