Abstract We consider a bilevel continuous knapsack problem where the leader controls capacity of knapsack, while follower chooses feasible packing maximizing his own profit. The leader’s aim is to optimize linear objective function in and follower’s solution, but with respect different item values. address stochastic version this profits are uncertain from perspective, only probability distribu...

In this work we study a routing and scheduling problem for home care business. The is composed of two conflicting objectives, therefore it as bi-objective one. We obtain the Pareto frontier small size instances using AUGMECON2 method and, bigger cases, developed an heuristic algorithm. also obtained some preliminary results that show algorithm has good behaviour.

Abstract During past few decades, fuzzy decision is an important attention in the areas of science, engineering, economic system, business, etc. To solve day-to-day problem, researchers use data transportation problem for presenting uncontrollable factors; and most multi-objective problems are solved using goal programming. However, when contains interval-valued data, then obtained solution was...