scholarly journals Optimality for E-[0,1] convex multi-objective programming

Filomat ◽  
2017 ◽  
Vol 31 (3) ◽  
pp. 529-541 ◽  
Author(s):  
Tarek Emama
Keyword(s):  
Feasible Solution ◽  
Necessary Conditions ◽  
Optimal Solution ◽  
Efficient Solutions ◽  
Properly Efficient Solution ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Sufficient And Necessary Conditions ◽  
Objective Programming

In this paper, we interest with deriving the sufficient and necessary conditions for optimal solution of special classes of Programming. These classes involve generalized E-[0,1] convex functions. Characterization of efficient solutions for E-[0,1] convex multi-objective Programming are obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are derived.

A fuzzy multi-objective programming optimization model for emergency resource dispatching under equitable distribution principle

2021 ◽  
pp. 1-10
Author(s):  
Zhaoping Tang ◽  
Wenda Li ◽  
Shijun Yu ◽  
Jianping Sun
Keyword(s):  
Optimization Model ◽  
Programming Model ◽  
Ideal Point ◽  
Optimal Solution ◽  
Multi Objective ◽  
Emergency Rescue ◽  
Satisfaction Degree ◽  
Multi Objective Programming ◽  
Parameter Interval ◽  
Objective Programming

In the initial stage of emergency rescue for major railway emergencies, there may be insufficient emergency resources. In order to ensure that all the emergency demand points can be effectively and fairly rescued, considering the fuzzy properties of the parameters, such as the resource demand quantity, the dispatching time and the satisfaction degree, the railway emergency resources dispatching optimization model is studied, with multi- demand point, multi-depot, and multi-resource. Based on railway rescue features, it was proposed that the couple number of relief point - emergency point is the key to affect railway rescue cost and efficiency. Under the premise of the maximum satisfaction degree of quantity demanded at all emergency points, a multi-objective programming model is established by maximizing the satisfaction degree of dispatching time and the satisfaction degree of the couple number of relief point - emergency point. Combined with the ideal point method, a restrictive parameter interval method for optimal solution was designed, which can realize the quick seek of Pareto optimal solution. Furthermore, an example is given to verify the feasibility and effectiveness of the method.

The Ancillary Service Purchase Model in the Background of High Proportion of Renewable Energy Connecting with the Grid

2018 ◽  
Vol 19 (6) ◽  
Author(s):  
Fugui Dong ◽  
Chunxu Jin ◽  
Lei Shi ◽  
Meimei Shang
Keyword(s):  
Renewable Energy ◽  
Power System ◽  
Thermal Power ◽  
Optimal Solution ◽  
System Stability ◽  
Ancillary Service ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Objective Programming ◽  
The Impact

Abstract With the trend of high proportion of renewable energy connecting with grid, peaking services has played a crucial role in the integration of wind power and other renewable energy sources. The current peaking service takes into account only the cost of thermal power units that providing peaking service without considering the impact of its own reliability on the peaking service and the safe operation of the power system. In this paper, the traditional uniform clearing mechanism has been improved, and the reliability factor of ancillary service provided by thermal power units has been included in the previous quotation-based sorting rule, and a multi-objective programming optimal purchasing model considering synergistic capacity cost and power system stability is established. According to the optimal solution of each objective, Pareto optimal solution of multi-objective programming problem is obtained by the ideal point method. Then the ancillary service price and purchase cost are obtained based on the solution.

scholarly journals Generating Efficient Solutions in Bilevel Multi-Objective Programming Problems

2013 ◽  
Vol 03 (02) ◽  
pp. 289-298 ◽  
Author(s):  
Calice Olivier Pieume ◽  
Patrice Marcotte ◽  
Laure Pauline Fotso ◽  
Patrick Siarry
Keyword(s):  
Efficient Solutions ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Objective Programming

scholarly journals Optimality and duality for complex multi-objective programming

2022 ◽  
Vol 12 (1) ◽  
pp. 121
Author(s):  
Tone-Yau Huang ◽  
Tamaki Tanaka
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Efficient Solutions ◽  
Dual Model ◽  
Duality Theorems ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Optimality And Duality ◽  
Objective Programming

<p style='text-indent:20px;'>We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of problem (CMP), we introduce several properties of optimal efficient solutions and scalarization techniques. Furthermore, a certain parametric dual model is discussed, and their duality theorems are proved.</p>

Sign in / Sign up

Export Citation Format

Share Document