Abstract
The author, in this unorthodox paper, discusses come actual problems of theory and methods of linear programming. He defines a compound matrix as a common property to all cases ofmatrix games: games theory. input-output analysis, theory of statistical decision and others; namely, mathematical programming. He uses the weak inequality as superior to the equality. He explains the classifications of elements of activity ma'rix as constants, random variables and statistics. He shows a nonparametric interval solution, instead of usual deterministic point solution, for one class of maximum mixture problems, when the data are «statistics». He proves that it is bounded and only two solutions are needed. He introduces a confidence interval solution if some data are only estimates, which obey the Poisson law. A numerical example as a demonstration of this technique and a survey of useful references are added.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
