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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA) S. 1 - 3
1. Verfasser:	Erokhin, Vladimir
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2017
Schlagworte:	Electronic mail Linear programming Matrices Media Optimization Seminars
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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