This paper aims to find efficient solutions a multi-objective optimization problem (MP) with convex polynomial data. To this end, hybrid method, which allows us transform into scalar \(({\mathrm{P}}_{z})\) and does not destroy the properties of convexity, is considered. First, we show an existence result for under some mild assumption. Then, \((P_{z})\), establish two kinds representations non-...

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

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.

recently, lotfi et al. [10] established an equivalence model between the output-oriented dual ccr model and multiple objective linear programming (molp) and used an interactive method for finding target unit on efficiency frontier such that the decision maker preferences can be taken into account. however their method is not applicable for situations in which some outputs are undesirable and ne...

in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...