Study on Convex Analysis and Optimization

In this paper , at first , we review some preliminaries from convex analysis , operation research and linear algebra . Then , convex objective programming are introduced . Different concepts of optimality for a convex programming are discussed and some fundamental theorems and methods for distinguishing and finding optimal (efficient) solutions are studied . Moreover , Krush-Kuhn-Tucker method as an important method is presented programming problem . Finally , we have solved some examples to illustrate the ability and reliability of method