Inexact general multi-objective linear programming problem and its application to portfolio optimization

Nath, Jayanti, Chhatri, Sanjoy, Bhattacharya, Debasish
OPSEARCH · Springer Nature · 2026-10-27 · DOI: 10.1007/s12597-026-01313-9

Abstract

This paper presents an inexact general multi-objective linear programming problem and its solution procedure. The coefficients and variables involved in the problem are inexact numbers. The method combines the existing general multi-objective linear programming and interval programming techniques. The model is thus constructed by utilizing linear programming and enabling uncertainty to appear in the coefficients of the objectives and constraints as intervals under the optimization structure. The proposed method of solution elicits an optimal solution with the highest number of objectives attaining their ideal values. The solution is also presented in inexact form. The solution procedure of the proposed technique has been illustrated with the help of a multi-objective portfolio selection problem with both maximizing and minimizing types of objectives.

Read at publisher →

Similar articles