Zagazig University Digital Repository
Home
Thesis & Publications
All Contents
Publications
Thesis
Graduation Projects
Research Area
Research Area Reports
Search by Research Area
Universities Thesis
ACADEMIC Links
ACADEMIC RESEARCH
Zagazig University Authors
Africa Research Statistics
Google Scholar
Research Gate
Researcher ID
CrossRef
ON sensitiuity analysis of large scale multiobjectiue programming problems with an application in water resources management
Faculty
Engineering
Year:
1988
Type of Publication:
Theses
Pages:
171
Authors:
Aly Kamel El Ariny Hammad
BibID
10423800
Keywords :
Water resources management
Abstract:
The ultimate goal- of this work is to i nt roduce new approaches for tack linglarge scale multiobjective decision making (LS-MOOM) proble~s in the nonl inearcase J and the related sensit ivity and s t cb i I ity analysis J then to apply theavailable results in treating an underground water resources managementproblem as a LS-MOOM problem.The choice of underground water aquifer management problems as theapplication area in t his work i 3 made due tot he i ncreas i ngimportance J in our country nowadays) of developing new techniques foref fie i ent exp I 0 i tat ion 0 f underground lOot er r-esour-cee . , wh i ch can p I ay therole of a ”Second Riuer Nile” compensation for the current decr-euse in thewater level of the original river Hi le.This dissertation is organized in SIX cha~ters and four appendices.Chapter one is devoted to a ”state of the art- survey on the recentapproaches in treat i ng mu I t i ob j ect i ve dec i s i on mak i ng (MOOn) prob I ems. Inchapter two a step-by-step approach is adopted to deve I op a I got i t hns fortreating large scale multiobjective convex programming problems. This is doney first developing an algorithm J denoted by LSU,lT f or- so lv i nq lar-ge scc l econvex programming problems. Then the LSUMT algorithm is integrated; togetherith J an introduced mixed decompos i t ion coor d i not i on approach fat’ 30 I ~J i nglor-qe scale convex programming problems J and an i t er-ut i ve oppr-ouch fop gOI]1l’ogrolJJming; in the fr·ame of an algorithm for solving l or qe scale convex goalrogramming (LS-CGP) problems. Two versions of computer packages namelySUt1T.Ul and LSUMT.U2 are deue l oped as an implementat ion of LSUrn algor·ithmnd a package named LSGP is part i Q 11 Y deve I aped as an i np I ement at i on for thentroduced algorithm for solving LS-CGP problems.In chapter three the st cb i I ity of goal pr’ogt’on’lliing problem solutions isiscussed in relation to goal priority changes imposed by the decision maker.algorithm based on the obtained re eu l t s ” is i nt r oduced. Pr oqr oa MAin ofe we I I-known SUMT non I i neat’ programm i ng (Hl.P) package i 3 subs t it ut ed byot her MA I H J and the neu package J denot ed t~LGP J is used to so I ve qener c Inlinear goal programming (GP) problems using the iet’oti\.le approach.Chapter four i 3 ded i coted fat’ the sene i t i ~Ji ty ana I ys i s 0 f l cr qe sea I envex goo I pr-ogr-amm i ng pr ob I ems. The d i SCllSS i on is based on three groups 0 fsuits. The f i r st group is r-e l ct ed to some sens i t i v i t q results for nonl i necr
PDF
جامعة المنصورة
جامعة الاسكندرية
جامعة القاهرة
جامعة سوهاج
جامعة الفيوم
جامعة بنها
جامعة دمياط
جامعة بورسعيد
جامعة حلوان
جامعة السويس
شراقوة
جامعة المنيا
جامعة دمنهور
جامعة المنوفية
جامعة أسوان
جامعة جنوب الوادى
جامعة قناة السويس
جامعة عين شمس
جامعة أسيوط
جامعة كفر الشيخ
جامعة السادات
جامعة طنطا
جامعة بنى سويف