Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors

The paper is devoted to the applications of convexifactors to bilevel programming problem. Here we have defined ∂ ^∗-convex, ∂ ^∗-pseudoconvex and ∂ ^∗-quasiconvex bifunctions in terms of convexifactors on the lines of Dutta and Chandra (Optimization 53:77–94, 2004) and Li and Zhang (J. Opt. Theory Appl. 131:429–452, 2006). We derive sufficient optimality conditions for the bilevel programming problem by using these functions, and we establish various duality results by associating the given problem with two dual problems, namely Wolfe type dual and Mond–Weir type dual.     

一类非线性双层规划问题的最优性条件

双层规划模型是描述具有层次特性管理决策系统的有效方法.本文讨论了一类有广泛代表性的非线性双层规划模型,给出了该类模型最优解的条件.     

二层多目标规划的最优性条件

本文在集值优化的框架下提出了一个二层多目标规划模型（BLMOP）.利用集值映射的相依导数和相依上导数,给出了几个有关（BLMOP）的弱有效解的必要或充分最优性条件.     

First-Order Necessary Optimality Conditions for General Bilevel Programming Problems

In Ref. 1, bilevel programming problems have been investigated using an equivalent formulation by use of the optimal value function of the lower level problem. In this comment, it is shown that Ref. 1 contains two incorrect results: in Proposition 2.1, upper semicontinuity instead of lower semicontinuity has to be used for guaranteeing existence of optimal solutions; in Theorem 5.1, the assumption that the abnormal part of the directional derivative of the optimal value function reduces to zero has to be replaced by the demand that a nonzero abnormal Lagrange multiplier does not exist.     

New Optimality Conditions for the Semivectorial Bilevel Optimization Problem

The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary optimality conditions are then derived in the smooth and nonsmooth settings while using the generalized differentiation calculus of Mordukhovich. Our approach is different from the one previously used in the literature and the conditions obtained are new. Furthermore, they reduce to those of a usual bilevel program, if the lower-level objective function becomes single-valued.     

Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators

In this work, we use a notion of convexificator (Jeyakumar, V. and Luc, D.T. (1999), Journal of Optimization Theory and Applicatons, 101, 599–621.) to establish necessary optimality conditions for bilevel optimization problems. For this end, we introduce an appropriate regularity condition to help us discern the Lagrange–Kuhn–Tucker multipliers.     

Convexifactors, Generalized Convexity, and Optimality Conditions

The recently introduced notion of a convexifactor is further studied, and quasiconvex and pseudoconvex functions are characterized in terms of convexifactors. As an application to a chain rule, a necessary optimality condition is deduced for an inequality constrained mathematical programming problem.     

Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem

Abstract

The paper is devoted to the study of a bilevel multiobjective optimization problems with objectives and constraints given as differences of convex functions. The main attention is paid to deriving sufficient optimality conditions. Several intermediate optimization problems are introduced to help us in our investigation.     

线性分式规划问题的最优性条件

本文讨论了线性分式规划问题ｍｉｎ以及它的最优性条件．证明了它的局布最优解一定是整体最优解，并且局布最优解正定在约束条件的基本可行解处达到．     

Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles

In this article, we are concerned with a sequence of two set valued optimization problems in which the feasible region of the first one (the upper-level problem) is determined implicitly by the solution set of the second (the lower-level problem). Since bilevel programming problems are in general nonconvex problems even if the problem data are convex, we use the exact extremal principle and the approximate extremal principle introduced by Mordukhovich [14 B.S. Mordukhovich ( 2001 ). The extremal principle and its applications to optimization and economics . In: Optimization and Related Topics ( A. Rubinov and B. Glover , eds.). Applied Optimization Volumes 47 , Kluwer , Dordrecht , The Netherlands , pp. 343 – 369 . [Google Scholar], 15 B.S. Mordukhovich ( 2006 ). Variational Analysis and Generalized Differentiation, I: Basic Theory, II: Applications, Grundlehren Series (Fundamental Principles of Mathematical Sciences), 330 and 331, Springer, Berlin . [Google Scholar]] in order to get optimality conditions for this bilevel problem.     

区间规划问题的最优性条件

区间规划是带有区间参数的规划问题,是一种更易于求解实际问题的柔性规划。它是确定性优化问题的延伸,有区间线性规划和区间非线性规划两种形式。本文讨论了目标函数是区间函数的区间非线性问题。给出了区间规划问题最优性必要条件的较简单证明方法,并利用LU最优解的概念,在一类广义凸函数－(p,r)－ρ－(η,θ)－不变凸函数定义下讨论了最优性充分条件。     

区间数线性规划问题的最优性条件

分别讨论了区间数线性规划问题保守可能解、保守必然解、冒进可能解和冒进必然解的最优性条件。     

关于一类二层规划问题的一阶最优性条件研究

本文针对一类具有特定结构的二层规划问题, 将下层问题用其KKT条件代替, 把二层规划问题转化成带有互补约束的单层优化问题.然后利用Fritz-John条件,在适当的条件下,得到了二层优化问题的一阶最优性条件.本文所给条件简单、容易验证,并且不同于[1]的条件.     

求解二层线性规划问题的一种算法

对下层含有约束的二层线性规划问题,提出了求全局最优解的一种算法.首先由该算法求出约束凸集的全部极点,再对极点进行可行性检验,从而得到了二层线性规划问题的全局最优解,最后以实例验证了算法的有效性.     

Optimality Conditions in Semidefinite Programming

Semidefinite positiveness of operators on Euclidean spaces is characterized. Using this characterization, we compute in a direct way the first-order and second-order tangent sets to the cone of semidefinite positive operators on such a space. These characterizations are useful for optimality conditions in semidefinite programming.     

非光滑半定规划的一阶最优性条件

首次考虑了非光滑半定规化问题．运用与非线性规划类似的技巧,把现存的理论扩展到约束是结构稀疏矩阵的情况,给出了其一阶最优性条件。考虑了严格互补条件不成立的情形．在约束矩阵为对角阵条件下,所用的正则条件与传统非线性优化意义下的是一致的．     

On the Quasiconcave Bilevel Programming Problem

Bilevel programming involves two optimization problems where the constraint region of the first-level problem is implicitly determined by another optimization problem. In this paper, we consider the case in which both objective functions are quasiconcave and the constraint region common to both levels is a polyhedron. First, it is proved that this problem is equivalent to minimizing a quasiconcave function over a feasible region comprised of connected faces of the polyhedron. Consequently, there is an extreme point of the polyhedron that solves the problem. Finally, it is shown that this model includes the most important case where the objective functions are ratios of concave and convex functions     

求解多目标问题的积分型算法的最优性条件

本文把修正的积分水平集法与多目标分层序列法相结合,在文[9]给出的一 种求解多目标最优化的积分型实现算法的基础上提出了相关均值与相关方差的概念,并证 明了与相关均值和相关方差有关的多目标全局有效解存在的充要条件和全局弱有效解存 在的充分条件,即最优性条件．     

Hilbert空间中的一类双层规划问题的一阶与二阶最优性条件

本文考虑Hilbert空间中的,上层为有限个不等式约束,下层是一锥约束参数规划的双层规划问题的最优性条件.首先,利用下层问题最优值函数的方向导数的上下界的性质给出一阶最优性条件.之后,在使下层问题的最优值函数是二阶方向可微的条件下,证明了二阶必要性条件.     

Fuzzy Optimality Conditions for Fractional Multiobjective Bilevel Problems Under Fractional Constraints

In this article, we are concerned with fractional multiobjective optimization problems. In order to derive optimality conditions, we consider a new single level problem [12 J.J. Ye ( 2006 ). Constraint qualification and KKT conditions for bilevel programming problems . Mathematics of Operations Research 31 : 811 – 824 .[Crossref], [Web of Science ®] , [Google Scholar]], which is locally equivalent to the bilevel fractional multiobjective problem (P) at the optimal solution. Our approach consists of using another approach initiated by Mordukhovich [7 B.S. Mordukhovich ( 1976 ). Maximum principle in problems of time optimal control with nonsmooth constraints . J. Appl. Math. Mech. 40 : 960 – 969 .[Crossref], [Web of Science ®] , [Google Scholar], 8 B.S. Mordukhovich ( 1980 ). Metric approximations and necessary optimality conditions for general classes of nonsmooth extremal problems . Soviet. Math. Dokl. 22 : 526 – 530 . [Google Scholar]], which does not involve any convex approximations and convex separation arguments, called the extremal principle [5 B.S. Mordukhovich ( 2006 ). Variational Analysis and Generalized Differentiation, I: Basic Theory . Grundlehren Series (Fundamental Principles of Mathematical Sciences) , Vol. 330 , Springer , Berlin . [Google Scholar], 6 B.S. Mordukhovich ( 2006 ). Variational Analysis and Generalized Differentiation, II: Applications , Grundlehren Series (Fundamental Principles of Mathematical Sciences) , Vol. 331 , Springer , Berlin . [Google Scholar], 9 B.S. Mordukhovich ( 1994 ). Generalized differential calculus for nonsmooth and set-valued mappings . J. Math. Anal. Appl. 183 : 250 – 288 .[Crossref], [Web of Science ®] , [Google Scholar]], for the study of necessary optimality conditions in fractional vector optimization.