Multi-Objective Linear Programming (MOLP)
Also known as: MOLP, Vector Linear Programming, Multi-criteria LP, Linear Vector Optimization
Multi-Objective Linear Programming (MOLP) extends classical linear programming to handle several conflicting linear objective functions simultaneously over a feasible region defined by linear constraints. Instead of a single optimal solution, MOLP produces a Pareto-efficient frontier from which a decision-maker selects a preferred trade-off. It is foundational to operations research and management science for resource allocation, planning, and design problems with competing goals.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use MOLP when the problem has multiple competing linear objectives and linear constraints, data are continuous and precisely known (or can be treated as deterministic), and the decision-maker needs to understand trade-offs explicitly rather than accept a pre-aggregated score. Typical settings include production planning, portfolio allocation, transportation routing, and public resource budgeting. Do NOT use when objectives or constraints are non-linear (use multi-objective nonlinear programming or metaheuristics instead), when data are discrete or binary (use multi-objective integer programming), when the number of objectives exceeds five or six (the efficient frontier becomes computationally unwieldy), or when the decision-maker is unwilling to engage in iterative preference elicitation.
Strengths & limitations
- Produces the full Pareto-efficient frontier, giving decision-makers a complete picture of trade-offs.
- Computationally tractable for moderate problem sizes via simplex-based solvers.
- Guarantees mathematical optimality of every point on the efficient frontier.
- Well-supported by mature software (CPLEX, Gurobi, open-source alternatives).
- Trade-offs are made explicit rather than collapsed into an opaque composite index.
- Restricted to linear objective functions and linear constraints; real-world problems are often non-linear.
- The efficient frontier can contain exponentially many extreme points in higher dimensions, making comprehensive enumeration impractical.
- Requires precise numerical data; uncertainty or fuzziness in coefficients is not natively handled.
- Interactive methods depend heavily on the decision-maker's availability and ability to articulate preferences consistently.
Frequently asked
How is MOLP different from goal programming?
Goal programming is a special case or variant: it converts each objective into an aspiration level and then minimizes deviations from those targets, yielding a single solution. MOLP in its general form seeks to characterize the full efficient frontier without pre-specifying target levels, giving the decision-maker more flexibility.
Can MOLP handle more than two objectives?
Yes, but the Pareto frontier becomes harder to visualize beyond two or three objectives and the number of efficient extreme points can grow exponentially. Interactive methods and representative-subset techniques are recommended for four or more objectives.
What if my data are uncertain?
Standard MOLP assumes deterministic coefficients. Uncertainty can be addressed by extending to stochastic multi-objective linear programming (chance constraints, scenario-based approaches) or robust multi-objective optimization, which are separate methods.
Is MOLP the same as multi-objective optimization?
MOLP is a special case of multi-objective optimization where all objectives and constraints are linear. Multi-objective optimization is the broader field that also includes non-linear, integer, and combinatorial variants.
Which scalarization method should I use?
The weighted-sum method is simple but misses non-convex parts of the frontier. The epsilon-constraint method can recover the full frontier even for non-convex regions and is generally preferred for thorough analysis. Interactive methods are best when decision-maker engagement is possible.
Sources
- Steuer, R. E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application. John Wiley & Sons, New York. ISBN: 9780471888468
- Chankong, V., Haimes, Y. Y. (1983). Multiobjective Decision Making: Theory and Methodology. North-Holland, New York. link ↗
How to cite this page
ScholarGate. (2026, June 3). Multi-Objective Linear Programming (MOLP). ScholarGate. https://scholargate.app/en/simulation/multi-objective-linear-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- GOAL-PROGRAMMINGDecision-making↔ compare
- Linear ProgrammingOptimization↔ compare
- Multi-Objective OptimizationSimulation↔ compare