The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Multiobjective Programming
Abstract
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.
Related Content
|
Dina Darwish.
© 2024.
48 pages.
|
|
Dina Darwish.
© 2024.
51 pages.
|
|
Smrity Prasad, Kashvi Prawal.
© 2024.
19 pages.
|
|
Jignesh Patil, Sharmila Rathod.
© 2024.
17 pages.
|
|
Ganesh B. Regulwar, Ashish Mahalle, Raju Pawar, Swati K. Shamkuwar, Priti Roshan Kakde, Swati Tiwari.
© 2024.
23 pages.
|
|
Pranali Dhawas, Abhishek Dhore, Dhananjay Bhagat, Ritu Dorlikar Pawar, Ashwini Kukade, Kamlesh Kalbande.
© 2024.
24 pages.
|
|
Pranali Dhawas, Minakshi Ashok Ramteke, Aarti Thakur, Poonam Vijay Polshetwar, Ramadevi Vitthal Salunkhe, Dhananjay Bhagat.
© 2024.
26 pages.
|
|
|