✦ LIBER ✦

New Closedness Results for Efficient Sets in Multiple Objective Mathematical Programming

✍ Scribed by Harold P. Benson; Erjiang Sun

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 140 KB
Volume: 238
Category: Article
ISSN: 0022-247X
DOI: 10.1006/jmaa.1999.6541

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructing the set of efficient object

Constructing the set of efficient objective values in multiple objective linear programs

✍ J.P. Dauer; O.A. Saleh 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 545 KB

A representation of an efficiency equiva

A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program

✍ Richard J. Gallagher; Ossama A. Saleh 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 561 KB

An algorithm based on facial decompositi

An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

✍ Serpil Sayin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Using Lexicographic Parametric Programmi

Using Lexicographic Parametric Programming for Searching a Non-dominated Set in Multiple-Objective Linear Programming

✍ Pekka Korhonen; Merja Halme 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the