%0 Journal Article
%T Penalty Function Method for Bilevel Multiobjective Programming<br>两层多目标规划的罚函数法
%A Zhao Wei
%A <br>赵蔚
%J 自动化学报
%D 1998
%I 
%X In this paper, a class of nonlinear bilevel multiobjective programming problems is studied. Under the assumptions that the objective functions are strictly convex and the constraint set of decision variables is convex, by transforming the bilevel multiobjective programming problem into a series of one level multiobjective programming problems, the penalty function method for bilevel multiobjective programming is established, and the convergence of the method is proved. This method complements the theory of bilevel multiobjective programming and provides a powerful means to solve the practical bilevel multiobjective decision making problems
%K Bilevel programming
%K multiobjective programming
%K penalty
%K function<br>两层规划
%K 多目标规划
%K 罚函数
%K 决策
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=1EDAEE203A5C05EB&yid=8CAA3A429E3EA654&vid=B91E8C6D6FE990DB&iid=38B194292C032A66&sid=717CC18E05F2AFA0&eid=5FF9F4F7CB1800C7&journal_id=0254-4156&journal_name=自动化学报&referenced_num=4&reference_num=11