SIMPLEKS METHOD FOR BIOBJECTIVE LINEAR PROGRAMMING
Optimization is one of the main component in industrial world. Optimization can be used to maximize profit, minimize waste, maximize selling price and others. Real world problem usually have two or more objective functions, but the commonly studied optimization is optimization with a single objectiv...
Saved in:
Main Author: | RYAN ARDIAN (NIM: 10114091), ALFONSUS |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/25354 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
A derivative-free trust-region method for biobjective optimization
by: Ryu, J.-H., et al.
Published: (2014) -
An efficient solution to biobjective generalized assignment problem
by: Zhang, C.W., et al.
Published: (2014) -
Optimasi formulasi tablet Deksametason dengan simpleks sekuensial
by: , SETIANTO, Arif Budi, et al.
Published: (2005) -
Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
by: Zhang, C.W., et al.
Published: (2014) -
An effective evolutionary algorithm for the biobjective full truckload transportation service procurement problem
by: Mo Zhang, et al.
Published: (2020)