Displaying similar documents to “Semi-infinite programming, differentiability and geometric programming: Part II”

Duality theorems for a class of non-linear programming problems.

Shyam S. Chadha (1988)

Trabajos de Investigación Operativa

Similarity:

Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.

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,...