نتایج جستجو برای linear optimization

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

Ahmad Kahrobaian, Hamid Reza Malekmohammadi,

A new method of optimization on linear parabolic solar collectors using exergy analysis is presented. A comprehensive mathematical modeling of thermal and optical performance is simulated and geometrical and thermodynamic parameters were assumed as optimization variables. By applying a derived expression for exergy efficiency, exergy losses were generated and the optimum design and operating co...

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...

2012
R. Parvathi, C. Malathi,

A new concept to the optimization problem in an intuitionistic fuzzy environment is introduced. A general model, of linear programming problems in which both the right hand side constants and the technological coefficients are intuitionistic fuzzy numbers, has been presented. An attempt has been made to find a general linear non-membership function and intuitionistic fuzzy index together with t...

2016
S. Dempe, G. Luo, S. Franke,

In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...

2016
Egon Balas, Matteo Fischetti,

An amazing variety of activities and situations can be adequately modeled as linear optimization problems, also known as linear programs (LPs), or convex nonlinear optimization problems. Adequately means that the degree of approximation to reality that such a representation involves is acceptable. However, as the world that we inhabit is neither linear nor convex, the most common obstacle to th...

C. Lucas, F. Tootoonchian, Z. Nasiri-Gheidari,

In this paper a brushless permanent magnet motor is designed considering minimum thrust ripple and maximum thrust density (the ratio of the thrust to permanent magnet volumes). Particle Swarm Optimization (PSO) is used as optimization method. Finite element analysis (FEA) is carried out base on the optimized and conventional geometric dimensions of the motor. The results of the FEA deal to ...

Journal: :iranian journal of science and technology (sciences) 2006
s. ketabi,

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

2013
Jonathan Turner,

Here, C denotes a column vector of cost coefficients, X a column vector of variables, A = [ai,j ] is a coefficient matrix, B is a column vector representing the bounds in the inequalities and the multiplication operation is matrix multiplication. Linear programs arise in a wide range of applications and can be solved efficiently. The classical simplex algorithm has been very successful in pract...

2014
Jacob D. Abernethy, Chansoo Lee, Abhinav Sinha, Ambuj Tewari,

We present a new optimization-theoretic approach to analyzing Follow-the-Leader style algorithms, particularly in the setting where perturbations are used as a tool for regularization. We show that adding a strongly convex penalty function to the decision rule and adding stochastic perturbations to data correspond to deterministic and stochastic smoothing operations, respectively. We establish ...

2017

Now, let us consider the case ofK = Kb with b ∈ (1,∞). For v ∈ R andQ ⊆ [d], let vQ denote the 6 projection of v to those dimensions inQ. Then for any v ∈ R, and any w ∈ Kb withQ = {i : wi 6= 7 0}, we know by Hölder’s inequality that 〈w,v〉 = 〈wQ,vQ〉 ≥ −‖w‖b · ‖vQ‖a , for a = b/(b− 1). 8 Moreover, one can have 〈wQ,vQ〉 = −‖w‖b · ‖vQ‖a , when |wi| /‖w‖b = |vi|/‖v‖a and 9 wivi ≤ 0 for every i ∈ Q. ...

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

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