Abstract: By using the concepts of contingent cone and linearizing cone of a constraint set,together with a separation theorem for convex sets,the Lagrange multiplier rule for a kind vector optimization problem with lexicographic order was obtained,and on that basis,the concept of Lagrangian function was proposed.Simultaneously,in terms of the Lagrangian function,some second-order optimality conditions for strict efficiency of vector optimization problems were established.