(p, r)-Invexity in multiobjective programming

Article Abstract:

A generalization of convexity, namely (p, r)-invexity, is considered in the case of nonlinear multi-objective programming problems where the functions involved are differentiable. Some duality results are obtained for such optimization problems.

Duality theory (Mathematics)

---

Some geometrical aspects of the efficient line in vector optimization

Article Abstract:

A geometrical scheme indicating the relationship between the proper ideal points and the extreme points and also between the proper ideal points and the denting points is presented. The said relationship is useful in vector optimization.

Spain, Geometric constructions

---

An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint

Article Abstract:

A method for solving nonlinear multi-objective optimization problems with separable discrete variables and a single constraint is presented.

Japan, Nonlinear theories, Discrete mathematics

Similar abstracts:

• Abstracts: Stability on multiobjective dynamic programming problems with fuzzy parameters in the objective functions and in the constraints
• Abstracts: The problem of the optimal biobjective spanning time. A discretizing algorithm for location problems. The multiscenario lot size problem with concave costs
• Abstracts: CIA is accused of misleading Italy on cleric. EU pushes ahead with expansion despite the public's growing unease
• Abstracts: Fuzzy scores of technical efficiency. A note on conflict resolution and truthtelling. Super efficiency evaluations based on potential slack
• Abstracts: The dimension for the European Union Council under the nice rules. The distribution problem, the more for less (nothing) paradox and economies of scale and scope

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.