Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "lexicographic optimization" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Telecommunications network design and max-min optimization problem
Autorzy:
Ogryczak, W.
Pióro, M.
Tomaszewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/309010.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
resource allocation
fairness
lexicographic optimization
lexicographic max-min
Opis:
Telecommunications networks are facing increasing demand for Internet services. Therefore, the problem of telecommunications network design with the objective to maximize service data flows and provide fair treatment of all services is very up-to-date. In this application, the so-called max-min fair (MMF) solution concept is widely used to formulate the resource allocation scheme. It assumes that the worst service performance is maximized and the solution is additionally regularized with the lexicographic maximization of the second worst performance, the third one, etc. In this paper we discuss solution algorithms for MMF problems related to telecommunications network design. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model (mathematical programme). However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with basic design problems but fails if practical discrete restrictions commonly arriving in telecommunications network design are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 43-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Conflict Management in University Examination Timetabling Problem: A case study of summer school mid-terms
Autorzy:
Bayar, Mustafa Mehmet
Uzun Bayar, Irmak
Powiązania:
https://bibliotekanauki.pl/articles/14147915.pdf
Data publikacji:
2020-09-20
Wydawca:
Wyższa Szkoła Bankowa we Wrocławiu
Tematy:
examination timetabling
group decision making
lexicographic optimization
linear mixed integer programming
Opis:
Abstract: Aim: This study is on tackling Examination Timetabling Problem (ETP) of the Faculty of Economics And Administrative Sciences (FEAS) of the Ankara HBV University summer school, where the courses of fall and spring semesters are offered simultaneously and regulations on restricting enrollments in inter-department electives or in-department courses of distinct years are relaxed. Thus, the complexity of the nature of the ETP problem is exacerbated. The direct heuristics based on successive assignments that the university normally adopts was proven inadequate for assuming standard regulations hence, another approach we explain in this paper was needed. Design / Research methods: The ETP was formulated as a Linear Mixed-Integer Program (LMIP) and decomposed into three stages; timetabling exams, room assignment, student allocation. To manage the conflict between the stakeholders of the examination procedure, a lexicographic optimization process based on the priority of the parties was undertaken. Conclusions / findings: After a recursive timetabling process based on a trial-and-error method a clash-free timetable was generated and, a room assignment plan that minimizes the total number of proctoring duties, usage of higher floor rooms and total crowdedness of rooms respectively was put into action. Therefore no student group experienced any clashing exams, the faculty members saved time that can be spent on research instead, since the room usage was better planned the costs (elevator usage, lighting, air conditioning, the labor of the janitors) were assumed to be decreased. Originality / value of the article: Each examination period bares a different ETP due to its problem-specific nature (number of courses offered, structure of student enrollments, availability of rooms, etc.). Summer schools provide a more irregular structure that demands special attention, a trial-and-error reformulation of the ETP in our case. In addition, the traditional formulations of the ETP, to the extent we have been able to scan, do not include the minimization of the crowdedness of the rooms. Thus, in creating a more comfortable environment, easier to monitor exams and, ability in handling unexpected dysfunctionalities (broken classroom equipment, etc.) this study is novel. Limitations of the research: The algorithms to solve an ETP formulated as an LMIP are of high complexity therefore, we are not able to assert the optimality of our suggested solutions acquired within time limitations. Keywords: examination timetabling, group decision making, lexicographic optimization, linear mixed-integer programming JEL: C44, C61, M12
Źródło:
Central European Review of Economics and Management; 2020, 4, 3; 67-87
2543-9472
Pojawia się w:
Central European Review of Economics and Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On stability of some lexicographic integer optimization problem
Autorzy:
Emelichev, V. A.
Gurevsky, E. E.
Kuzmin, K. G.
Powiązania:
https://bibliotekanauki.pl/articles/969909.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multicriteria optimization
lexicographic integer optimization problem
absolute values of linear functions
lexicographic optima
stability
strong stability
quasi-stability
strong quasi-stability
unalterability
Opis:
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
Źródło:
Control and Cybernetics; 2010, 39, 3; 811-826
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On stability of some lexicographic multicriteria Boolean problem
Autorzy:
Emelichev, V. A.
Gurevsky, E. E.
Powiązania:
https://bibliotekanauki.pl/articles/970404.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
vector optimization
lexicographic set
Boolean programming
stability radius
Opis:
We consider a multicriteria lexicographic Boolean problem of minimizing absolute deviations of linear functions from zero. We investigate the stability radius which can be understood as a limit level of independent perturbations of the parameters, for which new lexicographic optima do not appear. Lower and upper accessible bounds of the stability radius are obtained.
Źródło:
Control and Cybernetics; 2007, 36, 2; 333-346
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Qualitative stability analysis of multicriteria combinatorial minimin problems
Autorzy:
Emelichev, V. A.
Karelkina, O. V.
Kuzmin, K. G.
Powiązania:
https://bibliotekanauki.pl/articles/206273.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
combinatorial optimization
Pareto set
lexicographic set
stability analysis
stability types
Opis:
A multicriteria combinatorial problem with minimin partial criteria is considered. Necessary and sufficient conditions for the five known stability types of the problem are obtained. These stability types describe in different ways the behavior of the Pareto and lexicographic sets of the problem under initial data perturba- tions of the vector criteria.
Źródło:
Control and Cybernetics; 2012, 41, 1; 57-79
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability and accuracy functions in multicriteria combinatorial optimization problem with [Sigma]-MINMAX and [Sigma]-MINMIN partial criteria
Autorzy:
Libura, M.
Nikulin, Y.
Powiązania:
https://bibliotekanauki.pl/articles/970484.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
wielokryterialna optymalizacja kombinatoryczna
analiza wrażliwości
funkcje stabilności i dokładności
optimum Pareto i leksykograficzne
multicriteria combinatorial optimization
sensitivity analysis
stability and accuracy functions
Pareto and lexicographic optima
Opis:
We consider a vector generic combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of quality of a given feasible solution from the point of view of its stability. These measures correspond to so-called stability and accuracy functions denned earlier for scalar optimization problems. Then we study properties of such functions and calculate the maximal norms of perturbations for which an efficient solution preserves the efficiency.
Źródło:
Control and Cybernetics; 2004, 33, 3; 511-524
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies