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

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

B. Farhadinia

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

Journal: :international journal of mathematical modelling and computations 0
ghasem tohidi department of mathematics, islamic azad university, central tehran branch, iran iran, islamic republic of shabnam razavyan

this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

Journal: :Optimization Letters 2009
Andrew J. Schaefer

We consider the integer programming version of inverse optimization. Using superadditive duality, we provide a polyhedral description of the set of inversefeasible objectives. We then describe two algorithmic approaches for solving the inverse integer programming problem.

Journal: :Numerical Functional Analysis and Optimization 2021

In this paper we consider new regularization methods for linear inverse problems of dynamic type. These are based on programming techniques quadratic optimal control problems. Two different approaches followed: a continuous and discrete one. We prove properties also obtain rates convergence the derived from both approaches. A numerical example concerning EIT problem is used to illustrate theore...

Journal: :Math. Program. 2013
Paul Armand Joël Benoist

This short communication analyses a boundedness property of the inverse of a Jacobian matrix that arises in regularized primal-dual interior-point methods for linear and nonlinear programming. This result should be a useful tool for the convergence analysis of these kinds of methods.

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

Journal: :iranian journal of optimization 2010
a. mahmoodi rad r. dehghan f. hosseinzadeh lotfi

in this paper, we show that inverse data envelopment analysis (dea) models can be used to estimate output with fuzzy data for a decision making unit (dmu) when some or all inputs are increased and deficiency level of the unit remains unchanged.

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

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