...
机译:不可微数学规划类的最优性条件和高阶对偶
University of Bucharest Faculty of Mathematics and Computer Science Str. Academiei 14 014700 Bucharest, Romania Romanian Academy Institute of Mathematical Statistics and Applied Mathematics Calea 13 Septembrie nr. 13 050711 Bucharest, Romania;
University of Bucharest Faculty of Mathematics and Computer Science Str. Academiei 14 014700 Bucharest, Romania Romanian Academy Institute of Mathematical Statistics and Applied Mathematics Calea 13 Septembrie nr. 13 050711 Bucharest, Romania;
University of Bucharest Faculty of Mathematics and Computer Science Str. Academiei 14 014700 Bucharest, Romania Romanian Academy Institute of Mathematical Statistics and Applied Mathematics Calea 13 Septembrie nr. 13 050711 Bucharest, Romania;
multiobjective programming; optimization;
机译:一类不可微的数学规划问题的Mangararian型高阶对偶
机译:一类不可微的多目标规划问题的最优性条件和对偶
机译:一类不可微分多目标分数规划问题的最优性条件和对偶
机译:利用参数双向非自动变性Minimax分数规划的最优性条件
机译:数学编程和最优控制中的全局最优性条件。
机译:非线性程序和数学程序的二阶最优性条件
机译:一类非自由度多目标规划问题的最优条件和二元性