Solving multi-choice linear programming problems by interpolating polynomials

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

Full description

Saved in:
Bibliographic Details
Published in:Mathematical and computer modelling Vol. 54; no. 5; pp. 1405 - 1412
Main Authors: Biswal, M.P., Acharya, S.
Format: Journal Article
Language:English
Published: Kidlington Elsevier Ltd 01.09.2011
Elsevier
Subjects:
ISSN:0895-7177, 1872-9479
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2011.04.009