Research articles on Multi-Objective Non-Linear Programming (MONLP) The Next CEO of Stack OverflowFormulating linear programming treatment plan based on costs, periods, and conditionObjective function: linear programmingCalculus/Optimization - Implicit fuction theorem with equality constraints¿formulation of this problem in non linear programming?linear programming for bus ticketsFinding the Constraints of a Linear Programming problemCan Sequential Quadratic Programming be applied to functions that are non-differentiable on the edge?Formulating Linear Programming for Production Planning ProblemLinear Programming objective functionConstruction of a linear programming given a solution
How to implement Comparable so it is consistent with identity-equality
That's an odd coin - I wonder why
How to pronounce fünf in 45
Compensation for working overtime on Saturdays
How exploitable/balanced is this homebrew spell: Spell Permanency?
What steps are necessary to read a Modern SSD in Medieval Europe?
How can the PCs determine if an item is a phylactery?
How to compactly explain secondary and tertiary characters without resorting to stereotypes?
Find a path from s to t using as few red nodes as possible
pgfplots: How to draw a tangent graph below two others?
Prodigo = pro + ago?
Does Germany produce more waste than the US?
Early programmable calculators with RS-232
Mathematica command that allows it to read my intentions
Upgrading From a 9 Speed Sora Derailleur?
How dangerous is XSS
How should I connect my cat5 cable to connectors having an orange-green line?
How do I secure a TV wall mount?
Salesforce opportunity stages
Small nick on power cord from an electric alarm clock, and copper wiring exposed but intact
Could you use a laser beam as a modulated carrier wave for radio signal?
Is it a bad idea to plug the other end of ESD strap to wall ground?
Cannot restore registry to default in Windows 10?
How can I replace x-axis labels with pre-determined symbols?
Research articles on Multi-Objective Non-Linear Programming (MONLP)
The Next CEO of Stack OverflowFormulating linear programming treatment plan based on costs, periods, and conditionObjective function: linear programmingCalculus/Optimization - Implicit fuction theorem with equality constraints¿formulation of this problem in non linear programming?linear programming for bus ticketsFinding the Constraints of a Linear Programming problemCan Sequential Quadratic Programming be applied to functions that are non-differentiable on the edge?Formulating Linear Programming for Production Planning ProblemLinear Programming objective functionConstruction of a linear programming given a solution
$begingroup$
I'm looking for papers dealing with multi-objective non-linear programming which could help me implement an algorithm to solve my problem.
My problem is :
Maximize $f(x) = c cdot x$, while minimizing $g(x) = r cdot x$, where $cdot$ is the scalar product.
Constrained by $h_1(x) = fracv cdot xp cdot x geq 0.5$ and $h_2(x) = b cdot x = B$
Given that $b, c, p, r, v in (mathbbN^*)^n, B in mathbbR_+^*, x in [0, 1]^n$
For me, n will be in the order of 1000.
I know there is not a unique solution so I'm looking for the set of Pareto optimal solutions, therefore I am not interested by scalarizing. I could use interactive methods though.
Any help on the subject will be appreciated.
reference-request nonlinear-optimization constraints operations-research
$endgroup$
add a comment |
$begingroup$
I'm looking for papers dealing with multi-objective non-linear programming which could help me implement an algorithm to solve my problem.
My problem is :
Maximize $f(x) = c cdot x$, while minimizing $g(x) = r cdot x$, where $cdot$ is the scalar product.
Constrained by $h_1(x) = fracv cdot xp cdot x geq 0.5$ and $h_2(x) = b cdot x = B$
Given that $b, c, p, r, v in (mathbbN^*)^n, B in mathbbR_+^*, x in [0, 1]^n$
For me, n will be in the order of 1000.
I know there is not a unique solution so I'm looking for the set of Pareto optimal solutions, therefore I am not interested by scalarizing. I could use interactive methods though.
Any help on the subject will be appreciated.
reference-request nonlinear-optimization constraints operations-research
$endgroup$
add a comment |
$begingroup$
I'm looking for papers dealing with multi-objective non-linear programming which could help me implement an algorithm to solve my problem.
My problem is :
Maximize $f(x) = c cdot x$, while minimizing $g(x) = r cdot x$, where $cdot$ is the scalar product.
Constrained by $h_1(x) = fracv cdot xp cdot x geq 0.5$ and $h_2(x) = b cdot x = B$
Given that $b, c, p, r, v in (mathbbN^*)^n, B in mathbbR_+^*, x in [0, 1]^n$
For me, n will be in the order of 1000.
I know there is not a unique solution so I'm looking for the set of Pareto optimal solutions, therefore I am not interested by scalarizing. I could use interactive methods though.
Any help on the subject will be appreciated.
reference-request nonlinear-optimization constraints operations-research
$endgroup$
I'm looking for papers dealing with multi-objective non-linear programming which could help me implement an algorithm to solve my problem.
My problem is :
Maximize $f(x) = c cdot x$, while minimizing $g(x) = r cdot x$, where $cdot$ is the scalar product.
Constrained by $h_1(x) = fracv cdot xp cdot x geq 0.5$ and $h_2(x) = b cdot x = B$
Given that $b, c, p, r, v in (mathbbN^*)^n, B in mathbbR_+^*, x in [0, 1]^n$
For me, n will be in the order of 1000.
I know there is not a unique solution so I'm looking for the set of Pareto optimal solutions, therefore I am not interested by scalarizing. I could use interactive methods though.
Any help on the subject will be appreciated.
reference-request nonlinear-optimization constraints operations-research
reference-request nonlinear-optimization constraints operations-research
edited Feb 20 at 14:46
Arius
asked Feb 19 at 16:10
AriusArius
1014
1014
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I recently read a paper where someone was solving a nonlinear problem with binary variables and multiple objectives, looking for the Pareto optimal solutions. They used a genetic algorithm (NSGA-II) that seems appropriate, with the caveat that the solutions it gets are not guaranteed to be Pareto optimal, though they should at least be close. (I think the paper argues that the GA's population converges to the Pareto frontier.) It might be worth a look, if you're okay with using a metaheuristic. Here's the citation:
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan (2002). "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2 (April), 182-197.
$endgroup$
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
add a comment |
$begingroup$
In Gandibleux, X. (Ed.). (2006). Multiple criteria optimization: state of the art annotated bibliographic surveys (Vol. 52). Springer Science & Business Media., I found in chapter 5 many interactive nonlinear multiobjective procedures explained. According to Kaisa Miettinen, none is better than another and they all have their pros and cons.
We can cite :
- Interactive Surrogate Worth Trade-Off Method [1]
- Geoffrion-Dyer-Feinberg Method [2]
- Tchebycheff Method [3]
- Step Method [4]
- Reference Point Method [5]
- GUESS Method [6]
- Satisficing Trade-Off Method [7]
- Light Beam Search [8]
- Reference Direction Approach [9]
- Reference Direction Method [10]
NIMBUS Method [11]
[1]: V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., New York, 1983
[2]: A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive
approach for multi-criterion optimization, with an application to
the operation of an academic department. Management Science,
19:357–368, 1972[3]: R. E. Steuer. The Tchebycheff procedure of interactive multiple objective programming. In B. Karpak and S. Zionts, editors, Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pages 235–249. Springer-Verlag, Berlin, Heidelberg,
1989.[4]: R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev. Lin-
ear programming with multiple objective functions: Step method
(STEM). Mathematical Programming, 1:366–375, 1971[5]: A. P. Wierzbicki. The use of reference objectives in multiobjec-
tive optimization. In G. Fandel and T. Gal, editors, Multiple Cri-
teria Decision Making Theory and Applications, pages 468–486.
Springer-Verlag, Berlin, Heidelberg, 1980[6]: J. T. Buchanan. A naïve approach for solving MCDM problems:
The GUESS method. Journal of the Operational Research Society,
48:202–206, 1997.[7]: H. Nakayama. Aspiration level approach to interactive multi-
objective programming and its applications. In P. M. Pardalos,
Y. Siskos, and C. Zopounidis, editors, Advances in Multicriteria
Analysis, pages 147–174. Kluwer Academic Publishers, Dordrecht,
1995[8]: A. Jaszkiewicz The light beam search – outrank-
ing based interactive procedure for multiple-objective mathemati-
cal programming. In P. M. Pardalos, Y. Siskos, and C. Zopounidis,
editors, Advances in Multicriteria Analysis, pages 129–146. Kluwer
Academic Publishers, Dordrecht, 1995.[9]: P. Korhonen. Reference direction approach to multiple objec-
tive linear programming: Historical overview. In M. H. Karwan,
J. Spronk, and J. Wallenius, editors, Essays in Decision Making:
A Volume in Honour of Stanley Zionts, pages 74–92. Springer-
Verlag, Berlin, Heidelberg, 1997[10]: S. C. Narula, L. Kirilov, and V. Vassilev. An interactive algorithm
for solving multiple objective nonlinear programming problems. In
G. H. Tzeng, H. F. Wand, U. P. Wen, and P. L. Yu, editors, Multi-
ple Criteria Decision Making – Proceedings of the Tenth Interna-
tional Conference: Expand and Enrich the Domains of Thinking
and Application, pages 119–127. Springer-Verlag, New York, 1994[11]: K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Aca-
demic Publishers, Boston, 1999
$endgroup$
add a comment |
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3119016%2fresearch-articles-on-multi-objective-non-linear-programming-monlp%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I recently read a paper where someone was solving a nonlinear problem with binary variables and multiple objectives, looking for the Pareto optimal solutions. They used a genetic algorithm (NSGA-II) that seems appropriate, with the caveat that the solutions it gets are not guaranteed to be Pareto optimal, though they should at least be close. (I think the paper argues that the GA's population converges to the Pareto frontier.) It might be worth a look, if you're okay with using a metaheuristic. Here's the citation:
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan (2002). "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2 (April), 182-197.
$endgroup$
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
add a comment |
$begingroup$
I recently read a paper where someone was solving a nonlinear problem with binary variables and multiple objectives, looking for the Pareto optimal solutions. They used a genetic algorithm (NSGA-II) that seems appropriate, with the caveat that the solutions it gets are not guaranteed to be Pareto optimal, though they should at least be close. (I think the paper argues that the GA's population converges to the Pareto frontier.) It might be worth a look, if you're okay with using a metaheuristic. Here's the citation:
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan (2002). "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2 (April), 182-197.
$endgroup$
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
add a comment |
$begingroup$
I recently read a paper where someone was solving a nonlinear problem with binary variables and multiple objectives, looking for the Pareto optimal solutions. They used a genetic algorithm (NSGA-II) that seems appropriate, with the caveat that the solutions it gets are not guaranteed to be Pareto optimal, though they should at least be close. (I think the paper argues that the GA's population converges to the Pareto frontier.) It might be worth a look, if you're okay with using a metaheuristic. Here's the citation:
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan (2002). "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2 (April), 182-197.
$endgroup$
I recently read a paper where someone was solving a nonlinear problem with binary variables and multiple objectives, looking for the Pareto optimal solutions. They used a genetic algorithm (NSGA-II) that seems appropriate, with the caveat that the solutions it gets are not guaranteed to be Pareto optimal, though they should at least be close. (I think the paper argues that the GA's population converges to the Pareto frontier.) It might be worth a look, if you're okay with using a metaheuristic. Here's the citation:
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan (2002). "A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2 (April), 182-197.
answered Feb 19 at 21:46
prubinprubin
1,565125
1,565125
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
add a comment |
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
$begingroup$
Thank you for your answer. Nevertheless I'm not looking for binary variables (it's in the full [0, 1] range). I will take a look at NSGA-II but it might not converge as rapidly for me and will probably not yield the same results as continuous variables.
$endgroup$
– Arius
Feb 19 at 21:58
1
1
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
$begingroup$
I'm not sure the examples in the NGSA-II paper used binary variables. It just happens that the paper in which I saw it being used had binary variables.
$endgroup$
– prubin
Feb 20 at 19:10
add a comment |
$begingroup$
In Gandibleux, X. (Ed.). (2006). Multiple criteria optimization: state of the art annotated bibliographic surveys (Vol. 52). Springer Science & Business Media., I found in chapter 5 many interactive nonlinear multiobjective procedures explained. According to Kaisa Miettinen, none is better than another and they all have their pros and cons.
We can cite :
- Interactive Surrogate Worth Trade-Off Method [1]
- Geoffrion-Dyer-Feinberg Method [2]
- Tchebycheff Method [3]
- Step Method [4]
- Reference Point Method [5]
- GUESS Method [6]
- Satisficing Trade-Off Method [7]
- Light Beam Search [8]
- Reference Direction Approach [9]
- Reference Direction Method [10]
NIMBUS Method [11]
[1]: V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., New York, 1983
[2]: A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive
approach for multi-criterion optimization, with an application to
the operation of an academic department. Management Science,
19:357–368, 1972[3]: R. E. Steuer. The Tchebycheff procedure of interactive multiple objective programming. In B. Karpak and S. Zionts, editors, Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pages 235–249. Springer-Verlag, Berlin, Heidelberg,
1989.[4]: R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev. Lin-
ear programming with multiple objective functions: Step method
(STEM). Mathematical Programming, 1:366–375, 1971[5]: A. P. Wierzbicki. The use of reference objectives in multiobjec-
tive optimization. In G. Fandel and T. Gal, editors, Multiple Cri-
teria Decision Making Theory and Applications, pages 468–486.
Springer-Verlag, Berlin, Heidelberg, 1980[6]: J. T. Buchanan. A naïve approach for solving MCDM problems:
The GUESS method. Journal of the Operational Research Society,
48:202–206, 1997.[7]: H. Nakayama. Aspiration level approach to interactive multi-
objective programming and its applications. In P. M. Pardalos,
Y. Siskos, and C. Zopounidis, editors, Advances in Multicriteria
Analysis, pages 147–174. Kluwer Academic Publishers, Dordrecht,
1995[8]: A. Jaszkiewicz The light beam search – outrank-
ing based interactive procedure for multiple-objective mathemati-
cal programming. In P. M. Pardalos, Y. Siskos, and C. Zopounidis,
editors, Advances in Multicriteria Analysis, pages 129–146. Kluwer
Academic Publishers, Dordrecht, 1995.[9]: P. Korhonen. Reference direction approach to multiple objec-
tive linear programming: Historical overview. In M. H. Karwan,
J. Spronk, and J. Wallenius, editors, Essays in Decision Making:
A Volume in Honour of Stanley Zionts, pages 74–92. Springer-
Verlag, Berlin, Heidelberg, 1997[10]: S. C. Narula, L. Kirilov, and V. Vassilev. An interactive algorithm
for solving multiple objective nonlinear programming problems. In
G. H. Tzeng, H. F. Wand, U. P. Wen, and P. L. Yu, editors, Multi-
ple Criteria Decision Making – Proceedings of the Tenth Interna-
tional Conference: Expand and Enrich the Domains of Thinking
and Application, pages 119–127. Springer-Verlag, New York, 1994[11]: K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Aca-
demic Publishers, Boston, 1999
$endgroup$
add a comment |
$begingroup$
In Gandibleux, X. (Ed.). (2006). Multiple criteria optimization: state of the art annotated bibliographic surveys (Vol. 52). Springer Science & Business Media., I found in chapter 5 many interactive nonlinear multiobjective procedures explained. According to Kaisa Miettinen, none is better than another and they all have their pros and cons.
We can cite :
- Interactive Surrogate Worth Trade-Off Method [1]
- Geoffrion-Dyer-Feinberg Method [2]
- Tchebycheff Method [3]
- Step Method [4]
- Reference Point Method [5]
- GUESS Method [6]
- Satisficing Trade-Off Method [7]
- Light Beam Search [8]
- Reference Direction Approach [9]
- Reference Direction Method [10]
NIMBUS Method [11]
[1]: V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., New York, 1983
[2]: A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive
approach for multi-criterion optimization, with an application to
the operation of an academic department. Management Science,
19:357–368, 1972[3]: R. E. Steuer. The Tchebycheff procedure of interactive multiple objective programming. In B. Karpak and S. Zionts, editors, Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pages 235–249. Springer-Verlag, Berlin, Heidelberg,
1989.[4]: R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev. Lin-
ear programming with multiple objective functions: Step method
(STEM). Mathematical Programming, 1:366–375, 1971[5]: A. P. Wierzbicki. The use of reference objectives in multiobjec-
tive optimization. In G. Fandel and T. Gal, editors, Multiple Cri-
teria Decision Making Theory and Applications, pages 468–486.
Springer-Verlag, Berlin, Heidelberg, 1980[6]: J. T. Buchanan. A naïve approach for solving MCDM problems:
The GUESS method. Journal of the Operational Research Society,
48:202–206, 1997.[7]: H. Nakayama. Aspiration level approach to interactive multi-
objective programming and its applications. In P. M. Pardalos,
Y. Siskos, and C. Zopounidis, editors, Advances in Multicriteria
Analysis, pages 147–174. Kluwer Academic Publishers, Dordrecht,
1995[8]: A. Jaszkiewicz The light beam search – outrank-
ing based interactive procedure for multiple-objective mathemati-
cal programming. In P. M. Pardalos, Y. Siskos, and C. Zopounidis,
editors, Advances in Multicriteria Analysis, pages 129–146. Kluwer
Academic Publishers, Dordrecht, 1995.[9]: P. Korhonen. Reference direction approach to multiple objec-
tive linear programming: Historical overview. In M. H. Karwan,
J. Spronk, and J. Wallenius, editors, Essays in Decision Making:
A Volume in Honour of Stanley Zionts, pages 74–92. Springer-
Verlag, Berlin, Heidelberg, 1997[10]: S. C. Narula, L. Kirilov, and V. Vassilev. An interactive algorithm
for solving multiple objective nonlinear programming problems. In
G. H. Tzeng, H. F. Wand, U. P. Wen, and P. L. Yu, editors, Multi-
ple Criteria Decision Making – Proceedings of the Tenth Interna-
tional Conference: Expand and Enrich the Domains of Thinking
and Application, pages 119–127. Springer-Verlag, New York, 1994[11]: K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Aca-
demic Publishers, Boston, 1999
$endgroup$
add a comment |
$begingroup$
In Gandibleux, X. (Ed.). (2006). Multiple criteria optimization: state of the art annotated bibliographic surveys (Vol. 52). Springer Science & Business Media., I found in chapter 5 many interactive nonlinear multiobjective procedures explained. According to Kaisa Miettinen, none is better than another and they all have their pros and cons.
We can cite :
- Interactive Surrogate Worth Trade-Off Method [1]
- Geoffrion-Dyer-Feinberg Method [2]
- Tchebycheff Method [3]
- Step Method [4]
- Reference Point Method [5]
- GUESS Method [6]
- Satisficing Trade-Off Method [7]
- Light Beam Search [8]
- Reference Direction Approach [9]
- Reference Direction Method [10]
NIMBUS Method [11]
[1]: V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., New York, 1983
[2]: A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive
approach for multi-criterion optimization, with an application to
the operation of an academic department. Management Science,
19:357–368, 1972[3]: R. E. Steuer. The Tchebycheff procedure of interactive multiple objective programming. In B. Karpak and S. Zionts, editors, Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pages 235–249. Springer-Verlag, Berlin, Heidelberg,
1989.[4]: R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev. Lin-
ear programming with multiple objective functions: Step method
(STEM). Mathematical Programming, 1:366–375, 1971[5]: A. P. Wierzbicki. The use of reference objectives in multiobjec-
tive optimization. In G. Fandel and T. Gal, editors, Multiple Cri-
teria Decision Making Theory and Applications, pages 468–486.
Springer-Verlag, Berlin, Heidelberg, 1980[6]: J. T. Buchanan. A naïve approach for solving MCDM problems:
The GUESS method. Journal of the Operational Research Society,
48:202–206, 1997.[7]: H. Nakayama. Aspiration level approach to interactive multi-
objective programming and its applications. In P. M. Pardalos,
Y. Siskos, and C. Zopounidis, editors, Advances in Multicriteria
Analysis, pages 147–174. Kluwer Academic Publishers, Dordrecht,
1995[8]: A. Jaszkiewicz The light beam search – outrank-
ing based interactive procedure for multiple-objective mathemati-
cal programming. In P. M. Pardalos, Y. Siskos, and C. Zopounidis,
editors, Advances in Multicriteria Analysis, pages 129–146. Kluwer
Academic Publishers, Dordrecht, 1995.[9]: P. Korhonen. Reference direction approach to multiple objec-
tive linear programming: Historical overview. In M. H. Karwan,
J. Spronk, and J. Wallenius, editors, Essays in Decision Making:
A Volume in Honour of Stanley Zionts, pages 74–92. Springer-
Verlag, Berlin, Heidelberg, 1997[10]: S. C. Narula, L. Kirilov, and V. Vassilev. An interactive algorithm
for solving multiple objective nonlinear programming problems. In
G. H. Tzeng, H. F. Wand, U. P. Wen, and P. L. Yu, editors, Multi-
ple Criteria Decision Making – Proceedings of the Tenth Interna-
tional Conference: Expand and Enrich the Domains of Thinking
and Application, pages 119–127. Springer-Verlag, New York, 1994[11]: K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Aca-
demic Publishers, Boston, 1999
$endgroup$
In Gandibleux, X. (Ed.). (2006). Multiple criteria optimization: state of the art annotated bibliographic surveys (Vol. 52). Springer Science & Business Media., I found in chapter 5 many interactive nonlinear multiobjective procedures explained. According to Kaisa Miettinen, none is better than another and they all have their pros and cons.
We can cite :
- Interactive Surrogate Worth Trade-Off Method [1]
- Geoffrion-Dyer-Feinberg Method [2]
- Tchebycheff Method [3]
- Step Method [4]
- Reference Point Method [5]
- GUESS Method [6]
- Satisficing Trade-Off Method [7]
- Light Beam Search [8]
- Reference Direction Approach [9]
- Reference Direction Method [10]
NIMBUS Method [11]
[1]: V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. Elsevier Science Publishing Co., New York, 1983
[2]: A. M. Geoffrion, J. S. Dyer, and A. Feinberg. An interactive
approach for multi-criterion optimization, with an application to
the operation of an academic department. Management Science,
19:357–368, 1972[3]: R. E. Steuer. The Tchebycheff procedure of interactive multiple objective programming. In B. Karpak and S. Zionts, editors, Multiple Criteria Decision Making and Risk Analysis Using Microcomputers, pages 235–249. Springer-Verlag, Berlin, Heidelberg,
1989.[4]: R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev. Lin-
ear programming with multiple objective functions: Step method
(STEM). Mathematical Programming, 1:366–375, 1971[5]: A. P. Wierzbicki. The use of reference objectives in multiobjec-
tive optimization. In G. Fandel and T. Gal, editors, Multiple Cri-
teria Decision Making Theory and Applications, pages 468–486.
Springer-Verlag, Berlin, Heidelberg, 1980[6]: J. T. Buchanan. A naïve approach for solving MCDM problems:
The GUESS method. Journal of the Operational Research Society,
48:202–206, 1997.[7]: H. Nakayama. Aspiration level approach to interactive multi-
objective programming and its applications. In P. M. Pardalos,
Y. Siskos, and C. Zopounidis, editors, Advances in Multicriteria
Analysis, pages 147–174. Kluwer Academic Publishers, Dordrecht,
1995[8]: A. Jaszkiewicz The light beam search – outrank-
ing based interactive procedure for multiple-objective mathemati-
cal programming. In P. M. Pardalos, Y. Siskos, and C. Zopounidis,
editors, Advances in Multicriteria Analysis, pages 129–146. Kluwer
Academic Publishers, Dordrecht, 1995.[9]: P. Korhonen. Reference direction approach to multiple objec-
tive linear programming: Historical overview. In M. H. Karwan,
J. Spronk, and J. Wallenius, editors, Essays in Decision Making:
A Volume in Honour of Stanley Zionts, pages 74–92. Springer-
Verlag, Berlin, Heidelberg, 1997[10]: S. C. Narula, L. Kirilov, and V. Vassilev. An interactive algorithm
for solving multiple objective nonlinear programming problems. In
G. H. Tzeng, H. F. Wand, U. P. Wen, and P. L. Yu, editors, Multi-
ple Criteria Decision Making – Proceedings of the Tenth Interna-
tional Conference: Expand and Enrich the Domains of Thinking
and Application, pages 119–127. Springer-Verlag, New York, 1994[11]: K. Miettinen. Nonlinear Multiobjective Optimization. Kluwer Aca-
demic Publishers, Boston, 1999
answered Mar 20 at 9:54
AriusArius
1014
1014
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3119016%2fresearch-articles-on-multi-objective-non-linear-programming-monlp%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown