New Generalized Invexity for Duality in Multiobjective Programming Problems Involving N-Set Functions

2006 ◽  
pp. 321-339 ◽  
Author(s):  
S. K. Mishra ◽  
S. Y. Wang ◽  
K. K. Lai ◽  
J. Shi
Keyword(s):  
Multiobjective Programming ◽  
Generalized Invexity ◽  
Set Functions ◽  
Multiobjective Programming Problems

Multiobjective Programming

2014 ◽  
pp. 1585-1604
Author(s):  
Minghe Sun
Keyword(s):  
Programming Problem ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Objective Functions ◽  
Solution Quality ◽  
Solution Methods ◽  
Multiobjective Programming Problem ◽  
Feasible Solutions ◽  
Multiobjective Programming Problems

Optimization problems with multiple criteria measuring solution quality can be modeled as multiobjective programming problems. Because the objective functions are usually in conflict, there is not a single feasible solution that can optimize all objective functions simultaneously. An optimal solution is one that is most preferred by the decision maker (DM) among all feasible solutions. An optimal solution must be nondominated but a multiobjective programming problem may have, possibly infinitely, many nondominated solutions. Therefore, tradeoffs must be made in searching for an optimal solution. Hence, the DM's preference information is elicited and used when a multiobjective programming problem is solved. The model, concepts and definitions of multiobjective programming are presented and solution methods are briefly discussed. Examples are used to demonstrate the concepts and solution methods. Graphics are used in these examples to facilitate understanding.

Sign in / Sign up

Export Citation Format

Share Document