نتایج جستجو برای: inverse linear programming

تعداد نتایج: 846615  

In the today’s world wherein every routine is based on economic factors, there is no doubt that theoretical sciences are driven by their capabilities and affordances in terms of economy. As a mathematical tool, data envelopment analysis (DEA) is provided to economics, so that one can investigate associated costs, prices and revenues of economic units. Data Envelopment Analysis (DEA) is a linear...

2007
S. Kindermann A. Leitão

We investigate continuous regularization methods for linear inverse problems of static and dynamic type. These methods are based on dynamic programming approaches for linear quadratic optimal control problems. We prove regularization properties and also obtain rates of convergence for our methods. A numerical example concerning a dynamical electrical impedance tomography (EIT) problem is used t...

Journal: :Computers & Mathematics with Applications 1999

Journal: :Bulletin of Mathematical Statistics 1976

Journal: :Journal of Mathematical Analysis and Applications 1975

In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.

2012
Nikolaos Ploskas Nikolaos Samaras Jason Papathanasiou

Linear Programming is a significant and well-studied optimization methodology. Simplex type algorithms have been widely used in Decision Support Systems. The computation of the basis inverse is a crucial step in simplex type algorithms. In this paper, we review and compare three basis update methods. We incorporate these methods on the exterior and the revised simplex algorithm in order to high...

Journal: :biquarterly journal of control and optimization in applied mathematics 2015
aminalah alba

jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید