CHARACTERIZATIONS OF THE BASIC CONSTRAINT QUALIFICATION AND ITS APPLICATIONS

Authors

  • DAISHI KUROIWA Department of Mathematics, Shimane University, 1060, Nishikawatsu, Matsue, Shimane 690-8504, Japan
  • SATOSHI SUZUKI Department of Mathematics, Shimane University, 1060, Nishikawatsu, Matsue, Shimane 690-8504, Japan
  • SHUNSUKE 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

10/19/2020

Issue

Vol. 11 No. 2 (2020): JNAO

Section

Research Articles

License

Copyright (c) 2024 Journal of Nonlinear Analysis and Optimization: Theory & Applications (JNAO)

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Copyright (c) 2010 Journal of Nonlinear Analysis and Optimization: Theory & Applications

Creative Commons License

This work is licensed under aย Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.