Developing Systems

A primal and a dual minimal feasible methods for solving the general linear programming problem

R. Gabasov, F. M. Kirillova

Minsk

Abstract: A new definition of a minimal feasible solution is used to obtain analogs of conventional algorithms for solution of a general linear programming problem. In this approach the data on the available solutions to the direct and dual problems are used. The algorithms make it possible to construct suboptimal solutions with a specified accuracy on the knowledge of the objective function.

UDC: 62-50


Received: 03.06.1976

 English version: Automation and Remote Control, 1977, 38:6, 845–854

Bibliographic databases:

• 
•