Optimal Solution of Multi-Choice Mathematical Programming Problem Using a New Technique

HTML  XML Download Download as PDF (Size: 278KB)  PP. 167-172  
DOI: 10.4236/ajor.2016.62019    4,769 Downloads   7,337 Views  Citations

ABSTRACT

The study deals with the multi-choice mathematical programming problem, where the right hand side of the constraints is multi-choice in nature. However, the problem of multi-choice linear programming cannot be solved directly by standard linear or nonlinear programming techniques. The aim of this paper is to transform such problems to a standard mathematical linear programming problem. For each constraint, exactly one parameter value is selected out of a multiple number of parameter values. This process of selection can be established in different ways. In this paper, we present a new simple technique enabling us to handle such problem as a mixed integer linear programming problem and consequently solve them by using standard linear programming software. Our main aim depends on inserting a specific number of binary variables and using them to construct a linear combination which gives just one parameter among the multiple choice values for each choice of the values of the binary variables. A numerical example is presented to illustrate our analysis.

Share and Cite:

Khalil, T. , Raghav, Y. and Badra, N. (2016) Optimal Solution of Multi-Choice Mathematical Programming Problem Using a New Technique. American Journal of Operations Research, 6, 167-172. doi: 10.4236/ajor.2016.62019.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.