Solving multi‐choice linear programming problems by interpolating polynomials

Solving multi‐choice linear programming problems by interpolating polynomials

0.00 Avg rating0 Votes
Article ID: iaor20116294
Volume: 54
Issue: 5-6
Start Page Number: 1405
End Page Number: 1412
Publication Date: Sep 2011
Journal: Mathematical and Computer Modelling
Authors: ,
Keywords: programming: multiple criteria, programming: nonlinear
Abstract:

Multi‐choice programming solves some optimization problems where multiple information exists for a parameter. The aim of this paper is to select an appropriate parameter from a set of multiple choices, which optimizes the objective function. We consider a linear programming problem where the right hand side parameters are multi‐choice in nature. In this paper, the multiple choices of a parameter are considered as functional values of an affine function at some non‐negative integer nodes. An interpolating polynomial is formulated using functional values at non‐negative integer nodes to take care of any multi‐choice parameter. After establishing interpolating polynomials of all multi‐choice parameters, a mathematical programming problem is formulated. The formulated problem is treated as a nonlinear programming problem involving mixed integer type variables. It can be solved by using standard nonlinear programming software. Finally, a numerical example is presented to illustrate the solution procedure.

Reviews

Required fields are marked *. Your email address will not be published.