K
Kin Keung Lai
Researcher at Shenzhen University
Publications - 587
Citations - 15177
Kin Keung Lai is an academic researcher from Shenzhen University. The author has contributed to research in topics: Supply chain & Artificial neural network. The author has an hindex of 60, co-authored 547 publications receiving 13120 citations. Previous affiliations of Kin Keung Lai include City University of Hong Kong & North China Electric Power University.
Papers
More filters
Journal ArticleDOI
Optimal financing mode selection for a capital-constrained retailer under an implicit bankruptcy cost
TL;DR: In this article, the authors explore how such a cost affects a capital-constrained retailer's financing mode selection decision between bank credit financing and trade credit financing (TCF), and propose two approaches to solve the problems.
Journal ArticleDOI
Nondifferentiable minimax fractional programming under generalized univexity
TL;DR: In this paper, a Kuhn-Tucker-type sufficient optimality condition for an optimal solution to the minimax fractional programming problem is derived and strong and converse duality theorems for the problem and its three different forms of dual problems.
Journal ArticleDOI
Forecasting China’s Foreign Trade Volume with a Kernel-Based Hybrid Econometric-Ai Ensemble Learning Approach
TL;DR: Experimental results reveal that the hybrid econometric-AI ensemble learning approach can significantly improve the prediction performance over other linear and nonlinear models listed in this study.
Journal ArticleDOI
Replenishment routing problems between a single supplier and multiple retailers with direct delivery
TL;DR: Using number theory, especially the Chinese remainder theorem, an algorithm is presented to calculate a feasible routing so that the supplier can replenish the selected retailers on the selected periods without shortages.
Journal ArticleDOI
Second order symmetric duality in multiobjective programming involving generalized cone-invex functions
Shashi Kant Mishra,Kin Keung Lai +1 more
TL;DR: A pair of Mond–Weir type second order symmetric dual multiobjective programs is formulated over arbitrary cones and weak, strong and converse duality theorems are established under generalized invexity assumptions.