Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Application and comparison of three multiobjective linear programming methods
A biobjective production planning problem was modelled using the Compromise Constraint Biobjective LP (CCBLP) method, the traditional Weighted-sum Scalarization (WSS) and Non-preemptive Goal Programming (NGP) approaches. Various preference indices were used to explore the tradeoff options and the L1...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2011
|
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Application and comparison of three multiobjective linear programming methods
- A Comparison of Benson’s Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm
- A framework for the generation method of solar thermal collaborative building form based on multiobjective optimization
- Multiobjective Green Time-Dependent Location-Routing Problem and Algorithms
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- Evolutionary Dynamic Multiobjective Optimisation Assisted by Inverse Regression Tree Predictor
- Comparison of compromise constraint bi-objective LP method and three traditional weighted criteria methods