Zhong-Ping Wan

Optimality Conditions and Duality for Nonsmooth Multiobjective Optimization Problems with Cone Constraints and Applications

  • Jiawei Chen
  • Zhong-Ping Wan
  • Zheng Yue
    • Categories Nonsmooth Optimization, Other Topics Tags , , , , , ,

    In this work, a nonsmooth multiobjective optimization problem involving generalized invexity with cone constraints and Applications (for short, (MOP)) is considered. The Kuhn-Tucker necessary and sufficient conditions for (MOP) are established by using a generalized alternative theorem of Craven and Yang. The relationship between weakly efficient solutions of (MOP) and vector valued saddle points of … Read more

    Construction project scheduling problem with uncertain resource constraints

  • Tang Guochun
  • Zhong-Ping Wan
  • Julin He
    • Categories Applications - Science and Engineering, Scheduling

    This paper discusses that major problem is the construction project scheduling mathematical model and a simple algorithm in the uncertain resource environments. The project scheduling problem with uncertain resource constraints comprised mainly three parties: one of which its maximal limited capacity is fixed throughout the project duration; second maximal limited resource capacity is random variable; … Read more

    Genetic Algorithm for Solving Convex Quadratic Bilevel Programming Problem

  • Zhong-Hua An
  • Zhong-Ping Wan
  • Guang-Min Wang
  • Xian-Jia Wang
    • Categories Nonlinear Optimization Tags , ,

    This paper presents a genetic algorithm method for solving convex quadratic bilevel programming problem. Bilevel programming problems arise when one optimization problem, the upper problem, is constrained by another optimization, the lower problem. In this paper, the bilevel convex quadratic problem is transformed into a single level problem by applying Kuhn-Tucker conditions, and then an … Read more

    Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms

  • Zhong-Ping Wan
  • Guang-Min Wang
  • Xian-Jia Wang
    • Categories Linear, Cone and Semidefinite Programming, Multi-Criteria Optimization, Nonlinear Optimization Tags , ,

    The paper studies and designs an genetic algorithm (GA) of the bilevel linear programming problem (BLPP) by constructing the fitness function of the upper-level programming problem based on the definition of the feasible degree. This GA avoids the use of penalty function to deal with the constraints, by changing the randomly generated initial population into … Read more

    Asymptotic approximation method and its convergence on semi-infinite programming

  • Zhong-Ping Wan
    • Categories Semi-infinite Programming

    The aim of this paper is to discuss an asymptotic approximation model and its convergence for the minimax semi-infinite programming problem. An asymptotic surrogate constraints method for the minimax semi-infinite programming problem is presented making use of two general iscreteapproximation methods. Simultaneously, we discuss the consistenceand the epi-convergence of the asymptotic approximation problem. Citation School … Read more