Related Experiment Video
Updated: Sep 20, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Inverse optimization for multi-objective linear programming
Mostafa Naghavi1, Ali Asghar Foroughi1, Masoud Zarepisheh2
1Department of Mathematics, University of Qom, Qom, Iran.
Abstract:
This paper generalizes inverse optimization for multi-objective linear programming where we are looking for the least problem modifications to make a given feasible solution a weak efficient solution. This is a natural extension of inverse optimization for single-objective linear programming with regular "optimality" replaced by the "Pareto optimality". This extension, however, leads to a non-convex optimization problem. We prove some special characteristics of the problem, allowing us to solve the non-convex problem by solving a series of convex problems.
More Related Videos
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Multi-input and Multi-variable systems
In the absence...
Statically Indeterminate Problem Solving
Two-Dimensional Force System: Problem Solving
The first step to solving a two-dimensional force system problem is to draw a free-body diagram of the object under consideration. This diagram helps identify all the external forces acting on the object, including their...
Reduced Mass Coordinates: Isolated Two-body Problem
Distributed Loads: Problem Solving

