An efficient method for solving linear goal programming problems
From MaRDI portal
Publication:2565024
DOI10.1007/BF02190009zbMath0866.90112MaRDI QIDQ2565024
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ A new group ranking approach for ordinal preferences based on group maximum consensus sequences ⋮ A fuzzy ranking method with range reduction techniques ⋮ A robust optimization model for multi-site production planning problem in an uncertain environment ⋮ EFFICIENT STRUCTURES OF ACHIEVEMENT FUNCTIONS FOR GOAL PROGRAMMING MODELS ⋮ Solve least absolute value regression problems using modified goal programming techniques. ⋮ A robust optimization model for a cross-border logistics problem with fleet composition in an uncertain environment. ⋮ Scheduling quay cranes and yard trucks for unloading operations in container ports ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems ⋮ Reformulation of the modified goal programming for logarithmic piecewise linear function ⋮ On the mixed binary goal programming problems ⋮ Method for solving quasi-concave and non-concave fuzzy multi-objective programming problems ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ A robust data envelopment analysis model with different scenarios ⋮ Interval goal programming for S-shaped penalty function ⋮ Visualizing preferences on spheres for group decisions based on multiplicative preference relations ⋮ A global optimization method for nonconvex separable programming problems ⋮ A modified goal programming model for piecewise linear functions
Cites Work
