Set covering-based surrogate approach for solving sup-$${\mathcal{T}}$$ equation constrained optimization problems

  • Authors:
  • Cheng-Feng Hu;Shu-Cherng Fang

  • Affiliations:
  • Department of Industrial Engineering and Management, I-ShouUniversity, Kaohsiung, Taiwan 840;Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, USA 27695-7906

  • Venue:
  • Fuzzy Optimization and Decision Making
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work considers solving the sup- $${\mathcal{T}}$$ equation constrained optimization problems from the integer programming viewpoint. A set covering-based surrogate approach is proposed to solve the sup- $${\mathcal{T}}$$ equation constrained optimization problem with a separable and monotone objective function in each of the variables. This is our first trial of developing integer programming-based techniques to solve sup- $${\mathcal{T}}$$ equation constrained optimization problems. Our computational results confirm the efficiency of the proposed method and show its potential for solving large scale sup- $${\mathcal{T}}$$ equation constrained optimization problems.