Hao-Chun Lu

Dr. Hao-Chun Lu


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 August 2013 in Management Decision
Verified
Journal Article
Closed access
KTKuo-An Tseng
Kuo-An Tseng
YLYu-Wen Lan
Yu-Wen Lan
HLHao-Chun Lu
Hao-Chun Lu
PCPin-Yu Chen
Pin-Yu Chen
Purpose: – The purpose of this paper is to explore the mediating effect of business strategy (BS) on intellectual capital (IC) and financial performance (FP). The impact of financial crisis is also a major topic of this research. Design/methodology/approach: – This study applies BS as mediator to explore the relationships between IC, BS, and FP. Partial least squares is employed to test the reliability and validity of measurements and the significance of path coefficients, and therefore to examine the hypotheses. Findings: – IC has significant impacts on BS and FP in all samples, as well as in those years before and after the financial crisis. BS has a partial significant mediating effect between IC and FP. BS has significant effects on FP in all samples and pre-financial crisis, but has not in post-financial crisis. Research limitations/implications: – IC has significant impacts on BS and FP. Moreover, the relationships of IC, BS, and FP are different during pre- and post-financial crisis. The direct effect of IC on FP is confirmed and consistent, and the indirect effect of IC on FP by BS is dependent upon the environment status. Practical implications: – Enterprises should pay attention to IC, BS, and the related changes in environment status. These help enterprises develop appropriate strategies, maintain competitive advantage, and upgrade FP. Originality/value: – This study applies BS as mediator, and explores the relationships between IC, BS, and FP. The impact of financial crisis is also discussed. The results may serve as the criteria for strategic performance management.

1 June 2009 in Operations Research
Verified
Journal Article
Closed access
HLHan-Lin Li
Han-Lin Li
HLHao-Chun Lu
Hao-Chun Lu
Many optimization problems are formulated as generalized geometric programming (GGP) containing signomial terms f(X)·g(Y), where X and Y are continuous and discrete free-sign vectors, respectively. By effectively convexifying f(X) and linearizing g(Y), this study globally solves a GGP with a lower number of binary variables than are used in current GGP methods. Numerical experiments demonstrate the computational efficiency of the proposed method.

1 May 2009 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
HLHan-Lin Li
Han-Lin Li
HLHao-Chun Lu
Hao-Chun Lu
CHChia-Hui Huang
Chia-Hui Huang
NHNian-Ze Hu
Nian-Ze Hu
Many nonlinear programs can be piecewisely linearized by adding extra binary variables. For the last four decades, several techniques of formulating a piecewise linear function have been developed. By expressing a piecewise linear function with m + 1 break points, the current method requires us to use m additional binary variables and 4m constraints, which causes heavy computation when m is large. This study proposes a superior way of expressing the same piecewise linear function, where only ⌈ log 2 m ⌉ binary variables and 8 + 8 ⌈ log 2 m ⌉ additive constraints are used. Various numerical experiments demonstrate that the proposed method is more computationally efficient than current methods.

1 October 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
HLHao-Chun Lu
Hao-Chun Lu
Feng-Jang HwangFeng-Jang Hwang
Feng-Jang Hwang
YHYao-Huei Huang
Yao-Huei Huang

1 July 2016 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
YHYao-Huei Huang
Yao-Huei Huang
Feng-Jang HwangFeng-Jang Hwang
Feng-Jang Hwang
HLHao-Chun Lu
Hao-Chun Lu

6 September 2021 in IEEE Access
Verified
Journal Article
Open access
HTHsuan-Yu Tseng
Hsuan-Yu Tseng
Pao-Hsien ChuPao-Hsien Chu
Pao-Hsien Chu
HLHao-Chun Lu
Hao-Chun Lu
MTMing-Jyh Tsai
Ming-Jyh Tsai
Particle swarm optimization (PSO) is a popular stochastic approach for solving practical optimal problems from industries due to its effective performance and few hyperparameters. Nonlinear constrained optimization (NCO) problems frequently cause multiple optimal regions and can cause many infeasible regions in the search space. The state-of-the-art approaches for handling the infeasible regions generated by problems’ constraints either block particles’ paths or penalize NCO problems’ objective values based on the standard updating velocity formula. The standard updating velocity formula introduces difficulties for particles in searching the undiscovered optimal solutions separated by infeasible regions and being mutually restrained on directions by social and cognitive factors. Afterward, the particles cause premature convergence and difficulty searching the undiscovered optimal regions to improve their solutions. Observing the biological ant colony and inspired by lazy ant behavior, this study proposes an easy particle that simulates the lazy ant to diversify the moving direction. Finally, this study integrates the proposed easy particles with referenced PSO-based approaches for solving NCO problems. The experiment results show that the proposed easy particles can effectively reinforce exploration abilities and improve the performances of all referenced PSO-based algorithms to reduce the status of premature convergence in solving NCO problems.