General Mathematics


Bi-level Linear Programming Problem with Neutrosophic Numbers

Authors: Surapati Pramanik, Partha Pratim Dey

The paper presents a novel strategy for solving bi-level linear programming problem based on goal programming in neutrosophic numbers environment. Bi-level linear programming problem comprises of two levels namely upper or first level and lower or second level with one objective at each level. The objective function of each level decision maker and the system constraints are considered as linear functions with neutrosophic numbers of the form [p + q I], where p, q are real numbers and I represents indeterminacy.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2018-09-12 03:02:12

Unique-IP document downloads: 19 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus