A note on necessary conditions in mathematical programming

Jaroslav Doležal

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A note on necessary conditions in mathematical programming”

Mathematical programming problems involving continuum of inequality constraints

Jaroslav Doležal (1982)

Kybernetika

Similarity:

A convergent algorithm for solving linear programs with an additional reverse convex constraint

Lê Dung Muu (1985)

Kybernetika

Similarity:

LFS functions in multi-objective programming

Luka Neralić, Sanjo Zlobec (1996)

Applications of Mathematics

Similarity:

We find conditions, in multi-objective convex programming with nonsmooth functions, when the sets of efficient (Pareto) and properly efficient solutions coincide. This occurs, in particular, when all functions have locally flat surfaces (LFS). In the absence of the LFS property the two sets are generally different and the characterizations of efficient solutions assume an asymptotic form for problems with three or more variables. The results are applied to a problem in highway construction,...