Search In this Thesis
   Search In this Thesis  
العنوان
On bicriterion mathematical programming problems
المؤلف
Nahed Mohammed Anwar Hassan Ibrahim.
تاريخ النشر
2002 .
عدد الصفحات
65 p.
الفهرس
Only 14 pages are availabe for public view

from 75

from 75

Abstract

The process of decision making is important when dealing with real life problems where several conflicting objectives are involved

Vector optimization problems VOP’ for multi objective optimization problems represent one main branch of mathematical programming. This branch is interesting because of its wide applications possibilities

Solving vector optimization problems is the main part of the decision making process. It involves finding a set of efficient (nondominated , noninferior or Pareto-optimum) solutions. Then, the decision can be made by presenting these solutions to the DM to select the best one according to some criteria related to the objective functions

In practice, when formulating the multi objective mathematical programming problem that closely describes and represents the real decision situation, the decision-maker may describe the objective functions and the constraints in this problem with some vaguness. This vagueness can be efficiently interpreted through fuzzy set concepts.