Upper robust mappings and vector minimization: an integral approach

Article Abstract:

An integral global optimization theory and algorithms for vector optimization are developed. It is shown that when objective mapping is assumed to be upper robust, scalarization techniques such as weighting and reference point problems can be interpreted in a more general context. These conditions can then be used to derive integral algorithms to obtain efficient solutions to a vector minimization problem.

Models, Nonlinear programming

---

Unified approaches for solvable and unsolvable linear complementarity problems

Article Abstract:

The solvability and unsolvability of general linear complementarity problems (LCPs) are studied through related global optimization problems such as multicriteria optimization, minimax optimization and quadratic programming problems.

Methods, Analysis, Linear programming, Europe

---

Vector complementarity problems with a variable ordering relation

Article Abstract:

A method for solving vector complementarity problems, using variable ordering relation, is presented.

Science & research, Research, Vector spaces, Vectors (Mathematics), Banach spaces

Similar abstracts:

• Abstracts: Predicting information technology project escalation: a neural network approach. Heuristic optimization of experimental designs
• Abstracts: Cultural revolution: Taiwan director Ang Lee takes on Jane Austen. The unkindest cut: domestic film industry hobbled by censorship
• Abstracts: A method for finding the set of non-dominated vectors for multiple objective integer linear programs

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