Characterizations of the basic constraint qualification and its applications

Authors

  • D. Kuroiwa Department of Mathematics, Shimane University, 1060, Nishikawatsu, Matsue, Shimane 690-8504, Japan
  • S. Suzuki Department of Mathematics, Shimane University, 1060, Nishikawatsu, Matsue, Shimane 690-8504, Japan
  • S. Yamamoto Department of Mathematics, Shimane University, 1060, Nishikawatsu, Matsue, Shimane 690-8504, Japan

Keywords:

convex programming, constraint qualification, alternative theorem

Abstract

In convex programming, the basic constraint qualification is a necessary and sufficient constraint qualification for the optimality condition. In this paper, we give characterizations of the basic constraint qualification
at each feasible solution. By using the result, we give an alternative method for checking up the basic constraint qualification at every feasible point without subdifferentials and normal cones.

Additional Files

Published

2020-10-19

How to Cite

Kuroiwa, D., Suzuki, S., & Yamamoto, S. (2020). Characterizations of the basic constraint qualification and its applications. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 11(2), 99-109. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/555

Issue

Section

Research Article