| Article ID: | iaor19942424 |
| Country: | Netherlands |
| Volume: | 57 |
| Issue: | 3 |
| Start Page Number: | 381 |
| End Page Number: | 394 |
| Publication Date: | Mar 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Kostreva Michael M., Ordoyne Thomas J., Wiecek Malgorzata |
An approach to solving multiple-objective programming problems with polynomial objectives and polynomial constraints is developed. The notions of pre-efficient solution and local efficient solution are investigated relative to the signal-objective problem of Benson. Illustrative examples are presented in which the solutions are obtained by means of homotopy continuation.