Linear fractional programming
NettetThis research article aims to study a multi-objective linear fractional programming (FMOLFP) problem having fuzzy random coefficients as well as fuzzy pseudorandom decision variables. Initially, the FMOLFP model is converted to a single objective fuzzy linear programming (FLP) model. Nettet27. jan. 2024 · Sharma, V.: Multi-objective integer non-linear fractional programming problem: a cutting plane approach. OPSEARCH 49, 133–153 (2012) Article MathSciNet Google Scholar Oz, E., Alp, S., Guzel, N.: An alternative solution to multi objective linear fractional programming problem by using geometric programming technique.
Linear fractional programming
Did you know?
NettetIndex Terms—Fractional programming (FP), quadratic trans-form, power control, beamforming, energy efficiency I. OVERVIEW OPTIMIZATION is a key aspect of communication sys-tem design [3], [4]. This two-part work explores the application of fractional programming (FP) in the design and optimization of communication … Nettet13. jan. 2024 · Kornbluth JS, Steuer RE (1981) Multiple objective linear fractional programming. Manage Sci 27(9):1024–1039. Article Google Scholar Kumar P, Dutta D (2015) Multi-objective linear fractional inventory model of multi-products with price-dependent demand rate in fuzzy environment. Int J Math Oper Res 7(5):547–565.
NettetIn linear-fractional programming, the goal is to determine a per- missible allocation of resources that will maximize or minimize some specific showing, such as profit gained per unit of cost, or cost of unit of product produced, etc. Strictly speaking, linear-fractional programming is a special case of the broader field of Mathematical Programming. Nettet1. feb. 2024 · , An iterative method for solving linear fractional programming (LFP) problem with sensitivity analysis, Mathematical and Computational Mathematics 13 (2008) 147 – 151. Google Scholar; Tantawy, 2008 Tantawy S.F., A new procedure for solving linear fractional programming problems, Mathematical and Computer Modelling 48 …
Nettet13. jun. 2024 · Linear fractional programming. The general form of linear fractional programming is as following: (1) (2) Where, A represents matrix with m row vectors and n column vectors; B and x represent the column vectors with n and m elements, respectively; C and D represent the row vector with n elements, respectively; and α and β means … Nettetfor 1 dag siden · This paper proposes a multi-objective linear fractional transportation problem (MOLFTP) with uncertain programming. The fractional transportation problem considers situations where decision-makers are interested in maximizing or minimizing the ratio of certain...
Nettet1. des. 2011 · Section snippets Linear fractional programming. A general linear fractional programming (LFP) problem can be formulated as follows: Max f (X) = CX + α DX + β subject to AX ⩽ B X ⩾ 0 where A is a real m × n matrix; X and B are column vectors with n and m components respectively; C and D are row vectors with n …
Nettet10. nov. 2024 · For the minimization of the sum of linear fractions on polyhedra, it is likewise a class of linear fractional programming (LFP). In this paper, we mainly propose a new linear relaxation technique and combine the branch-and-bound algorithm framework to solve the LFP globally. It is worthwhile to mention that the branching operation of the … tapestry pillow covers mother brideBoth linear programming and linear-fractional programming represent optimization problems using linear equations and linear inequalities, which for each problem-instance define a feasible set. Fractional linear programs have a richer set of objective functions. Informally, linear programming computes a … Se mer In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear program is a linear function, the objective function in a linear … Se mer Let the dual variables associated with the constraints $${\displaystyle A\mathbf {y} -\mathbf {b} t\leq \mathbf {0} }$$ and $${\displaystyle \mathbf {d} ^{T}\mathbf {y} +\beta t-1=0}$$ be … Se mer • Bajalinov, E. B. (2003). Linear-Fractional Programming: Theory, Methods, Applications and Software. Boston: Kluwer Academic Publishers. • Barros, Ana Isabel (1998). Discrete and … Se mer Under the assumption that the feasible region is non-empty and bounded, the Charnes-Cooper transformation translates the linear-fractional program above to the equivalent linear program: Se mer The objective function in a linear-fractional problem is both quasiconcave and quasiconvex (hence quasilinear) with a monotone Se mer 1. ^ Charnes, A.; Cooper, W. W. (1962). "Programming with Linear Fractional Functionals". Naval Research Logistics Quarterly. 9 (3–4): … Se mer • WinGULF – educational interactive linear and linear-fractional programming solver with a lot of special options (pivoting, pricing, branching variables, etc.) • JOptimizer – Java … Se mer tapestry picturesNettetMixed Integer Programming Basics. The problems most commonly solved by the Gurobi Parallel Mixed Integer Programming solver are of the form: Objective: minimize c T x. Constraints: A x = b (linear constraints) l ≤ x ≤ u (bound constraints) some or all xj must take integer values (integrality constraints) tapestry pillow shamsNettet1. feb. 2024 · Introduction. Linear fractional programming (LFP) problems are of great interest because of their extensive application areas such as resource allocation, … tapestry pictures for saletapestry pillowNettet1. jun. 2016 · The fuzzy linear fractional programming problem is an important planning tool in different areas such as engineering, business, finance, and economics. In this … tapestry photographsNettetIn mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.. For example, in a 0–1 … tapestry pillows belgium