نتایج جستجو برای: separable programming problem

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

Journal: :IMA Journal of Management Mathematics 2010

Journal: :Math. Program. 2005
Ivo Nowak

e-mail: [email protected] Abstract. The purpose of this paper is threefold. First we propose splitting schemes for reformulating non-separable problems as block-separable problems. Second we show that the Lagrangian dual of a block-separable mixed-integer all-quadratic program (MIQQP) can be formulated as an eigenvalue optimization problem keeping the block-separable structure. Finall...

2001
LARS KADISON

In Secion 1 we describe what is known of the extent to which a separable extension of unital associative rings is a Frobenius extension. A problem of this kind is suggested by asking if three algebraic axioms for finite Jones index subfactors are dependent. In Section 2 the problem in the title is formulated in terms of separable bimodules. In Section 3 we specialize the problem to ring extensi...

Journal: :iranian journal of fuzzy systems 2013
maryam zangiabadi hamid reza maleki

the linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. this paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. in this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

Journal: :American Journal of Operations Research 2017

Journal: :Journal of the Operations Research Society of Japan 2019

2010
Warren B. Powell David Egan

As the electric transmission system in the U.S. ages, mitigating the risk of high-voltage transformer failures becomes an increasingly important issue for transmission owners and operators. This paper introduces a model that supports these efforts by optimizing the acquisition and the deployment of high-voltage transformers dynamically over time. We formulate the problem as a Markov Decision Pr...

Journal: :J. Global Optimization 2008
János Fülöp

In several methods of multiattribute decision making, pairwise comparison matrices are applied to derive implicit weights for a given set of decision alternatives. A class of the approaches is based on the approximation of the pairwise comparison matrix by a consistent matrix. In the paper this approximation problem is considered in the least-squares sense. In general, the problem is nonconvex ...

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

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