Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the ...

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier ...

We analyze a sequential decision making process, in which at each step the decision is made in two stages. In the rst stage a partially optimal action is chosen, which allows the decision maker to learn how to improve it ...

‎We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces‎. ‎Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of ...

‎We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals‎. ‎Contrary to classical models‎, ‎where parameters can attain any value from the interval ...