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

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

Journal: :iranian journal of optimization 2010
g.r. jahanshahloo m.r mozaffari z. sobhan

in this paper, the cost and income efficiency models have been considered with regard to the multiple objective programming structures. for finding the efficient points in purposed molp problem, some various methods like lexicography & the weighted sum can be used. so by introducing the molp problem the cost & income efficiencies will be achieved. in the present study, the molp problem ...

Journal: :International Journal of Engineering, Science and Technology 2011

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

Journal: :Filomat 2022

In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.

Journal: :Computers 2021

The problem of scheduling is an area that has attracted a lot attention from researchers for many years. Its goal to optimize resources in the system. lecturer’s assigning task example timetabling problem, class scheduling. This study introduces mathematical model assign constrained tasks (the time and required skills) university lecturers. Our capable generating calendar maximizes faculty expe...

Journal: :American Journal of Operations Research 2022

In this paper, a cubic objective programming problem (COPP) is defined. Introduced new modification to solve problem. Suggested an algorithm for its solution. Also reported the of usual simplex method. Application talks about how developed can be used unravel non-linear. The proposed technique, with constructed numerical examples illustrative problems are given demonstrate algorithms.

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...

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

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