Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 28, 1994 - Issue 3-4
Submit an article Journal homepage
43
Views
22
CrossRef citations to date
0
Altmetric
Original Articles

An inexact approach to solving linear semi-infinite programming problems

Shu-cherng. Fang Operations Research and Industrial Engineering, North Carolina State University, Raleigh, NC, 27695-7913, U.S.A.
&
Sooni-yi. Wu Institute of Applied Mathematics, National Cheng-Kung University, Tainan, Taiwan, R.O.C
Pages 291-299 | Published online: 22 Dec 2010

Citations (22)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

E. González-Gutiérrez, L. Hernandez Rebollar & Maxim I. Todorov. (2011) Rate of convergence of a class of numerical methods solving linear inequality systems. Optimization 60:7, pages 947-957.
Read now
Fucai Wan , Dingwei Wang & Richard Y. K Fung. (2005) New product introduction planning using a 0–1 semi-infinite programming model. Production Planning & Control 16:1, pages 12-20.
Read now

Articles from other publishers (20)

E. González-Gutiérrez, L. Hernández Rebollar & Maxim I. Todorov. (2011) Relaxation methods for solving linear inequality systems: converging results. TOP 20:2, pages 426-436.
Crossref
E. González-Gutiérrez & M. I. Todorov. (2010) A relaxation method for solving systems with infinitely many linear inequalities. Optimization Letters 6:2, pages 291-298.
Crossref
Chen Ling, Qin Ni, Liqun Qi & Soon-Yi Wu. (2009) A new smoothing Newton-type algorithm for semi-infinite programming. Journal of Global Optimization 47:1, pages 133-159.
Crossref
Dingwei Wang, Richard Y.K. Fung & W.H. Ip. (2009) An immune-genetic algorithm for introduction planning of new products. Computers & Industrial Engineering 56:3, pages 902-917.
Crossref
A. Ismael F. Vaz, Edite M. G. P. Fernandes & M. Paula S. F. Gomes. (2004) SIPAMPL. ACM Transactions on Mathematical Software 30:1, pages 47-61.
Crossref
Soon-Yi Wu, Shu-Cherng Fang & Chih-Jen Lin. 2001. Semi-Infinite Programming. Semi-Infinite Programming 221 233 .
Cheng-Feng Hu & Shu-Cherng Fang. (2000) Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions. Computers & Mathematics with Applications 40:6-7, pages 721-733.
Crossref
Soon-Yi Wu & S.-C. Fang. (1999) Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method. Computers & Mathematics with Applications 38:3-4, pages 23-33.
Crossref
R. L. Sheu & S. Y. Wu. (1999) Combined Entropic Regularization and Path-Following Method for Solving Finite Convex Min-max Problems Subject to Infinitely Many Linear Constraints. Journal of Optimization Theory and Applications 101:1, pages 167-190.
Crossref
S. Y. Wu, S. C. Fang & C. J. Lin. (1998) Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems. Journal of Optimization Theory and Applications 99:3, pages 759-779.
Crossref
Y.-H. Chen & S.-C. Fang. (1998) Solving convex programming problems with equality constraints by neural networks. Computers & Mathematics with Applications 36:7, pages 41-68.
Crossref
Chih-Jen Lin, Shu-Cherng Fang & Soon-Yi Wu. (1998) An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming. SIAM Journal on Optimization 8:2, pages 443-456.
Crossref
Rembert Reemtsen & Stephan Görner. 1998. Semi-Infinite Programming. Semi-Infinite Programming 195 275 .
Y Li & D Wang. (1997) A semi-infinite programming model for earliness/tardiness production planning with simulated annealing. Mathematical and Computer Modelling 26:7, pages 35-42.
Crossref
S.-C. Fang, J. R. Rajasekera & H.-S. J. TsaoS.-C. Fang, J. R. Rajasekera & H.-S. J. Tsao. 1997. Entropy Optimization and Mathematical Programming. Entropy Optimization and Mathematical Programming 187 246 .
S.-C. Fang, J. R. Rajasekera & H.-S. J. TsaoS.-C. Fang, J. R. Rajasekera & H.-S. J. Tsao. 1997. Entropy Optimization and Mathematical Programming. Entropy Optimization and Mathematical Programming 51 124 .
Shu-Cherng Fang & H.-S. Jacob Tsao. (1996) An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints. Journal of Computational and Applied Mathematics 72:1, pages 127-139.
Crossref
Dingwei Wang & S.-C. Fang. (1996) A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm. Computers & Mathematics with Applications 31:8, pages 95-106.
Crossref
Chih-Jen Lin, Eugene K. Yang, Shu-Cherng Fang & Soon-Yi Wu. (1995) Implementation of an inexact approach to solving linear semi-infinite programming problems. Journal of Computational and Applied Mathematics 61:1, pages 87-103.
Crossref
R.-L. Sheu, S.-Y. Wu & S.-C. Fang. (1995) A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming. Computers & Mathematics with Applications 29:8, pages 7-18.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.