scholarly journals On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point

2020 ◽  
Vol 66 (1) ◽  
pp. 176-201 ◽  
Author(s):  
Fangwei Ye ◽  
Shiqiu Liu ◽  
Kenneth W. Shum ◽  
Raymond W. Yeung
1986 ◽  
Vol 14 (4) ◽  
pp. 448-465 ◽  
Author(s):  
Dennis Sullivan ◽  
Harris Schlesinger

This article analyzes the relationships among three canons of “just” taxation: Pareto optimality, individual rationality, and fairness (nonenvy). Using a helpful device called a Kolm triangle, the analysis shows that the fair and Pareto optimal point need not be individually rational, that it will involve progressive taxation, and that it bears no particular relationship to Lindahl equilibrium, but a rather close relationship to Rawlsian justice.


Author(s):  
Seung-Hyeon Jin ◽  
Nam-Hoon Jeong ◽  
Jae-Ho Choi ◽  
Seong-Hyeon Lee ◽  
Cheol-Ho Kim ◽  
...  

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Geraldine Cáceres Sepúlveda ◽  
Silvia Ochoa ◽  
Jules Thibault

AbstractDue to the highly competitive market and increasingly stringent environmental regulations, it is paramount to operate chemical processes at their optimal point. In a typical process, there are usually many process variables (decision variables) that need to be selected in order to achieve a set of optimal objectives for which the process will be considered to operate optimally. Because some of the objectives are often contradictory, Multi-objective optimization (MOO) can be used to find a suitable trade-off among all objectives that will satisfy the decision maker. The first step is to circumscribe a well-defined Pareto domain, corresponding to the portion of the solution domain comprised of a large number of non-dominated solutions. The second step is to rank all Pareto-optimal solutions based on some preferences of an expert of the process, this step being performed using visualization tools and/or a ranking algorithm. The last step is to implement the best solution to operate the process optimally. In this paper, after reviewing the main methods to solve MOO problems and to select the best Pareto-optimal solution, four simple MOO problems will be solved to clearly demonstrate the wealth of information on a given process that can be obtained from the MOO instead of a single aggregate objective. The four optimization case studies are the design of a PI controller, an SO2 to SO3 reactor, a distillation column and an acrolein reactor. Results of these optimization case studies show the benefit of generating and using the Pareto domain to gain a deeper understanding of the underlying relationships between the various process variables and performance objectives.


Sign in / Sign up

Export Citation Format

Share Document