Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 2,378 papers for “Multiobjective programming”

Fuzzy multiobjective programming

Ricardo Coêlho Silva · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2009

Orientadores: Akebo Yamakami, Jose Luis Verdegay Galdeano

Cited by 0Open access

Multiobjective Linear Programming

Masatoshi Sakawa, Hitoshi Yano, Ichiro Nishizaki · International series in management science/operations research/International series in operations research & management science · 2013

Cited by 3

Linear multiobjective programming

Beckmann, M, K&#xfcnzi, H P, Zeleny, Milan · CERN Document Server (European Organization for Nuclear Research) · 1974

Cited by 0

Nonlinear Multiobjective Programming

Tetsuzo Tanino, Hun Kuk · International series in management science/operations research/International series in operations research & management science · 2003

Cited by 16

Multiobjective Cartesian Genetic Programming

Petrlík, Jiří · Brno University of Technology Digital Library (Brno University of Technology) · 2011

Cílem této diplomové práce je shrnout problematiku multikriteriálních genetických algoritmů a kartézského genetického programování. Podrobně je popsán algoritmus NSGAII a začlenění multikriteriální optimalizace do kartézského genetického programování (CGP). Navržená metoda multikriteriálního CGP byla ověřena na zvolených problémech z oblasti návrhu číslicových obvodů.

Cited by 0

Duality in Multiobjective Programming

Tetsuzo Tanino, Yoshikazu SAWARAGI · Transactions of the Society of Instrument and Control Engineers · 1978

In this paper, a dual problem in a wide sense is defined for a convex programming problem with multiple objective functions and the relationship between the primal problem and the dual problem is made clear.All nondominated solutions with respect to the preference order specified by a convex cone in the objective function space are considered to be solutions of the original multiobjective programming problem.First, it is shown that saddle points in an extended sense of the vector-valued Lagrangian provide solutions to the primal problem. Next, the primal problem is imbedded into a family of perturbed problems and a point-to-set map called perturbation map is defined as a map which gives optimal value sets of those problems. The meaning of the multiplier vector is made clear by the geometric study of the graph of this perturbation map. Furthermore, a class of problems called stable are defined by the perturbation map and their properties are investigated.Finally, a point-to-set map called dual map is defined over the dual variable space by a minimal point set of the vector-valued Lagrangian of the primal problem. The dual problem in a wide sense is presented through this map. The relationship between the solutions of these two problems is given as a weak duality theorem and, moreover, it is shown for stable problems that there exists a solution of the dual problem corresponding to each solution of the primal problem (strong duality theorem).

Cited by 6Open access

Multiobjective programming and planning

Cohon, Jared L. · 1978

This text takes a broad view of multiobjective programming, emphasizing the methods most useful for continuous problems. It reviews multiobjective programming methods in the context of public decision-making problems, developing each problem within a context that addresses practical aspects of planning issues. Topics include a review of linear programming, the formulation of the general multiobjective programming problem, classification of multiobjective programming methods, techniques for generating noninferior solutions, multiple-decision-making methods, multiobjective analysis of water reso

Cited by 0