An interactive multiobjective nonlinear programming procedure

Article Abstract:

An interactive multiobjective nonlinear programming procedure for solving problems is presented. Alternative schemes for the implementation of the generalized reduced gradient code for solving nonlinear optimization problems are also proposed. The methodology includes derivation of a subset of efficient solutions, interactive definition by decision maker of desired structure depending on desired result and identification of a compromise solution applying nonlinear optimization.

Models, Nonlinear programming

---

Symmetric duality for nonlinear programming problem involving nonlinear-bonvex functions

Article Abstract:

A pair of second order symmetric dual nonlinear programming problems under nonlinear-pseudo-bonvexity assumptions on the functions and arbitrary cones is presented. Three theorems and corresponding proofs are presented along with definitions of terms. The results support the existence of a second order of problems under weak, strong and converse duality theorems established under pseudobonvexity and pseudoboncavity functions.

Operations Research, Management science, Reports, Testing, Nonlinear theories

---

Comparative studies in interactive multiple objective mathematical programming

Article Abstract:

The advent of interactive software is expected to lead to the use of multiple objective mathematical programming (MOMP) concepts as decision making tools for industrial applications. However, comparative studies should first be carried out to determine the advantages and disadvantages of MOMP procedures before they can be applied to real decision making situations.

Methods, Decision-making, Decision making, Usage, Interactive computer systems, Interactive media

Similar abstracts:

• Abstracts: Efficient solutions for the linear bilevel programming problem. Continuous optimization: suboptimality for multiobjective programming on Banach space
• Abstracts: An interactive layout heuristic based on hexagonal adjacency graphs. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Abstracts: Policy objectives and performance in a mixed market with bargaining. Information sharing, information free-riding and capital structure in oligopolies
• Abstracts: Painter whose job is to recreate Mao. China briefing : Labour rights. Frustration in Peking
• Abstracts: A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems

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