Results 241 to 250 of about 572,594 (291)
Some of the next articles are maybe not open access.

A GEOMETRIC PROGRAMMING APPROACH TO CONVEX MULTI-OBJECTIVE PROGRAMMING PROBLEMS

jnanabha, 2023
Over the past few years, convex optimization has played a vital role in the study of complex engineering problems in different fields. Geometric programming is one of the available techniques particularly used for solving nonconvex programming problems.
Ota, Rashmi Ranjan, Mishra, Sudipta
openaire   +1 more source

Fuzzy multi-objective programming: A systematic literature review

Expert Systems with Applications, 2022
Multi-objective programming is commonly used in the literature when conflicted objectives arise in solving optimization problems. Over the past decades, classical optimization methods have been developed as useful tools to discover optimal solutions for multi-objective problems (MOPs).
Negar Karimi   +3 more
openaire   +2 more sources

On a variant of lexicographic multi-objective programming

European Journal of Operational Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Solution analysis of multi-objective programming problem

2013 International Conference on Machine Learning and Cybernetics, 2013
Weighted ideal point method converts a multi-objective programming problem into a single objective programming problem. Solving corresponding single objective programming problem, some Pareto optimal solutions of the original multi-objective programming problem can be found.
Guo-Li Zhang, Hua Zuo
openaire   +1 more source

Multi-Objective Genetic Programming for object detection

IEEE Congress on Evolutionary Computation, 2010
In object detection, the goals of successfully discriminating between different kinds of objects (object classification) and accurately identifying the positions of all objects of interest in a large image (object localisation) are potentially in conflict.
Thomas Liddle   +2 more
openaire   +1 more source

Multi-Objective Programs

2001
In this chapter we study the problem of simultaneous optimization of several objective functions on an implicitly constrained feasible set.
openaire   +1 more source

Multi-Objective Semantic Mutation for Genetic Programming

2018 IEEE Congress on Evolutionary Computation (CEC), 2018
Genetic Programming is a branch of Evolutionary Computation devoted to the evolution of programs. Several genetic operators have been proposed to increase the power of the search, given that the space of admissible programs is very challenging to be properly explored toward high quality solutions.
Joao Victor C. Fracasso   +1 more
openaire   +1 more source

Robustness in nonsmooth nonlinear multi-objective programming

European Journal of Operational Research, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moslem Zamani   +2 more
openaire   +2 more sources

Convex composite multi-objective nonsmooth programming

Mathematical Programming, 1993
The authors deal with a kind of convex composite multiobjective nonsmooth programming. They present first order Lagrangian necessary conditions and new sufficient optimality conditions of efficient and properly efficient solutions, and duality results for (convex) composite problems, thus providing a unified framework for studying multiobjective ...
Vaithilingam Jeyakumar, Xiaoqi Yang 0001
openaire   +2 more sources

Multi-objective stochastic programming for portfolio selection

European Journal of Operational Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fouad Ben Abdelaziz   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy