A stable solution of linear programming problems with the approximate matrix of coefficients

A.N. Tikhonov's approximate system of linear algebraic equations solution approach is extended to find a stable solution of a linear programming problem with an approximation of the coefficient matrix. This approach is formalized as the special case of a linear programming problem. Necessary an...

Full description

Saved in:

Bibliographic Details
Published in:	2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA) pp. 1 - 3
Main Author:	Erokhin, Vladimir
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2017
Subjects:	Electronic mail Linear programming Matrices Media Optimization Seminars
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	A.N. Tikhonov's approximate system of linear algebraic equations solution approach is extended to find a stable solution of a linear programming problem with an approximation of the coefficient matrix. This approach is formalized as the special case of a linear programming problem. Necessary and sufficient conditions for the existence of the solution of specified problem and the form of this solution are studied. Numerical example of the improper linear programming problem with an approximation of the coefficient matrix solution is shown.
DOI:	10.1109/CNSA.2017.7973953