A bi-level linear programming problem for computing the nadir point in MOLP

Authors

  • H. Dehghani M.Sc Graduate, Department of Applied Mathematics, University of Tabriz, Tabriz, Iran
  • J. Vakili 1Assistant Professor, Department of Applied Mathematics, University of Tabriz, Tabriz, Iran
Abstract:

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a convex set which is a convex optimization problem‎, ‎but the problem of computing ‎the nadir point in MOLP is equivalent to solving a nonconvex optimization‎problem whose solving is very hard in the general case‎. ‎‎In this paper‎, ‎a bi-level linear programming problem is presented for obtaining the nadirpoint in MOLP problems which can be used in general to optimize a ‎linear function on the nondominated set‎, ‎as well‎. Then‎, ‎as one of the solution methods of this problem‎, ‎a‎mixed-integer linear programming problem is presented which obtains ‎the exact nadir values in one stage‎.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Method for Nadir Point Estimation in MOLP Problems

It is proposed to use two points of support when estimating the nadir vector components in Multiobjective Linear Programming (MOLP) problems: to consider the frontier of the feasible set S and to use the reference point method. The proposed approach gives upper bounds of the estimated values.

full text

A Nadir Compromise Programming for Supplier Selection Problem under Uncertainty

Supplier selection is one of the influential decisions for effectiveness of purchasing and manufacturing policies under competitive conditions of the market. Regarding the fact that decision makers (DMs) consider conflicting criteria for selecting suppliers, multiple-criteria programming is a promising approach to solve the problem. This paper develops a nadir compromise programming (NCP) model...

full text

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

full text

TOPSIS approach to linear fractional bi-level MODM problem based on fuzzy goal programming

The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...

full text

A bi-level mathematical programming for cell formation problem considering workers’ interest

Nowadays, the necessity of manufacturers’ response to their customers’ needs and their fields of activities have extended widely. The cellular manufacturing systems have adopted reduced costs from mass-production systems and high flexibility from job-shop manufacturing systems, and therefore, they are very popular in modern manufacturing environments. Manufacturing systems, in addit...

full text

Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach

In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 7

pages  31- 42

publication date 2016-12-10

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023