Pith. sign in

REVIEW

A Method for Generating a Well-Distributed Pareto Set in Nonlinear Multiobjective Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0512055 v1 pith:BYOFKSIP submitted 2005-12-02 math.OC

classification math.OC
keywords methodoptimizationdesignparetofindmanymultidisciplinarynonlinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In multidisciplinary optimization the designer needs to find solution to optimization problems which include a number of usually contradicting criteria. Such a problem is mathematically related to the field of nonlinear vector optimization where there are many numerical methods capable of providing a solution. However, only a few of those are suitable for real multidisciplinary design in industry because an iteration design circle usually is very time-consuming. This is due to the time scales and computational resources associated with each iterative design cycle. The recently suggested Physical Programming Method appears to match many requirements raised in industrial applications. The method is modified to make its realization easier and more efficient, the main focus being the even generation of the complete Pareto set. The method is used to find the Pareto surface for different test cases.

Discussion (0). Sign in to comment.

Pith tools