Works (395)

Updated: December 3rd, 2024 07:15

2024 journal article

A NEW GLOBAL ALGORITHM FOR HOMOGENEOUS COMPLEX QUADRATIC PROGRAMMING PROBLEMS AND APPLICATIONS

PACIFIC JOURNAL OF OPTIMIZATION, 20(4), 667–682.

By: Y. Xu, J. Xut, C. Lu, S. Fang* & Z. Deng*

author keywords: semidefinite relaxation; branch-and-bound algorithm; complex quadratic programming; beam- former design
Sources: Web Of Science, NC State University Libraries
Added: December 2, 2024

2024 journal article

A distributionally robust chance-constrained kernel-free quadratic surface support vector machine

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 316(1), 46–60.

By: F. Lin n, S. Fang n, X. Fang n, Z. Gao* & J. Luo*

author keywords: Data science; Kernel-free support vector machine; Robust classification; Distributionally robust optimization; Chance-constrained optimization
Sources: Web Of Science, NC State University Libraries, ORCID
Added: May 7, 2024

2024 journal article

Collaborative supply chain network design under demand uncertainty: A robust optimization approach

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 279.

By: Q. Zhang, Z. Wang*, M. Huang, H. Wang, X. Wang & S. Fang*

author keywords: Supply chain network design; Collaboration; Robust optimization; Cost-saving allocation
Sources: ORCID, Web Of Science, NC State University Libraries
Added: November 28, 2024

2024 journal article

Distributionally robust chance-constrained kernel-based support vector machine

COMPUTERS & OPERATIONS RESEARCH, 170.

By: F. Lin*, S. Fang*, X. Fang* & Z. Gao

author keywords: Uncertainty; Support vector machine; Distributionally robust optimization; Data-driven approach; ADMM
Sources: Web Of Science, NC State University Libraries
Added: July 30, 2024

2024 journal article

Enhancing supply chain coordination through transparency initiatives to mitigate product returns

JOURNAL OF RETAILING AND CONSUMER SERVICES, 78.

By: L. Zhao*, W. Guo*, S. Fang n & Q. Anc

author keywords: Product return; Transparency effort; Supply chain coordination; Remanufacturing
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: April 15, 2024

2024 journal article

Fourth-party logistics network design with demand surge: A greedy scenario-reduction and scenario-price based decomposition algorithm

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 269.

author keywords: Fourth-party logistics network (4PLN) design; Unpredictable demand surge; Service level; Chance-constrained stochastic programming; Decomposition algorithm
Sources: ORCID, Web Of Science, NC State University Libraries
Added: January 12, 2024

2024 article

Multi-period fourth-party logistics network design from the viability perspective: a collaborative hyper-heuristic embedded with double-layer Q-learning algorithm

Zhang, Y., Huang, M., Gao, Z., Jiang, S., Fang, S.-C., & Wang, X. (2024, April 12). INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, Vol. 4.

author keywords: 4PL network design; viability; collaborative hyper-heuristic; double-layer Q-learning; stress tests
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: April 29, 2024

2024 journal article

Multi-period fourth-party logistics network design with the temporary outsourcing service under demand uncertainty

COMPUTERS & OPERATIONS RESEARCH, 164.

By: M. Yin*, M. Huang*, D. Wang*, S. Fang n, X. Qian* & X. Wang

author keywords: Logistics; Supply chain design; Temporary outsourcing service; Uncertain demand; Lagrangian relaxation
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: March 11, 2024

2023 article

A New Global Algorithm for Max-Cut Problem with Chordal Sparsity

Lu, C., Deng, Z., Fang, S.-C., & Xing, W. (2023, March 20). JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, Vol. 3.

By: C. Lu*, Z. Deng*, S. Fang n & W. Xing*

author keywords: Max-cut; Branch-and-bound; Sparsity pattern
TL;DR: A semidefinite relaxation-based branch-and-bound algorithm that exploits the chordal sparsity patterns of the max-cut problem and proposes a new branching rule called hierarchy branching rule, which utilizes the tree decomposition of the sparsity pattern. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: April 17, 2023

2023 journal article

Price competition and cost efficiency facing buyer's bounded rationality

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 266.

By: S. Luo*, S. Fang n, J. Zhang* & R. King n

author keywords: Behavior; Nash equilibrium; Price dispersion; Salience and exploitation; Social welfare
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: November 27, 2023

2023 journal article

Unifying colors by primes

LIGHT-SCIENCE & APPLICATIONS, 12(1).

By: H. Li*, S. Fang n, B. Lin* & W. Kuo*

TL;DR: The proposed C_235 system offers a unified representation for the efficient encoding and effective manipulation of color that can be applied to designing a high-rate LCD system and colorizing objects with multiple attributes and DNA codons, opening the door to manipulating colors and lights for even broader applications. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: February 27, 2023

2022 article

A Polynomial-Time Algorithm with Tight Error Bounds for Single-Period Unit Commitment Problem

Gao, R.-T., Fang, S.-C., Lu, C., & Xing, W.-X. (2022, January 28). JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, Vol. 1.

By: R. Gao*, S. Fang n, C. Lu* & W. Xing*

author keywords: Nonlinear programming; Lagrangian dual; Unit commitment problem; Mixed-integer quadratic programming; Convex relaxation
TL;DR: Tight theoretical bounds for the absolute errors and relative errors of the approximate solutions generated by the proposed Lagrangian dual-based polynomial-time approximation algorithm for solving the single-period unit commitment problem are provided. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: February 7, 2022

2022 journal article

A joint model of location, inventory and third-party logistics provider in supply chain network design

COMPUTERS & INDUSTRIAL ENGINEERING, 174.

By: H. Wang*, S. Fang n, M. Huang*, Q. Zhang* & Z. Deng*

author keywords: Integrated supply chain network design; Location-inventory model; Third-party logistics provider; Generalized Benders decomposition
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: January 17, 2023

2022 journal article

A robust support vector regression model for electric load forecasting

INTERNATIONAL JOURNAL OF FORECASTING, 39(2), 1005–1020.

By: J. Luo*, T. Hong*, Z. Gao* & S. Fang n

author keywords: Cybersecurity; Electric load forecasting; Support vector regression; Data integrity attacks; Weight function
TL;DR: This paper proposes a robust support vector regression (SVR) model to forecast the electric demand under data integrity attacks, and introduces a weight function to calculate the relative importance of each observation in the load history, and constructs a weighted quadratic surface SVR model. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: April 4, 2023

2022 journal article

Heterogeneous multi-depot collaborative vehicle routing problem

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 160, 1–20.

By: Q. Zhang*, Z. Wang*, M. Huang*, Y. Yu* & S. Fang n

author keywords: Vehicle routing; Multiple heterogeneous depots; Collaborative distribution; Benders? decomposition; Combinatorial Benders? cuts
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: June 13, 2022

2022 article

Multi-period distribution network design with boundedly rational customers for the service-oriented manufacturing supply chain: a 4PL perspective

Zhang, Y., Gao, Z., Huang, M., Jiang, S., Yin, M., & Fang, S.-C. (2022, November 11). INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, Vol. 11.

author keywords: SOM supply chain network design; 4PL; bounded rationality behaviour; individual-driven Q-learning; memetic particle swarm optimisation algorithm
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: November 28, 2022

2022 journal article

Robust kernel-free support vector regression based on optimal margin distribution

Knowledge-Based Systems, 253, 109477.

By: J. Luo, S. Fang*, Z. Deng & Y. Tian

author keywords: Support vector regression; Optimal margin distribution; Kernel-free SVM; Robust forecasting model; Battery power consumption forecasting
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: September 20, 2022

2021 article

A NEW HYBRID l(p)-l(2) MODEL FOR SPARSE SOLUTIONS WITH APPLICATIONS TO IMAGE PROCESSING

Gao, X., Bai, Y., Fang, S.-cherng, Luo, J., & LI, Q. (2021, December). JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, Vol. 12.

By: X. Gao*, Y. Bai*, S. Fang n, J. Luo* & Q. Li*

author keywords: Sparse optimization; hybrid of the l(P) quasi-norm and l(2) norm; optimality conditions; image processing
TL;DR: Computational experiments on image recovery and deblurring problems clearly confirm the superiority of the proposed model over several state-of-the-art models in terms of the signal-to-noise ratio and computational time. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: December 20, 2021

2021 journal article

A novel kernel-free least squares twin support vector machine for fast and accurate multi-class classification

Knowledge-Based Systems, 226, 107123.

By: Z. Gao*, S. Fang n, X. Gao*, J. Luo* & N. Medhin n

author keywords: Multi-class classification; Least squares twin support vector machine; Double well potential; Kernel-free SVM; Imbalanced data
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: July 6, 2021

2021 journal article

An analysis of optimal ordering policies for a two-supplier system with disruption risk

Omega - The International Journal of Management Science, 105, 102517.

By: S. Luo*, S. Ahiska n, S. Fang n, R. King n, D. Warsing n & S. Wu n

author keywords: Dual sourcing; Unreliable supply; (s, S) policy
TL;DR: This paper investigates the effects of parameter changes on the optimal policy and demonstrates that the two-supplier ordering policy is optimal under a wide range of system parameters beyond the conditions required in the optimality proof. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: July 15, 2021

2021 journal article

Optimal planar facility location with dense demands along a curve

Journal of the Operational Research Society, 73(8), 1844–1855.

By: J. Zhou*, S. Fang n, S. Jiang* & S. Ju*

author keywords: Facility location; dense demand; alternative location and allocation approach; p-median problem
Sources: Web Of Science, NC State University Libraries
Added: May 17, 2021

2021 article

PREFACE

Fang, S.-C., Sheu, R.-L., & Tanaka, T. (2022, March). NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, Vol. 12, pp. I-II.

By: S. Fang*, R. Sheu & T. Tanaka

Sources: Web Of Science, NC State University Libraries
Added: November 29, 2021

2020 journal article

A Prime-Logarithmic Method for Optimal Reliability Design

IEEE Transactions on Reliability, 70(1), 146–162.

By: H. Li*, Y. Huang*, S. Fang n & W. Kuo*

author keywords: Linear reformulation; optimal reliability design (ORD) problem; prime numbers; prime-logarithmic linearization technique
TL;DR: Using the special property of prime factorization and adopting the logarithmic expression technique, this article proposes a novel linear reformulation model of the ORD problem requiring binary variables, continuous variables, and very few linear constraints. (via Semantic Scholar)
Sources: Crossref, Web Of Science, NC State University Libraries, ORCID
Added: March 20, 2021

2020 journal article

A dual-channel supply chain problem with resource-utilization penalty: Who can benefit from sales effort?

Journal of Industrial & Management Optimization, 17(5), 2837–2853.

By: L. Zhao, J. You & S. Fang*

author keywords: dual-channel; pricing strategy; sales effort; resource-utilization penalty; Supply chain management
Sources: Web Of Science, Crossref, NC State University Libraries
Added: March 20, 2021

2020 journal article

A kernel-free double well potential support vector machine with applications

European Journal of Operational Research, 290(1), 248–262.

By: Z. Gao n, S. Fang n, J. Luo* & N. Medhin n

author keywords: Data science; Support vector machine; Double well potential function; Kernel-free SVM; Binary classification
TL;DR: A kernel-free soft quartic surface SVM model is proposed by utilizing the double well potential function for highly nonlinear binary classification and is extended to successfully handle some real-life corporate and personal credit data sets for applications. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: March 20, 2021

2020 journal article

An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration

Transportation Research Part E: Logistics and Transportation Review, 138, 101896.

By: M. Yao*, J. Lin*, Y. Lin n & S. Fang n

author keywords: Joint replenishment; Districting problem; Genetic algorithm
TL;DR: This paper proposes an innovative search algorithm for solving the traditional multi-customer joint replenishment problem in a given zone and designs a GA-based framework to handle the corresponding districting problem based on the performance of each district evaluated by using the proposed search algorithm. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: June 15, 2020

2020 journal article

Culture versus Policy: More Global Collaboration to Effectively Combat COVID-19

The Innovation, 1(2), 100023.

By: J. Li*, K. Guo*, E. Viedma*, H. Lee*, J. Liu*, N. Zhong*, L. Autran Monteiro Gomes*, F. Filip* ...

TL;DR: All countries and governments should be more tolerant to each other in seeking cultural and political consensus to overcome this historically tragic pandemic together. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 20, 2021

2020 book

Introduction to Linear Conic Optimization

Beijing, China: Tsinghua University Press.

By: W. Xing & S. Fang

Source: NC State University Libraries
Added: March 22, 2021

2020 journal article

Inventory transshipment game with limited supply: Trap or treat

Naval Research Logistics (NRL), 67(6), 383–403.

By: Z. Wang*, Y. Dai*, S. Fang n, Z. Jiang* & Y. Xu*

author keywords: bargaining; game theory; inventory transshipment; newsvendor; supply chain coordination
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 3, 2020

2020 journal article

Selecting green third party logistics providers for a loss-averse fourth party logistics provider in a multiattribute reverse auction

Information Sciences, 548, 357–377.

By: X. Qian*, S. Fang n, M. Yin*, M. Huang* & X. Li*

author keywords: Green winner determination; Multiattribute decision making; Prospect theory; Choquet integral; Intuitionistic 2-tuple linguistic terms
TL;DR: This study investigates a novel green winner determination problem that has several features, including the sustainable attributes with conflicting and interactive properties of potential 3PLs, and the loss-averse behavior with an internal reference point of a fourth party logistics (4PL) provider. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 20, 2021

2020 journal article

Sparse Solutions by a Quadratically Constrained ℓq (0 < q < 1) Minimization Model

Sparse Solutions by a Quadratically Constrained ℓq (0 < q < 1) Minimization Model. INFORMS Journal on Computing, 33(2), 511–530.

By: S. Jiang*, S. Fang n & Q. Jin*

author keywords: nonsmooth optimization; nonconvex optimization; optimality condition; sparse solution; sparse signal recovery; image processing
TL;DR: Finding sparse solutions to a system of equations and/or inequalities is an important topic in many application areas such as signal processing, statistical regression and nonparametric modeling. (via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries, ORCID
Added: March 20, 2021

2019 journal article

A gradient descent based algorithm for ℓp minimization

European Journal of Operational Research, 283(1), 47–56.

By: S. Jiang*, S. Fang n, T. Nie* & W. Xing*

author keywords: Global optimization; Nonsmooth optimization; Nonconvex optimization; Gradient descent algorithm; KKT condition
TL;DR: A gradient-descent-based algorithm is proposed to find solutions satisfying the scaled KKT condition without invoking the nondifferentiability issue and is capable of achieving much better sparse recovery in reasonable computational time compared to state-of-the-art interior-point based algorithms. (via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: February 17, 2020

2019 journal article

A sub-one quasi-norm-based similarity measure for collaborative filtering in recommender systems

Information Sciences, 487, 142–155.

By: S. Jiang n, S. Fang n, Q. An n & J. Lavery n

author keywords: Recommender system; Collaborative filtering; Neighborhood-based CF; Similarity measure; l(p)quasi-norm
TL;DR: A sub-one quasi-norm-based similarity measure for collaborative filtering in a recommender system shows its advantages over those commonly used similarity measures in the literature by making better use of rating values and deemphasizing the dissimilarity between users. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: April 29, 2019

2019 journal article

An alternative efficient representation for the project portfolio selection problem

European Journal of Operational Research, 281(1), 100–113.

By: X. Li*, Y. Huang*, S. Fang n & Y. Zhang*

author keywords: Project portfolio selection problem; Mixed integer polynomial program; Linearization technique; Alternative solution
TL;DR: This study proposes an alternative efficient representation for PPSP using fewer continuous variables than the current methods to achieve global optimum and is integrated with a general binary cut scheme for identifying all alternative solutions for decision makers to consider better options. (via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: November 25, 2019

2019 journal article

Bidding Decisions with Nonequilibrium Strategic Thinking in Reverse Auctions

Group Decision and Negotiation, 28(4), 757–786.

By: X. Qian*, S. Fang n, M. Huang*, T. Nie n & X. Wang*

author keywords: Reverse auction; Bounded rationality; Nonequilibrium strategic thinking; Level-k model
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 5, 2019

2019 journal article

Fast computation of global solutions to the single-period unit commitment problem

Journal of Combinatorial Optimization, 44(3), 1511–1536.

By: C. Lu*, Z. Deng*, S. Fang n, Q. Jin* & W. Xing*

author keywords: Mixed-integer pogramming; Quadratic programming; Branch-and-bound algorithm
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: December 16, 2019

2019 journal article

Multiplicative data envelopment analysis cross-efficiency and stochastic weight space acceptability analysis for group decision making with interval multiplicative preference relations

Information Sciences, 514, 319–332.

By: J. Liu n, S. Fang n & H. Chen*

author keywords: Group decision making; Multiplicative DEA cross-efficiency; Acceptability index; Assignment problem; Expected priority vector
TL;DR: A novel method based on multiplicative data envelopment analysis (DEA) cross-efficiency and stochastic weight space acceptability analysis for group decision making with interval multiplicative preference relations (IMPRs). (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: March 10, 2020

2019 journal article

Winner determination of loss-averse buyers with incomplete information in multiattribute reverse auctions for clean energy device procurement

Energy, 177, 276–292.

By: X. Qian*, S. Fang n, M. Huang* & X. Wang*

author keywords: Clean energy market; Reverse auction; Multi-attribute decision making; Incomplete information; Winner determination; Loss aversion
TL;DR: An interesting result indicates that the risk aversion degree of the buyer increases as the variance of suppliers' attributes expands and the BOCR-uRTODIM could be a useful tool for utility companies to avoid losses and for associated suppliers to improve their attributes for a win in the clean energy industry. (via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure (OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: July 1, 2019

2018 journal article

Geometric Programming with Discrete Variables Subject to Max-Product Fuzzy Relation Constraints

Discrete Dynamics in Nature and Society, 2018, 1–8.

By: Z. Qin*, B. Cao*, S. Fang n & X. Yang*

TL;DR: This work proposed a 0-1 mixed integer linear programming model and adopted the branch-and-bound scheme to solve the problem of geometric programming subject to max-product fuzzy relation constraints with discrete variables. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2018 journal article

L1-norm based Major Component Detection and Analysis for Asymmetric Radial Data

International Journal of Operations Research, 15, 89–100.

By: Q. An n, S. Fang n, S. Jiang n & J. Lavery n

Sources: NC State University Libraries, NC State University Libraries
Added: March 22, 2021

2018 journal article

Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints

Journal of Industrial & Management Optimization, 15(4), 1677–1699.

By: J. Dai, S. Fang* & W. Xing

author keywords: Trust region subproblem; SOC-SDP relaxation; slater condition; matrix decomposition; recovering algorithm
TL;DR: This paper provides such a recovering algorithm to complement those known works on an extended trust region subproblem (eTRS) in which the unit ball intersects with linear inequality constraints. (via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: July 22, 2019

2018 journal article

Robust Regression Models for Load Forecasting

IEEE Transactions on Smart Grid, 10(5), 5397–5404.

By: J. Luo*, T. Hong* & S. Fang n

author keywords: Cybersecurity; data integrity attack; electric load forecasting; iteratively re-weighted least squares; L-1 regression; robust regression
TL;DR: Numerical experiments indicate the dominating performance of the three proposed robust regression models, especially <inline-formula> <tex-math notation="LaTeX">$L_{1}$ </tex- math></inline- formula> regression, compared to other representative load forecasting models. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, NC State University Libraries
Added: September 16, 2019

2018 journal article

Structured linear reformulation of binary quadratically constrained quadratic programs

Optimization Letters, 11.

By: S. Jiang n, S. Fang n, T. Nie* & Q. An n

author keywords: Quadratically constrained quadratic program; Binary program; Linear reformulation; 0-1 mixed integer linear program
TL;DR: Theoretical proof shows the proposed reformulation provides a tighter linearization for each quadratic term comparing to other known linear reformulations, and superior computational efficiency in terms of the running time and number of nodes explored. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020

2018 journal article

ℓ1-Norm Based Central Point Analysis for Asymmetric Radial Data

Annals of Data Science, 5(3), 469–486.

By: Q. An n, S. Fang n, T. Nie* & S. Jiang n

Sources: Crossref, NC State University Libraries
Added: December 11, 2020

2017 journal article

A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems

Optimization, 67(2), 359–375.

By: Z. Deng*, S. Fang n, C. Lu* & X. Guo*

author keywords: Branch-and-cut algorithm; nonconvex quadratically constrained quadratic programming; polar cut; semidefinite relaxation
TL;DR: Numerical experiments indicate that the number of explored nodes required for solving QCQP problems can be significantly reduced by employing the proposed polar cuts. (via Semantic Scholar)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: August 6, 2018

2017 journal article

A cooperative game with envy

Journal of Industrial & Management Optimization, 13(4), 2049–2066.

By: J. Zhang, S. Fang*, Y. Xu & Z. Wang

Sources: Crossref, NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2017 journal article

A proximal quadratic surface support vector machine for semi-supervised binary classification

Soft Computing, 22(20), 6905–6919.

By: X. Yan*, Y. Bai*, S. Fang n & J. Luo*

author keywords: Semi-supervised classification; Proximal support vector machine; Kernel-free; Quadratic surface; Alternating direction method
TL;DR: Preliminary results indicate that the proposed proximal quadratic surface support vector machine model outperforms some well-known methods for semi-supervised classification in terms of the efficiency and classifying accuracy. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, NC State University Libraries
Added: October 16, 2018

2017 journal article

Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming

Journal of Global Optimization, 70(1), 171–187.

By: C. Lu*, Z. Deng*, W. Zhang* & S. Fang n

author keywords: Quadratic programming; Semidefinite relaxation; Branch-and-bound; Global optimization
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, NC State University Libraries
Added: August 6, 2018

2017 journal article

Benchmarking robustness of load forecasting models under data integrity attacks

International Journal of Forecasting, 34(1), 89–104.

By: J. Luo*, T. Hong* & S. Fang n

author keywords: Cybersecurity; Data integrity attack; Electric load forecasting; Linear regression; Neural network; Support vector regression; Fuzzy regression
TL;DR: The effect of data integrity attacks on the accuracy of four representative load forecasting models (multiple linear regression, support vector regression, artificial neural networks, and fuzzy interaction regression) is revealed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: February 24, 2020

2017 journal article

Convex Analysis and Duality over Discrete Domains

Journal of the Operations Research Society of China, 6(2), 189–247.

By: M. Adıvar* & S. Fang n

author keywords: Discrete convex analysis; Discrete Lagrangian duality; Discrete Slater's condition; Discrete strong duality; Integer programming; Integrality
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 6, 2020

2017 journal article

Convex Shape Preservation of Cubic L1 Spline Fits

Annals of Data Science, 4(1), 123–147.

By: T. Nie n, Z. Wang*, S. Fang n & J. Lavery*

TL;DR: Numerical results in the 5-node window indicate that the second-derivative based and first-derivative based spline fits outperform function-value based spline fits for preserving this convex shape. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 11, 2020

2017 journal article

Core of the Reinsurance Market with Dependent Risks

Journal of the Operations Research Society of China, 6(1), 49–57.

By: J. Zhang*, S. Fang n & Y. Xu*

author keywords: Core; Risk premium; Reinsurance market; Exponential utility; Cooperative game
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, NC State University Libraries
Added: August 6, 2018

2017 journal article

Double well potential function and its optimization in the N-dimensional real space - Part I

Journal of Industrial and Management Optimization, 13(3), 1291–1305.

By: S. Fang, D. Gao, G. Lin, R. Sheu & W. Xing

Source: NC State University Libraries
Added: August 6, 2018

2017 journal article

Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables

Applied Mathematical Modelling, 58, 140–157.

By: Q. An n, S. Fang n, H. Li* & T. Nie*

author keywords: Nonlinear discrete optimization; Linear reformulation; Polynomial programming; Signomial programming
TL;DR: This paper significantly extends the applicability of state-of-the-art ELDP (equations for linearizing discrete product terms) method by providing a new linearization to handle more complicated non-linear terms involving both of discrete and bounded continuous variables. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2017 journal article

Inventory centralization with risk-averse newsvendors

Annals of Operations Research, 268(1-2), 215–237.

By: J. Zhang*, S. Fang n & Y. Xu*

author keywords: Inventory centralization; Risk-averse; Risk sharing; Pareto-optimality; Core
UN Sustainable Development Goal Categories
Sources: Web Of Science, Crossref, NC State University Libraries
Added: October 19, 2018

2017 journal article

Reverse auctions with regret-anticipated bidders

Annals of Operations Research, 268(1-2), 293–313.

By: X. Qian*, S. Fang n, M. Huang*, Q. An* & X. Wang*

author keywords: Reverse auction; Anticipated regrets; Mitigation strategy; Reserve price
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, Crossref, NC State University Libraries
Added: October 19, 2018

2016 journal article

A kernel-free quadratic surface support vector machine for semi-supervised learning

Journal of the Operational Research Society, 67(7), 1001–1011.

By: X. Yan*, Y. Bai*, S. Fang n & J. Luo*

author keywords: semi-supervised support vector machine; quadratic surface support vector machine; semi-supervised learning; kernel-free; semi-definite relaxation
TL;DR: Preliminary computational results indicate that the proposed method outperforms some existing well-known methods for solving semi-supervised support vector machine with a Gaussian kernel in terms of classification accuracy. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

An enhanced logarithmic method for signomial programming with discrete variables

European Journal of Operational Research, 255(3), 922–934.

By: H. Li*, S. Fang n, Y. Huang* & T. Nie n

author keywords: Signomial programming; Mixed 0-1 linear programming; Linearization technique
TL;DR: An enhanced logarithmic method is proposed to reformulate the SPD problem as a mixed 0-1 linear program (MILP) with a minimum number of binary variables and inequality constraints to support its superior performance to other state-of-the-art linearization methods. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Best L1 approximation of Heaviside-type functions from Chebyshev and weak-Chebyshev spaces

Numerical Algorithms, 75(3), 827–843.

By: L. Gajny*, O. Gibaru*, E. Nyiri* & S. Fang n

author keywords: Best approximation; L-1 norm; Heaviside function; Polynomials; Polynomial splines; Chebyshev space; Weak-Chebyshev space
TL;DR: The Hobby-Rice theorem is extended into an appropriate framework and the unicity of best L1 approximation of Heaviside-type functions from an even-dimensional Chebyshev space is proved under some assumptions on the dimension of the subspaces composed of the odd and even functions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Conic approximation to quadratic optimization with linear complementarity constraints

Computational Optimization and Applications, 66(1), 97–122.

By: J. Zhou*, S. Fang n & W. Xing*

author keywords: Cone of nonnegative quadratic functions; Conic approximation; Linear complementarity constraints
TL;DR: A conic approximation algorithm for solving quadratic optimization problems with linear complementarity constraints by adaptively refining the outer approximation of the feasible set to identify an optimal solution or an ϵ\documentclass[12pt]{minimal} (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Double well potential function and its optimization in the N -dimensional real space-part Ⅰ

Journal of Industrial & Management Optimization, 13(3), 1291–1305.

By: S. Fang*, D. Y. Gao, G. Lin, R. Sheu & W. Xing

author keywords: Non-convex quadratic programming; polynomial optimization; generalized Ginzburg-Landau functional; double well potential
Source: Crossref
Added: March 20, 2021

2016 journal article

Double well potential function and its optimization in the N -dimensional real space-part Ⅱ

Journal of Industrial & Management Optimization, 13(3), 1307–1328.

By: Y. Xia*, R. Sheu, S. Fang n & W. Xing*

author keywords: Double well potential; local minimizer; local maximizer; global minimum
Sources: Crossref, NC State University Libraries
Added: August 6, 2018

2016 journal article

Linear Reformulation of Polynomial Discrete Programming for Fast Computation

INFORMS Journal on Computing, 29(1), 108–122.

By: H. Li*, Y. Huang* & S. Fang n

author keywords: polynomial discrete program; mixed-integer linear program; linearization equation; branch and bound
TL;DR: It is shown that embedding the proposed “equations for linearizing discrete products” into those state-of-the-art methods in the literature not only significantly reduces the required number of linear constraints from O(h3n3) to O(hn) for a cubic polynomial discrete program but also tighten these methods with much more balanced branch-and-bound trees. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Mixed-Integer Linear Programming Approach for Scheduling Repetitive Projects with Time-Cost Trade-Off Consideration

JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 31(3).

By: X. Zou*, S. Fang n, Y. Huang* & L. Zhang*

author keywords: Time-cost trade-off; Repetitive projects; Mixed-integer programming; Scheduling
TL;DR: To handle large-size problems, an approximate model with reduced number of constraints and variables is further presented and it is demonstrated that the exact model is capable of finding optimal solutions for medium- size problems in a reasonable amount of time. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2016 journal article

On linear conic relaxation of discrete quadratic programs

Optimization Methods and Software, 31(4), 737–754.

By: T. Nie n, S. Fang n, Z. Deng* & J. Lavery n

author keywords: discrete quadratic program; linear conic relaxation; RLT method
TL;DR: A special reformulation-linearization technique based linear conic relaxation is proposed for discrete quadratic programming (DQP) and it is shown that the proposed relaxation is tighter than the traditional positive semidefinite programming relaxation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Reformulations for project portfolio selection problem considering interdependence and cardinality

Pacific Journal of Optimization, 12(2), 355–366.

By: X. Li, Y. Huang, S. Fang & Z. Deng

Source: NC State University Libraries
Added: August 6, 2018

2016 journal article

Soft Quadratic Surface Support Vector Machine for Binary Classification

Asia-Pacific Journal of Operational Research, 33(06), 1650046.

By: J. Luo*, S. Fang n, Z. Deng* & X. Guo*

author keywords: Data mining; support vector machine; binary classification; quadratic optimization; kernel-free SVM
TL;DR: Results of computational experiments indicate that the proposed soft quadratic surface support vector machine model may outperform Dagher’s quadRatic model and other soft support vectorMachine models with a Quadratic or Gaussian kernel in terms of the classification accuracy and robustness. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2016 journal article

Solving routing and wavelength assignment problem with maximum edge-disjoint paths

Journal of Industrial & Management Optimization, 13(2), 1065–1084.

By: C. Hsu, H. Cho & S. Fang n

author keywords: Edge-disjoint paths; MEDP; routing and wavelength assignment problem; RWA
TL;DR: An algorithm based on the maximum edge-disjoint paths is proposed to tackle the routing and wavelength assignment problem in wave-length-division multiplexing optical networks and can find the best solution among all testing instances in reasonable computing time. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2015 journal article

An extended model for project portfolio selection with project divisibility and interdependency

Journal of Systems Science and Systems Engineering, 25(1), 119–138.

By: X. Li*, S. Fang n, X. Guo*, Z. Deng* & J. Qi*

author keywords: Project management; project portfolio selection problem; project divisibility; project interdependency
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2015 journal article

CARDINALITY CONSTRAINED PORTFOLIO SELECTION PROBLEM: A COMPLETELY POSITIVE PROGRAMMING APPROACH

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 12(3), 1041–1056.

By: Y. Tian, S. Fang*, Z. Deng & Q. Jin

author keywords: Cardinality constrained portfolio selection problem; completely positive programming; second-order cone; adaptive approximation
TL;DR: The numerical results show that the proposed algorithm can find better approximate and feasible solutions than other known methods in the literature. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2015 article

Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint

Xing, W., Fang, S.-C., Sheu, R.-L., & Zhang, L. (2015, February). ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, Vol. 32.

By: W. Xing*, S. Fang n, R. Sheu* & L. Zhang*

author keywords: Non-convex quadratic programming; canonical duality; Slater's condition; error bound analysis
TL;DR: Under the dual Slater's condition, it is shown that the canonical dual has a smooth concave objective function over a convex feasible domain, and thisDual has a finite supremum unless the original quadratic optimization problem is infeasible. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2015 journal article

Fuzzy quadratic surface support vector machine based on fisher discriminant analysis

Journal of Industrial and Management Optimization, 12(1), 357–373.

By: J. Luo, S. Fang*, Y. Bai & Z. Deng

author keywords: Support vector machine; Fisher discriminant analysis; kernel-free SVM; fuzzy membership function; quadratic surface.
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2015 journal article

On shape-preserving capability of cubic L-1 spline fits

COMPUTER AIDED GEOMETRIC DESIGN, 40, 59–75.

By: Z. Wang n, S. Fang n & J. Lavery*

author keywords: L-1 spline; Shape preservation; Approximation; Spline fit; Univariate
TL;DR: A shape-preserving metric for the linear shape of Heaviside step function is proposed and it is found that function-value-based spline fits preserve linear shape best and are indicated to preserve shape better than the other two types ofspline fits. (via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2015 journal article

Set covering-based topsis method for sloving sup-T equation constrained multi-objective optimization problems

JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 24(3), 258–275.

By: C. Hu & S. Fang n

author keywords: Fuzzy relational equations; fuzzy optimization; set covering problems
TL;DR: Computational results confirm the efficiency of the proposed set covering-based technique for order of preference by similarity to the ideal solution and show its potential for solving large scale sup-T equation constrained multi-objective optimization problems. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2015 journal article

Transportation System and Trade Flows in Port Cities of China: A Random Coefficient Model

Journal of Systems Science and Information, 3(4), 289–300.

By: L. Xu*, S. Fang n, K. Lai*, H. Qiao* & S. Wang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2015 journal article

Winner determination for risk aversion buyers in multi-attribute reverse auction

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 59, 184–200.

By: M. Huang*, X. Qian*, S. Fang n & X. Wang*

author keywords: Reverse auction; Winner determination; Prospect theory; Multi-attribute decision making; Risk aversion
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2014 journal article

Adaptive computable approximation to cones of nonnegative quadratic functions

OPTIMIZATION, 63(6), 955–980.

By: C. Lu*, Q. Jin*, S. Fang n, Z. Wang* & W. Xing*

author keywords: conic programming; quadratic programming; cones of nonnegative quadratic functions; conic approximation; lower bounds; 49N15; 49M37; 90C26; 90C20
TL;DR: This paper proposes an adaptive computable approximation scheme to cones of nonnegative quadratic functions and uses it for solving linear conic programming problems over such a cone. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2014 journal article

Approximation of Irregular Geometric Data by Locally Calculated Univariate Cubic L1 Spline Fits

Annals of Data Science, 1(1), 5–14.

By: Z. Wang n, J. Lavery n & S. Fang n

Sources: Crossref, NC State University Libraries
Added: December 11, 2020

2014 journal article

Conic approximation to nonconvex quadratic programming with convex quadratic constraints

JOURNAL OF GLOBAL OPTIMIZATION, 61(3), 459–478.

By: Z. Deng*, S. Fang n, Q. Jin* & C. Lu*

author keywords: Nonconvex quadratic programming; Adaptive scheme; Cone of nonnegative quadratic functions
TL;DR: It is proved that the lower bounds generated by the linear conic programming problems converge to the optimal value of the original problem, and an adaptive scheme is adopted in the proposed algorithm. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2014 journal article

Detection of a copositive matrix over a p-th order cone

Pacific Journal of Optimization, 10(3), 593–611.

By: J. Zhou, Z. Deng, S. Fang & W. Xing

Source: NC State University Libraries
Added: August 6, 2018

2014 journal article

Expanded model of the project portfolio selection problem with divisibility, time profile factors and cardinality constraints

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 66(7), 1132–1139.

By: X. Li*, S. Fang n, Y. Tian* & X. Guo*

author keywords: project portfolio selection problem; multiple time periods; divisibility; time profile factors; set-up cost; cardinality constraints
TL;DR: A new model for project portfolio selection over a planning horizon with multiple time periods considers the divisibility of projects and combines reinvestment, set-up cost, cardinality constraints and precedence relationship in the scheduling, simultaneously. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2014 journal article

In celebration of Professor Min-yi Yue's 95th birthday

Optimization, 63(6), 827–828.

By: Y. Bai, S. Fang, J. Han & N. Xiu

Source: NC State University Libraries
Added: August 6, 2018

2014 journal article

In celebration of Professor Min-yi Yue’s 95th birthday

Optimization, 63(6), 827–828.

By: S. Fang, Y. Bai, W. Fang, J. Han & N. Xiu

Source: Crossref
Added: June 13, 2021

2014 journal article

Solving conic quadratically constrained quadratic programming problems

Pacific Journal of Optimization, 10(3), 503–516.

By: Q. Jin, S. Fang, C. Lu & W. Xing

Source: NC State University Libraries
Added: August 6, 2018

2014 journal article

ℓ1 Major Component Detection and Analysis (ℓ1 MCDA) in Three and Higher Dimensional Spaces

Algorithms, 7(3), 429–443.

By: Z. Deng n, J. Lavery n, S. Fang n & J. Luo n

author keywords: multidimensional heavy-tailed distribution; l(1)-norm; major component; n-dimensional; outlier; pattern recognition; robust principal component analysis
TL;DR: A scalable l1 MCDA in the n-dimensional space to identify the major directions of star-shaped heavy-tailed statistical distributions with irregularly positioned “spokes” and “clutters” that is competitive with two well-known PCAs when there is only one major direction in the data. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2013 journal article

A branch-and-cut approach to portfolio selection with marginal risk control in a linear conic programming framework

JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 22(4), 385–400.

By: Z. Deng n, Y. Bai*, S. Fang n, Y. Tian* & W. Xing*

author keywords: Portfolio selection; linear conic programming; branch-and-cut
TL;DR: This paper investigates the portfolio selection problem with direct marginal risk control in a linear conic programming framework with semidefinite programming (SDP) relaxation problems over some subrectangles and proposes an adaptive branch-and-cut rule to speed up the computation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 conference paper

Comparison of an ℓ1-regression-based and a RANSAC-based planar segmentation procedure for urban terrain data with many outliers

In L. Bruzzone (Ed.), Image and Signal Processing for Remote Sensing XIX (p. 889209).

By: J. Luo n, Z. Deng n, D. Bulatov*, J. Lavery n & S. Fang n

Ed(s): L. Bruzzone

Event: SPIE Remote Sensing at Dresden, Germany on September 23-26, 2013

author keywords: DBSCAN; fuzzy c-means; l(1) regression; outlier-rich; planar; RANSAC; segmentation; urban terrain
TL;DR: The complete building reconstruction procedure into which the ℓ1-regression-based and RANSAC-based segmentation procedures will be integrated in the future is outlined. (via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2013 journal article

Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming

Journal of Industrial and Management Optimization, 9(3), 701–719.

By: Y. Tian, S. Fang*, Z. Deng* & W. Xing

Sources: Crossref, NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2013 journal article

Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme

European Journal of Operational Research, 229(1), 21–28.

By: Z. Deng n, S. Fang n, Q. Jin* & W. Xing*

author keywords: Conic programming; Copositive; Cone of nonnegative quadratic functions; Adaptive approximation scheme
TL;DR: This decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of nonnegative quadRatic functions over the union of a collection of ellipsoids. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2013 journal article

Exact Computable Representation of Some Second-Order Cone Constrained Quadratic Programming Problems

Journal of the Operations Research Society of China, 1(1), 107–134.

By: Q. Jin*, Y. Tian*, Z. Deng n, S. Fang n & W. Xing*

author keywords: Linear conic program; Semidefinite program; Nonconvex quadratically constrained quadratic program; Second-order cone
TL;DR: This paper provides exact computable representations for some more subclasses of the QCQP problem, in particular, the subclass with one second-order cone constraint and two special linear constraints. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2013 book

Linear Conic Optimization

Beijing, China: Science Press.

By: S. Fang & W. Xing

Source: NC State University Libraries
Added: July 31, 2021

2013 journal article

Non-L-R Type Fuzzy Parameters in Mathematical Programming Problems

IEEE TRANSACTIONS ON FUZZY SYSTEMS, 22(5), 1062–1073.

By: C. Hu*, M. Adivar* & S. Fang n

author keywords: Fuzzy decision making; fuzzy optimization; fuzzy set theory; mathematical programming; membership function; triangular norms
TL;DR: This study considers mathematical programming problems with non-L-R type fuzzy parameters and shows that the fuzzy solutions to such problems can be obtained by solving an optimization problem on a mixed domain. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 journal article

ON CONSTRAINT QUALIFICATIONS: MOTIVATION, DESIGN AND INTER-RELATIONS

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 9(4), 983–1001.

By: Z. Wang*, S. Fang* & W. Xing

author keywords: Constraint qualification; nonlinear programming; optimality conditions; optimization; KKT conditions
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 journal article

QUADRATIC OPTIMIZATION OVER ONE FIRST-ORDER CONE

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 10(3), 945–963.

By: X. Guo, Z. Deng*, S. Fang* & W. Xing

author keywords: Quadratic programming; cone of nonnegative quadratic forms; first-order cone; linear conic programming; adaptive scheme
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 journal article

Quadratic Optimization over a Second-Order Cone with Linear Equality Constraints

Journal of the Operations Research Society of China, 2(1), 17–38.

By: X. Guo*, Z. Deng n, S. Fang n, Z. Wang* & W. Xing*

author keywords: Quadratic programming; Linear conic programming; Second-order cone; Cone of nonnegative quadratic functions
Sources: Crossref, NC State University Libraries
Added: December 11, 2020

2013 chapter

Reallocation of Resources to Preserve Relative Efficiencies: Inverse CCR Model

In The 19th International Conference on Industrial Engineering and Engineering Management (pp. 497–508).

By: S. Lertworasirikul* & S. Fang n

Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2013 chapter

Refined EM Method for Solving Linearly Constrained Global Optimization Problems

In P. Pulat, S. Sarin, & R. Uzsoy (Eds.), Essays in Production, Project Planning and Scheduling (pp. 69–90).

By: L. Yu n & S. Fang n

Ed(s): P. Pulat, S. Sarin & R. Uzsoy

TL;DR: Computer results show that without using the higher-order information, refined EM converges rapidly to the global optimal solutions and produces better results than other known methods in solving problems of a varying degree of difficulty. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2013 chapter

Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths

In Advances in Intelligent Systems and Computing (pp. 95–103).

By: C. Hsu n, H. Cho* & S. Fang n

TL;DR: An algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem is proposed and the performance of the proposed method has been verified by experiments on several realistic network topologies. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020

2013 book

The Eighth Chinese Symposium on Mathematical Programming

In S.-C. Feng, Y. Bai, W. Fang, J. Han, & N. Xiu (Eds.), Optimization (Vol. 62, pp. 429–430).

By: Y. Bai*, S. Fang n, W. Fang*, J. Han* & N. Xiu*

Ed(s): S. Feng, Y. Bai*, W. Fang n, J. Han* & N. Xiu*

TL;DR: Ten papers from the Eighth Chinese Symposium on Mathematical Programming, held on 22–25 May 2010 in Shanghai University, are selected for publication in this special issue. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 journal article

Transport costs and China's exports: Some empirical evidences

JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 26(3), 365–382.

author keywords: Container throughput; port efficiency; the gravity model; transport costs
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2013 journal article

ℓ1 Major Component Detection and Analysis (ℓ1 MCDA): Foundations in Two Dimensions

Algorithms, 6(1), 12–28.

By: Y. Tian n, Q. Jin n, J. Lavery n & S. Fang n

author keywords: heavy-tailed distribution; l(1); l(2); major component; multivariate statistics; outliers; principal component analysis; 2D
TL;DR: The l1 Major Component Detection and Analysis (l1 MCDA) that is proposed can determine the main directions and the radial extent of 2D data from single or multiple superimposed Gaussian or heavy-tailed distributions without and with patterned artificial outliers (clutter). (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2012 journal article

A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems

INFORMS JOURNAL ON COMPUTING, 25(4), 643–653.

By: H. Li*, Y. Huang* & S. Fang n

author keywords: task assignment problem; binary variables; mixed-integer programming problem
TL;DR: This study proposes a new logarithmic method that significantly reduces the numbers of binary variables and inequality constraints in solving task assignment problems and demonstrates that the proposed method is superior to other known methods of this kind for solving large-size TAPs. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2012 journal article

An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems

Science China Mathematics, 56(1), 201–211.

By: L. Zhang*, S. Fang n & S. Wu*

author keywords: semi-infinite programming; min-max problem; central cutting plane; entropy
TL;DR: A central cutting plane algorithm for solving convex min-max semi-infinite programming problems and an algorithm based on the entropy function is presented. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2012 journal article

Analysis on Transport Costs and China’s Exports

Systems Engineering Theory and Practice, 32(5), 1057–1067.

By: A. Transport Costs, C. Exports, L. Xu & S. Wang

Source: NC State University Libraries
Added: August 27, 2021

2012 article

Canonical dual approach to solving the maximum cut problem

Wang, Z., Fang, S.-C., Gao, D. Y., & Xing, W. (2012, October). JOURNAL OF GLOBAL OPTIMIZATION, Vol. 54, pp. 341–351.

By: Z. Wang*, S. Fang n, D. Gao* & W. Xing*

author keywords: Global optimization; Maximum cut; Canonical duality; Perturbation method
TL;DR: It is shown that, by introducing a linear perturbation term to the objective function, the maximum cut problem is perturbed to have a dual problem which is a concave maximization problem over a convex feasible domain under certain conditions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2012 journal article

Introduction to the special issue on optimizing risk management in services

OPTIMIZATION, 61(10), 1175–1177.

By: D. Wu*, S. Fang n, D. Olson* & J. Birge*

author keywords: risk management; optimization
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2012 book

Optimizing Risk Management in Services

In Optimization (Vol. 61).

Shu-Cherng Fang

Ed(s): S. Fang, D. Wu, D. Olson & J. Birge

Source: NC State University Libraries
Added: August 27, 2021

2012 journal article

Preface

Journal of Global Optimization, 54(2), 219–220.

By: S. Fang*, C. Floudas & D. Gao

TL;DR: Understanding of these phenomena has progressed to a point where the authors can say that the physical properties of topological structures such as domain walls can be completely different from those of the parent bulk material phase. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2012 journal article

Pricing policies for substitutable products in a supply chain with Internet and traditional channels

European Journal of Operational Research, 224(3), 542–551.

By: Y. Chen*, S. Fang n & U. Wen*

author keywords: Pricing; Game theory; Supply chain management; Channel competition
TL;DR: The findings show that improving brand loyalty is profitable for both of the manufacturer and retailer, and that an increased service value may alleviate the threat of the Internet channel for the retailer and increase the manufacturer’s profit. (via Semantic Scholar)
UN Sustainable Development Goal Categories
17. Partnerships for the Goals (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2012 journal article

Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 226(1), 139–153.

By: Z. Jiang*, S. Fang n, Z. Fan* & D. Wang*

author keywords: E-commerce; Bounded rationality; Customer behavior; Online auctions; Revenue management
TL;DR: This paper presents a “behavior choice function” to characterize the behavior of the customers with bounded rationality, and constructs a revenue model based on the bounded rationality for analysis corresponding to each selling format. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2012 book

The First World Congress on Global Optimization in Engineering and Science

In Journal of Global Optimization (Vol. 54).

Shu-Cherng Fang

Ed(s): A. Floudas, S. Fang & D. Gao

Source: NC State University Libraries
Added: August 27, 2021

2011 journal article

A TROPICAL CYCLONE-BASED METHOD FOR GLOBAL OPTIMIZATION

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 8(1), 103–115.

By: C. Chao, S. Fang* & C. Liao

author keywords: Global optimization; tropical cyclone; population-based search; heuristics; soft computing.
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

A canonical dual approach for solving linearly constrained quadratic programs

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 218(1), 21–27.

By: W. Xing*, S. Fang n, R. Sheu* & Z. Wang n

author keywords: Quadratic programming; Global optimization; Canonical duality theory
TL;DR: A canonical dual approach for minimizing a general quadratic function over a set of linear constraints is provided and the generated sequence is proven to be convergent to a Karush–Kuhn–Tucker point with a strictly decreasing objective value. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

A selfish routing based network improvement problem

Journal of Systems Science and Complexity, 24(1), 68–78.

By: B. Zhang* & S. Fang n

author keywords: Nash equilibrium; NP-hard; selfish routing; price of anarchy
TL;DR: The authors show that this problem is strongly NP-hard, even for the single commodity network, by using the reduction from the 3-Satisfiability (3-SAT) problem to the problem. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2011 journal article

CONVEX OPTIMIZATION ON MIXED DOMAINS

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 8(1), 189–227.

By: M. Adivar & S. Fang*

author keywords: Continuous optimization; convexity; convex optimization; discrete optimization; generalized convexity; subgradient; time scales
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 article

Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint

Yuan, Y.-B., Fang, S.-C., & Gao, D. Y. (2012, February). JOURNAL OF GLOBAL OPTIMIZATION, Vol. 52, pp. 195–209.

By: Y. Yuan*, S. Fang n & D. Gao*

author keywords: Nonconvex optimization; Canonical duality; Triality theory; NP-hard problem; Global optimization
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

Inverse data envelopment analysis model to preserve relative efficiency values: The case of variable returns to scale

Computers & Industrial Engineering, 61(4), 1017–1023.

By: S. Lertworasirikul*, P. Charnsethikul* & S. Fang n

author keywords: Data envelopment analysis; Inverse optimization; Efficiency; Performance analysis; Resource allocation
TL;DR: A linear programming model is proposed, which gives a Pareto-efficient solution to the inverse BCC problem and there exists at least an optimal solution if and only if the new output vector is in the set of current production possibility set. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2011 journal article

KKT SOLUTION AND CONIC RELAXATION FOR SOLVING QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS

SIAM JOURNAL ON OPTIMIZATION, 21(4), 1475–1490.

By: C. Lu*, S. Fang*, Q. Jin*, Z. Wang & W. Xing

author keywords: quadratically constrained quadratic programming; conic programming; global optimality condition; solvable condition
TL;DR: This study leads to a global optimality condition that is more general than the known positive semidefiniteness condition in the literature and proposes a computational scheme that provides clues of designing effective algorithms for more solvable quadratically constrained quadratic programming problems. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

On the unique solvability of fuzzy relational equations

FUZZY OPTIMIZATION AND DECISION MAKING, 10(2), 115–124.

By: P. Li* & S. Fang n

author keywords: Fuzzy relational equations; Minimal solutions; Unique solvability
TL;DR: A polynomial-time method of O(mn) complexity is proposed to determine whether a system of fuzzy relational equations with max-min composition has a unique minimal solution and/or a unique solution, where m, n are the dimensions of the input data. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

Randomly generating test problems for fuzzy relational equations

FUZZY OPTIMIZATION AND DECISION MAKING, 11(1), 1–28.

By: C. Hu* & S. Fang n

author keywords: Fuzzy relational equations; Triangular norms; Random generator
TL;DR: It is shown that the test problems generated by the proposed procedures are consistent and randomly generate systems of fuzzy relational equations with various number of minimal solutions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

Set covering-based surrogate approach for solving sup-T equation constrained optimization problems

FUZZY OPTIMIZATION AND DECISION MAKING, 10(2), 125–152.

By: C. Hu* & S. Fang n

author keywords: Fuzzy relational equations; Triangular norms; Fuzzy optimization; Set covering problems
TL;DR: This is the first trial of developing integer programming-based techniques to solve sup-T equation constrained optimization problems from the integer programming viewpoint and the efficiency of the proposed set covering-based surrogate approach is confirmed and its potential for solving large scale sup-$${\mathcal{T}}$$ equation constrained optimized problems shown. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2011 journal article

Univariate cubic L-1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 51(2), 575–600.

By: Q. Jin*, L. Yu n, J. Lavery n & S. Fang n

author keywords: Cubic L-1 spline; First-derivative-based; Interpolation; Locally calculated; Shape preservation
TL;DR: It is shown that cubic L1 splines based on the first derivative and on 5-point windows preserve linearity of the original data and avoid extraneous oscillation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2010 chapter

Chebyshev Approximation of Inconsistent Fuzzy Relational Equations with Max-T Composition

In Studies in Fuzziness and Soft Computing: Vol. 254. Fuzzy Optimization (pp. 109–124).

By: P. Li n & S. Fang n

TL;DR: This paper considers resolving the inconsistency of a system of fuzzy relational equations with max-T composition by simultaneously modifying the coefficient matrix and the right hand side vector by means of Chebyshev approximation. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2010 journal article

Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium problems

Journal of Industrial & Management Optimization, 6(2), 333–346.

By: L. Zhang, S. Wu & S. Fang*

author keywords: Equilibrium problem; D-gap function; Error bound; Unconstrained optimization; Convergence
TL;DR: The existence and uniqueness of a solution to the equilibrium problem are shown, the global convergence property of the proposed algorithm with a global error bound is established, and the strong monotonicity condition is proved. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2010 journal article

EXTENDED CANONICAL DUALITY AND CONIC PROGRAMMING FOR SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 6(4), 779–793.

By: C. Lu, Z. Wang, W. Xing & S. Fang*

author keywords: 0-1 quadratic programming; canonical duality; conic relaxation
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2010 journal article

On the global optimality of generalized trust region subproblems

OPTIMIZATION, 59(8), 1139–1151.

By: Q. Jin n, S. Fang n & W. Xing*

author keywords: global optimization; quadratic programming; generalized trust region subproblems; Lagrangian
TL;DR: The duality property between the primal problem and its Lagrangian dual problem is analysed, and the attainability of the optimal primal solution without the Slater condition is discussed. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2010 journal article

TWO-PERSON KNAPSACK GAME

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 6(4), 847–860.

By: Z. Wang, W. Xing & S. Fang*

author keywords: Game theory; Nash equilibrium; price of anarchy; knapsack problem
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2010 journal article

Univariate Cubic L1 Interpolating Splines: Analytical Results for Linearity, Convexity and Oscillation on 5-Point Windows

Algorithms, 3(3), 276–293.

By: Q. Jin n, J. Lavery n & S. Fang n

author keywords: convexity; cubic L1 spline; 5-point window; interpolation; linearity; locally calculated; oscillation; second-derivative-based; univariate
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2010 journal article

Univariate Cubic L1 Interpolating Splines: Spline Functional, Window Size and Analysis-based Algorithm

Algorithms, 3(3), 311–328.

By: L. Yu n, Q. Jin n, J. Lavery n & S. Fang n

author keywords: antiderivative; cubic L-1 spline; first derivative; 5 -point window; function value; global; interpolation; locally calculated; second derivative; univariate
TL;DR: To calculate second-derivative-based 5-point-window L1 splines, an analysis-based, parallelizable algorithm is introduced that is orders of magnitude faster than the previously widely used primal affine algorithm. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2009 journal article

A SHADOW-PRICE BASED HEURISTIC FOR CAPACITY PLANNING OF TFT-LCD MANUFACTURING

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 6(1), 209–239.

By: T. Chen, J. Lin & S. Fang*

author keywords: Capacity planning; TFT-LCD manufacturing; mixed integer linear programming; shadow price
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 journal article

A note on solution sets of interval-valued fuzzy relational equations

FUZZY OPTIMIZATION AND DECISION MAKING, 8(1), 115–121.

By: P. Li n & S. Fang n

author keywords: Fuzzy relational equations; Fuzzy relational inequalities; Interval-valued system
TL;DR: This note discusses three types of solutions for a system of interval-valued fuzzy relational equations with max-T composition and illustrates their relations to the solutions of a systems of fuzzy relational inequalities with maximum T composition. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 journal article

A survey on fuzzy relational equations, part I: classification and solvability

Fuzzy Optimization and Decision Making, 8(2), 179–229.

By: P. Li n & S. Fang n

author keywords: Fuzzy relational equation; Solvability; Duality; Adjointness; Triangular norm
TL;DR: Nessary and sufficient conditions for the solvability of fuzzy relational equations are discussed and solution sets are characterized by means of a root or crown system under some specific assumptions. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2009 journal article

Latticized Linear Optimization on the Unit Interval

IEEE Transactions on Fuzzy Systems, 17(6), 1353–1365.

By: P. Li n & S. Fang n

author keywords: Fuzzy optimization; fuzzy relational equations; max-separable optimization (MSO)
TL;DR: It is shown that an optimal solution to an latticized linear optimization problem can be obtained in polynomial time as long as the objective function is a max-separable function with continuous monotone components. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, Web Of Science
Added: August 6, 2018

2009 journal article

Minimizing a linear fractional function subject to a system of sup-T equations with a continuous Archimedean triangular norm

JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 22(1), 49–62.

By: P. Li n & S. Fang n

author keywords: Fractional optimization; fuzzy relational equations; triangular norms
TL;DR: The problem of minimizing alinear fractional function subject to a system of sup-T equations with a continuous Archimedean triangular norm T can be reduced to a 0-1 linear fractional optimization problem in polynomial time, and parametrization techniques can be applied by solving a classical set covering problem in each iteration. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2009 conference paper

Robust univariate cubic L-2 spines: Interpolating data with uncertain positions of measurements

Journal of Industrial and Management Optimization, 5(2), 351–361.

By: I. Averbakh, S. Fang & Y. Zhao

Source: NC State University Libraries
Added: August 6, 2018

2009 journal article

Two-group knapsack game

THEORETICAL COMPUTER SCIENCE, 411(7-9), 1094–1103.

By: Z. Wang*, W. Xing* & S. Fang n

author keywords: Game theory; Knapsack problem; Nash equilibrium; Price of anarchy
TL;DR: It is shown that a pure Nash equilibrium exists under certain conditions and some interesting findings of the ''price of anarchy'' associated with a simplified version of the two-group knapsack game with three investors are presented. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2008 journal article

A new tunnel function method for global optimization

Pacific Journal of Optimization, 4(1), 125–138.

By: L. Zhang, S. Fang & Y. Wang

Source: NC State University Libraries
Added: August 6, 2018

2008 journal article

Canonical dual approach to solving 0-1 quadratic programming problems

Journal of Industrial & Management Optimization, 4(1), 125–142.

By: S. Fang n, D. Y. Gao, R. Sheu & S. Wu*

Source: Crossref
Added: June 13, 2021

2008 journal article

Canonical dual approach to solving 0-1 quadratic programming problems

Journal of Industrial and Management Optimization, 4(1), 124–142.

By: S. Fang, D. Gao, R. Sheu & S. Wu

Source: NC State University Libraries
Added: August 6, 2018

2008 chapter

Entropy optimization: Interior-point methods

In Encyclopedia of optimization / [editors, C.A. Floudas and P.M. Pardalos]. Dordrecht: London: Kluwer Academic, c2001.

By: S. Fang n & H. Tsao*

Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2008 journal article

Global extremal conditions for multi-integer quadratic programming

Journal of Industrial and Management Optimization, 4(2), 213–225.

By: Z. Wang, S. Fang, D. Gao & W. Xing

Source: NC State University Libraries
Added: August 6, 2018

2008 journal article

Global optimization for a class of fractional programming problems

JOURNAL OF GLOBAL OPTIMIZATION, 45(3), 337–353.

By: S. Fang n, D. Gao*, R. Sheu* & W. Xing*

author keywords: Quadratic fractional programming; Sum-of-ratios; Global optimization; Canonical duality
TL;DR: Under proper conditions on the “problem-defining” matrices associated with the three quadratic functions, it is shown that the canonical dual of each subproblem becomes a one-dimensional concave maximization problem that exhibits no duality gap. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2008 conference paper

Nonlinear Optimization Subject to A System of Fuzzy Relational Equations with Max-min Composition

Proceedings of 7th International Symposium on Operations Research and Its Applications (ISORA), 1–9.

By: P. Li, X. Zhang & S. Fang

Event: 7th International Symposium on Operations Research and Its Applications (ISORA) at Lijiang, China on October 31 - November 3, 2008

Source: NC State University Libraries
Added: August 27, 2021

2008 review

On the resolution and optimization of a system of fuzzy relational equations with sup-T composition

[Review of ]. FUZZY OPTIMIZATION AND DECISION MAKING, 7(2), 169–214.

By: P. Li n & S. Fang n

author keywords: fuzzy relational equations; triangular norms; fuzzy optimization; integer programming
TL;DR: It is shown that the problem of minimizing a linear objective function subject to a system of sup-T equations can be reduced into a 0–1 integer programming problem in polynomial time. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2008 article

Risk pooling strategy in a multi-echelon supply chain with price-sensitive demand

Dai, Y., Fang, S.-C., Ling, X., & Nuttle, H. L. W. (2008, June). MATHEMATICAL METHODS OF OPERATIONS RESEARCH, Vol. 67, pp. 391–421.

By: Y. Dai*, S. Fang n, X. Ling n & H. Nuttle n

author keywords: supply chain; pooled inventory system; reserved inventory system; pricing
TL;DR: This paper considers a two-echelon supply chain with one supplier and two retailers, in which the supplier carries all inventory to supply the retailers, and analyses inventory and pricing strategies for the supplier in a one-period scenario. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2007 journal article

Analysis of Network Revenue Management under Uncertainty

Nonlinear Dynamics and Systems Theory, 7(1), 85–96.

By: Y. Xu, S. Fang & Y. Feng

Source: NC State University Libraries
Added: August 27, 2021

2007 article

Fuzzy optimization and decision making (vol 2, pg 41, 2003)

Fuzzy Optimization and Decision Making, Vol. 6, pp. 297–297.

By: S. Wang, S. Fang & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

2007 article

Fuzzy optimization and decision making (vol 4, pg 331, 2005)

Fuzzy Optimization and Decision Making, Vol. 6, pp. 297–297.

By: S. Wang, S. Fang & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

2007 article

Geometric dual formulation for first-derivative-based univariate cubic L-1 splines

Zhao, Y. B., Fang, S.-C., & Lavery, J. E. (2008, April). JOURNAL OF GLOBAL OPTIMIZATION, Vol. 40, pp. 589–621.

By: Y. Zhao*, S. Fang n & J. Lavery

author keywords: conjugate function; convex program; cubic L-1 spline; shape-preserving interpolation; piecewise polynomial
TL;DR: This work studies a class of first-derivative-based smooth univariate cubic L1 splines, aimed at generating “shape-preserving” smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2007 journal article

Solving variational inequalities defined on a domain with infinitely many linear constraints

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 37(1), 67–81.

By: S. Fang n, S. Wu* & S. Birbil*

author keywords: variational inequality problem; analytic center based cutting plane method; discretization method; semi-infinite programming
TL;DR: A discretization method and an analytic center based inexact cutting plane method are proposed and under proper assumptions, the convergence results for both methods are given. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

A compressed primal-dual method for generating bivariate. cubic L-1 splines

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 201(1), 69–87.

By: Y. Wang*, S. Fang n & J. Lavery

TL;DR: A compressed version of the primal-dual interior point method for generating bivariate cubic L"1 splines is developed, which is robust and is much faster than the ordinary (uncompressed) primal- dual interior point algorithm. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

A reduced Hsieh-Clough-Tocher element with splitting based on an arbitrary interior point

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 333(1), 500–504.

By: A. Peker n, J. Lavery n & S. Fang n

author keywords: Bernstein-Bezier; Clough-Tocher element; reduced Hsieh-Clough-Tocher element; splitting; subtriangle; triangle
TL;DR: These formulas use local barycentric coordinates in each of the subtriangles and are not significantly more complicated than formulas for an rHCT element with splitting based on the centroid. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

A tabu search algorithm for maximum parsimony phylogeny inference

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 176(3), 1908–1917.

By: Y. Lin n, S. Fang n & J. Thorne n

author keywords: tabu search; OR in biology; bioinformatics; phylogeny inference; maximum parsimony
TL;DR: The parsimony principle is adopted and a tabu search algorithm is designed for finding a most parsimonious phylogeny tree and it generates much more accurate results than the default options of the program “dnapars” (heuristic search based). (via Semantic Scholar)
UN Sustainable Development Goal Categories
15. Life on Land (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

Approximating term structure of interest rates using cubic L-1 splines

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 184(3), 990–1004.

By: N. Chiu*, S. Fang n, J. Lavery, J. Lin* & Y. Wang*

author keywords: B-spline; finance; geometric programming; L-1 spline; term structure
TL;DR: A recently developed cubic L 1 spline model is proposed for term structure analysis that preserves the shape of the data, exhibit no extraneous oscillation and have small fitting errors. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

Capacity Allocation and Inventory Policy in a Distribution System

Asia-Pacific Journal of Operational Research, 23(04), 543–571.

By: Y. Dai*, X. Chao n, S. Fang n & H. Nuttle n

author keywords: game theory; supply chain management; channel coordination; capacity allocation problem
TL;DR: This work considers a single-period distribution system with one supplier and two retailers and designs channel coordination mechanisms, i.e., a decentralized cost structure resulting in a Nash equilibrium with chain-wide profits equal to those achieved under a fully centralized system. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2006 journal article

Capacity allocation with traditional and Internet channels

NAVAL RESEARCH LOGISTICS, 53(8), 772–787.

By: Y. Dai*, X. Chao n, S. Fang n & H. Nuttle n

author keywords: capacity allocation; game theory; nash equilibrium; sequential game
TL;DR: A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game” in which each firm decides its total capacity and allocates this capacity between its local and online stores. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 conference paper

Computationally Efficient Models of Urban and Natural Terrain by Non-iterative Domain Decomposition for L1 Smoothing Splines

Proceedings of the 25th Army Science Conference. Presented at the 25th Army Science Conference.

By: S. Fang, Y. Lin, Y. Zhang & J. Lavery

Event: 25th Army Science Conference

Source: NC State University Libraries
Added: August 27, 2021

2006 journal article

Constructing generalized mean functions using convex functions with regularity conditions

SIAM JOURNAL ON OPTIMIZATION, 17(1), 37–51.

By: Y. Zhao*, S. Fang n & D. Li*

author keywords: convexity; mathematical programming; generalized mean function; self-concordant functions; S*-regular functions
TL;DR: It is shown that some new classes of convex functions with certain regularity can be used as building blocks to construct such generalized functions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2006 journal article

Cubic L1 Splines on Triangulated Irregular Networks

Pacific Journal of Optimization, 2(2), 289–317.

By: W. Zhang, S. Fang, Y. Wang & J. Lavery

Source: NC State University Libraries
Added: August 27, 2021

2005 journal article

A geometric programming approach for bivariate cubic L-1 splines

Computers & Mathematics With Applications, 49(4), 481–514.

By: Y. Wang & S. Fang

Source: NC State University Libraries
Added: August 6, 2018

2005 journal article

A Genetic Algorithm Approach to Solving DNA Fragment Assembly Problem

Journal of Computational and Theoretical Nanoscience, 2(4), 499–505.

By: S. Fang*, Y. Wang & J. Zhong

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2005 journal article

A Geometric Programming Framework for Univariate Cubic L 1 Smoothing Splines

Annals of Operations Research, 133(1-4), 229–248.

By: S. Fang n, H. Cheng n & J. Lavery*

author keywords: smoothing spline; geometric programming; data fitting; shape preservation; sensitivity analysis
TL;DR: The minimization principle for univariate cubic L1 smoothing splines results in a nondifferentiable convex optimization problem that, for theoretical treatment and algorithm design, can be formulated as a generalized geometric program. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2005 conference paper

A Possibility Approach to Fuzzy Linear Programming

Proceedings of the 11th IFSA World Congress, 147–151.

By: S. Lertworasirikul & S. Fang

Event: 11th International Fuzzy Systems Association (IFSA) World Congress

Source: NC State University Libraries
Added: August 27, 2021

2005 journal article

A geometric programming approach for bivariate cubic L1 splines

Computers & Mathematics with Applications, 49(4), 481–514.

By: Y. Wang n, S. Fang n, J. Lavery* & H. Cheng*

author keywords: Cubic L-1 spline; geometric programming; interpolation; spline function; bivariate
TL;DR: A geometric dual with a linear objective function and convex cubic constraints is derived and a linear system for dual-to-primal conversion is established. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2005 journal article

Game theoretic analysis of a distribution system with customer market search

Annals of Operations Research, 135(1), 223–238.

By: Y. Dai*, X. Chao n, S. Fang n & H. Nuttle n

TL;DR: A single period model in which the supplier may have infinite or finite capacity is studied, and the concept of Stackelberg game is used to develop optimal strategies for both the leader and the follower. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2005 book

Industrial and Management Applications

In Journal of Industrial and Management Optimization (Vol. 1).

Shu-Cherng Fang

Ed(s): S. Fang, H. Qi & Y. Zhao

Source: NC State University Libraries
Added: August 28, 2021

2005 book

Mathematical Programming

In Journal of Industrial and Management Optimization (Vol. 1).

Shu-Cherng Fang

Ed(s): S. Fang, H. Qi & Y. Zhao

Source: NC State University Libraries
Added: August 27, 2021

2005 journal article

On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems

Journal of Global Optimization, 33(3), 369–391.

By: S. Fang*, J. Han*, Z. Huang* & Ş. Bİrbİl*

author keywords: entropy function; finite termination; non-interior continuation method; vertical linear complementarity problems; smoothing approximation
TL;DR: It is shown that under some milder than usual assumptions the proposed algorithm finds an exact solution of VLCP in a finite number of iterations. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2005 journal article

Pooled versus Reserved Inventory in a Two-echelon Supply Chain

International Journal of Operations Research, 2(1), 59–76.

By: X. Ling, S. Fang, X. Chao & H. Nuttle

Source: NC State University Libraries
Added: August 27, 2021

2005 journal article

Recursive approximation of the high dimensional max function

OPERATIONS RESEARCH LETTERS, 33(5), 450–458.

By: S. Birbil*, S. Fang n, J. Frenk* & S. Zhang*

author keywords: smoothing methods; n-dimensional max function; recursive approximation
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2005 journal article

Solution Sets of Interval-Valued Min-S-Norm Fuzzy Relational Equations

Fuzzy Optimization and Decision Making, 4(4), 331–349.

By: S. Wang n, S. Fang n & H. Nuttle n

TL;DR: It is shown that each of the three types of the solution sets of interval-valued fuzzy relational equations with a min-s-norm composition is composed of one minimum solution and a finite number of maximal solutions. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2005 journal article

Survey on E-Commerce Modeling and Optimization Strategies

Journal of Tsinghua Science and Technology, 10(S1), 761–771.

By: D. Wang, S. Fang & H. Nuttle

Source: NC State University Libraries
Added: August 27, 2021

2004 article

An analytic center cutting plane method for solving semi-infinite variational inequality problems

Fang, S. C., Wu, S. Y., & Sun, J. (2004, February). JOURNAL OF GLOBAL OPTIMIZATION, Vol. 28, pp. 141–152.

By: S. Fang n, S. Wu* & J. Sun*

author keywords: analytic centers; cutting plane methods; variational inequalities
TL;DR: It is shown that variational inequality problem VI(X,F) can be reduced to a problem of finding a feasible point in a convex set defined by infinitely many constraints and an analytic center based cutting plane algorithm is proposed for solving the reduced problem. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2004 journal article

An efficient algorithm for generating univariate cubic L-1 splines

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 29(2), 219–253.

By: H. Cheng n, S. Fang n & J. Lavery*

author keywords: active set method; convex programming; cubic L-1 spline; geometric programming
TL;DR: An active set based algorithm for calculating the coefficients of univariate cubic L1 splines is developed that outperforms a currently widely used discretization-based primal affine algorithm. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2004 conference paper

Heavy-tailed Non-Gaussian Nature of Terrain and Its Implications for Terrain Modeling by L1 Splines, with J

Proceedings of the 24th Army Science Conference CP-1. Presented at the 24th Army Science Conference.

By: S. Fang & J. Lavery

Event: 24th Army Science Conference

Source: NC State University Libraries
Added: August 28, 2021

2004 article

On the convergence of a population-based global optimization algorithm

Birbil, S. I., Fang, S. C., & Sheu, R. L. (2004, November). JOURNAL OF GLOBAL OPTIMIZATION, Vol. 30, pp. 301–318.

By: S. Birbil*, S. Fang n & R. Sheu*

author keywords: stochastic search method; population-based algorithm; convergence with probability one
TL;DR: After reviewing the original method, some necessary modifications are presented for the convergence proof and it is shown that in the limit, the modified method converges to the vicinity of global optimum with probability one. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2004 book

Optimization and Optimal Control (ICOOC)

In Journal of Global Optimization (Vol. 30).

Shu-Cherng Fang

Ed(s): S. Wu & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

2004 journal article

Pricing in revenue management for multiple firms competing for customers

International Journal of Production Economics, 98(1), 1–16.

By: Y. Dai*, X. Chao n, S. Fang n & H. Nuttle n

author keywords: pricing; revenue management; game theory; Nash equilibrium
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2004 journal article

Shape-preserving properties of univariate cubic L-1 splines

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 174(2), 361–382.

By: H. Cheng n, S. Fang n & J. Lavery*

author keywords: convexity; cubic L-1 spline; geometric programming; interpolation; linearity; shape preservation
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2004 journal article

Solvability of variational inequality problems

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 122(3), 501–520.

By: J. Han*, Z. Huang* & S. Fang n

author keywords: variational inequalities; complementarity problems; exceptional family of elements; existence theorems
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2004 journal article

Special issue on the International Conference on Optimization and Optimal Control (ICOOC), June 1-4, 2001 - Foreword

Journal of Global Optimization, 30(03-Feb), 119–120.

By: S. Wu & S. Fang

Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

A genetic-based framework for solving (multi-criteria) weighted matching problems

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 149(1), 77–101.

By: A. Medaglia* & S. Fang n

author keywords: genetic algorithms; multi-objective evolutionary algorithms; multi-criteria optimization; weighted matching
TL;DR: A modified genetic-based algorithm for solving the multi-criteria weighted matching problem (mc-WMP) is developed and a significant and representative portion of the Pareto optimal set is generated. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 journal article

A neural network model with bounded-weights for pattern classification

Computers & Operations Research, 31(9), 1411–1426.

By: Y. Liao n, S. Fang n & H. L.W. Nuttle n

author keywords: pattern classification; neural networks; multi-layer perceptrons; radial basis function networks; support vector machines
TL;DR: A new neural network model is proposed based on the concepts of multi-layer perceptrons, radial basis functions, and support vector machines, which does not require that kernel functions satisfy Mercer's condition, and it can be readily extended to multi-class classification. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2003 journal article

A two-phase approach to fuzzy system identification

Journal of Systems Science and Systems Engineering, 12(4), 408–423.

By: T. Hung*, S. Fang n & H. Nuttle n

TL;DR: A two-phase approach to fuzzy system identification is proposed, which uses the steepest descent and recursive least-squares estimation methods to identify a prototype fuzzy system for a target system from a collection of input-output data pairs. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2003 journal article

An enhanced neural network learning using a self-tuning fuzzy neuron controller

Journal of Intelligent & Fuzzy Systems, 14(2), 109–118.

By: P. Wu, S. Fang & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

An electromagnetism-like mechanism for global optimization

JOURNAL OF GLOBAL OPTIMIZATION, 25(3), 263–282.

By: S. Birbil n & S. Fang n

author keywords: global optimization; attraction-repulsion mechanism; population-based heuristics
TL;DR: The ease of implementation and flexibility of the heuristic show the potential of this new approach, which utilizes an attraction-repulsion mechanism to move the sample points towards the optimality. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 journal article

An entropic regularization approach for mathematical programs with equilibrium constraints

COMPUTERS & OPERATIONS RESEARCH, 31(13), 2249–2262.

By: S. Birbil*, S. Fang n & J. Han*

author keywords: mathematical programs with equilibrium constraints; smoothing approach; entropic regularization; online solvers
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 journal article

Enhanced Neural Network Learning Using A Fuzzy Neuron Controller

Journal of Intelligent and Fuzzy Systems, 14(2), 109–118.

By: S. Fang, P. Wu & H. Nuttle

Source: NC State University Libraries
Added: August 28, 2021

2003 journal article

Fuzzy BCC Model for Data Envelopment Analysis

Fuzzy Optimization and Decision Making, 2(4), 337–358.

By: S. Lertworasirikul*, S. Fang n, H. Nuttle n & J. Joines n

TL;DR: The FDEA model of the BCC (named after Banker, Charnes, and Cooper) type (FBCC) is studied and the relationship between the primal and dual models of FBCC models is revealed and fuzzy efficiency can be constructed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Crossref, NC State University Libraries, NC State University Libraries, ORCID
Added: August 6, 2018

2003 chapter

Fuzzy Data Envelopment Analysis: A Credibility Approach

In J. L. Verdegay (Ed.), Fuzzy Sets Based Heuristics for Optimization (pp. 141–158).

By: S. Lertworasirikul n, S. Fang n, J. Joines n & H. Nuttle n

Ed(s): J. Verdegay

TL;DR: The approach transforms a fuzzy DEA model into a well-defined credibility programming model, in which fuzzy variables are replaced by “expected credits” in terms of credibility measures. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID
Added: December 6, 2018

2003 journal article

Fuzzy data envelopment analysis (DEA): a possibility approach

Fuzzy Sets and Systems, 139(2), 379–394.

By: S. Lertworasirikul n, S. Fang n, J. Joines n & H. Nuttle n

author keywords: data envelopment analysis; fuzzy mathematical programming; possibility theory; efficiency analysis
TL;DR: The approach transforms fuzzy DEA models into possibility DEA models by using possibility measures of fuzzy events (fuzzy constraints) and it is shown that for the special case, in which fuzzy membership functions of fuzzy data are of trapezoidal types, possibility DEA model become linear programming models. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018

2003 journal article

Fuzzy formulation of auctions and optimal sequencing for multiple auctions

FUZZY SETS AND SYSTEMS, 142(3), 421–441.

By: S. Fang n, H. Nuttle n & D. Wang*

author keywords: auction; sequencing; fuzzy sets; electronic commerce
TL;DR: A fuzzy set based formulation of auctions, which defines fuzzy sets to represent the seller and buyers’ valuations, bid possibilities and win possibilities, and a soft computing approach to maximize the seller's revenue in multiple-object auctions through the use of object sequencing. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 article

Manufacturing network flows: A generalized network flow model for manufacturing process modelling

Fang, S. C., & Qi, L. Q. (2003, April). OPTIMIZATION METHODS & SOFTWARE, Vol. 18, pp. 143–165.

By: S. Fang n & L. Qi*

author keywords: network flow; manufacturing; process and product management; mathematical modelling
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 journal article

On the Resolution of Finite Fuzzy Relation Equations

International Mathematical Journal, 3, 59–72.

By: S. Fang & G. Li

Source: NC State University Libraries
Added: August 28, 2021

2003 journal article

Relaxed conditions for radial-basis function networks to be universal approximators

NEURAL NETWORKS, 16(7), 1019–1028.

By: Y. Liao n, S. Fang n & H. Nuttle n

author keywords: universal approximation; radial-basis function networks
MeSH headings : Neural Networks, Computer
TL;DR: It is shown that RBFs are not required to be integrable for the REF networks to be universal approximators, and can uniformly approximate any continuous function on a compact set provided that the radial basis activation function is continuous almost everywhere, locally essentially bounded, and not a polynomial. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 chapter

Soft Computing for Softgoods Supply Chain Analysis and Decision Support

In Studies in Fuzziness and Soft Computing: Vol. 108. Soft Computing in Textile Sciences (pp. 1–15).

By: S. Fang n, H. Nuttle n, R. King n & J. Wilson n

TL;DR: Research on soft computing techniques for decision support for the design and management of the softgoods supply chain are presented and an overview of this work and the prototype tools developed is given. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 28, 2021

2003 journal article

Solution Sets of Interval-Valued Fuzzy Relational Equations

Fuzzy Optimization and Decision Making, 2(1), 41–60.

By: S. Wang n, S. Fang n & H. Nuttle n

TL;DR: It is proved that each of the three types of the solution sets of interval-valued fuzzy relational equations with a max-t-norm composition, if nonempty, is composed of one maximum solution and a finite number of minimal solutions. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2002 conference paper

A Bayesian analysis of entropy optimization for uncertainty modeling

1993 (2nd) International Symposium on Uncertainty Modeling and Analysis. Presented at the 1993 (2nd) International Symposium on Uncertainty Modeling and Analysis, College Park, MD.

By: S. Fang n, D. Lee* & H. Tsao*

Event: 1993 (2nd) International Symposium on Uncertainty Modeling and Analysis at College Park, MD on April 25-28, 1993

TL;DR: The authors establish an equivalence relationship between LCMXE and maximum likelihood estimation (MLE) and provide a condition under which MLE and the Bayesian procedure produce the same inference. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2002 journal article

An efficient and flexible mechanism for constructing membership functions

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 139(1), 84–95.

By: A. Medaglia n, S. Fang n, H. Nuttle n & . Wilson n

author keywords: fuzzy sets; membership functions; Bezier curves; measures of information; fuzzy numbers
TL;DR: A Bezier curve-based mechanism for constructing membership functions of convex normal fuzzy sets that can fit any given data set with a minimum level of discrepancy is introduced. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2002 conference paper

Decision surface modeling of textile spinning operations using neural network technology

Proceedings of 1994 IEEE/IAS Annual Textile, Fiber and Film Industry Technical Conference. Presented at the 1994 IEEE/IAS Annual Textile, Fiber and Film Industry Technical Conference, Greenville, SC.

By: P. Wu n, S. Fang n, H. Nuttle n, R. King n & J. Wilson n

Event: 1994 IEEE/IAS Annual Textile, Fiber and Film Industry Technical Conference at Greenville, SC on May 4-5, 1994

TL;DR: An attempt to "metamodel" the relation between key inputs and performance measures using neural network technology is reported, and results obtained using a fuzzy control neural network suggest a significant potential for speeding up the training process. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2002 journal article

Efficient neural network learning using second order information with fuzzy control

NEUROCOMPUTING, 43(2002 Mar), 197–217.

By: P. Wu*, S. Fang n & H. Nuttle n

author keywords: neural network learning; curved search algorithm; non-linear optimization; fuzzy controller
TL;DR: A curved search method with a fixed step size for determining weight adjustments is introduced and a fuzzy controller for adjusting the step size is introduced to further reduce the training time and avoid the spikes in the training curve. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2002 journal article

Entropic perturbation method for solving a system of linear inequalities

Journal of Computational and Applied Mathematics, 145(1), 133–149.

By: S. Chen*, S. Fang n & H. Tsao*

author keywords: linear inequalities; entropy optimization; unconstrained dual; Newton method
TL;DR: A proposed algorithm based on the Newton method for solving the unconstrained dual problem of finding an x ∈ Rn such that Ax ≤ b and x ≥ 0 arises in numerous contexts is compared to that of the surrogate constraint algorithm recently developed by Yang and Murty. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2002 conference paper

Fuzzy Data Envelopment Analysis

Proceedings of the 9th Bellman Continuum, 342–353.

By: S. Lertworasirikul, S. Fang, H. Nuttle & J. Joines

Event: 9th Bellman Continuum

Source: NC State University Libraries
Added: August 28, 2021

2002 article

Fuzzy controlled simulation optimization

Medaglia, A. L., Fang, S. C., & Nuttle, H. L. W. (2002, April 1). FUZZY SETS AND SYSTEMS, Vol. 127, pp. 65–84.

By: A. Medaglia n, S. Fang n & H. Nuttle n

author keywords: approximate reasoning; discrete event simulation; simulation optimization; flow line design; genetic algorithm
TL;DR: The proposed work provides the means of incorporating knowledge, expressed in natural language, that is often available among analysts and decision makers, which can satisfy vaguely stated goals to a high degree and generate an approximate Pareto optimal set in the presence of multiple goals. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2002 journal article

Message from the Editors

Fuzzy Optimization and Decision Making, 1, 5–9.

By: S. Fang* & H. Nuttle

Sources: NC State University Libraries, NC State University Libraries
Added: August 28, 2021

2002 journal article

Multi-objective optimization problems with fuzzy relation equation constraints

FUZZY SETS AND SYSTEMS, 127(2), 141–164.

By: H. Loetamonphong n, S. Fang n & R. Young n

author keywords: fuzzy relation equations; max-min composition; multi-objective optimization; genetic algorithm
TL;DR: A genetic-based algorithm is proposed to find the "Pareto optimal solutions" of a new class of optimization problems which have multiple objective functions subject to a set of fuzzy relation equations. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2002 conference paper

On the Multipoint Stochastic Search Method for Global Optimization

Proceedings of ISORA02. Presented at the ISORA02.

By: I. Birbil & S. Fang

Event: ISORA02

Source: NC State University Libraries
Added: August 28, 2021

2002 chapter

Operations Research

In R. A. Meyers (Ed.), Encyclopedia of Physical Science and Technology (3rd ed., Vol. 11, pp. 193–218). San Diego, CA: Academic Press, Inc.

By: S. Fang & S. Elmaghraby

Ed(s): R. Meyers

Source: NC State University Libraries
Added: August 28, 2021

2002 journal article

Solving Fuzzy Variational Inequalities

Fuzzy Optimization and Decision Making, 1(1), 113–133.

By: S. Fang n & C. Hu*

TL;DR: It is shown that variational inequality problems can be reduced to bilevel programming problems and a penalty function algorithm is introduced with a convergence proof. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2002 conference paper

Tolerable Solution Sets on Interval-Valued Fuzzy Relation Equations, with S. Wang and H.L.W

Proceedings of the 6th Joint Conference on Information Science, 74–77.

By: S. Fang, S. Wang & H. Nuttle

Event: 6th Joint Conference on Information Science

Source: NC State University Libraries
Added: August 28, 2021

2002 journal article

Univariate cubic L-1 splines - A geometric programming approach

MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 56(2), 197–229.

By: H. Cheng n, S. Fang n & J. Lavery

author keywords: cubic L-1 spline; geometric programming; interpolation; spline function; univariate
TL;DR: In the natural norm for this class of problems, namely, the L1 norm of the second derivative, the geometric programming approach finds better solutions than the previously used discretization method. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2001 chapter

Analytic Center Based Cutting Plane Method for Linear Semi-Infinite Programming

In M. A. Goberna & M. A. Lopez (Eds.), Semi-Infinite Programming. Nonconvex Optimization and Its Applications (pp. 221–233).

By: S. Wu*, S. Fang n & C. Lin*

Ed(s): M. Goberna & M. Lopez

TL;DR: It is shown that a near optimal solution can be obtained by generating a polynomial number of cuts in an analytic center based cutting plane method for solving linear semi-infinite programming problems. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2001 chapter

Entropy Optimization: Shannon Measure of entropy and its properties

In Encyclopedia of Optimization (Vol. 2, pp. 12–18).

By: S. Fang n & H. Tsao*

Sources: NC State University Libraries, NC State University Libraries
Added: August 28, 2021

2001 chapter

Entropy optimization: Measures and properties

In Encyclopedia of optimization / [editors, C.A. Floudas and P.M. Pardalos]. Dordrecht: London: Kluwer Academic.

By: S. Fang & H. Tsao

Source: NC State University Libraries
Added: August 6, 2018

2001 book

Geometric Programming

In Annals of Operations Research (Vol. 105).

Shu-Cherng Fang

Ed(s): S. Fang & C. Scott

Source: NC State University Libraries
Added: August 28, 2021

2001 chapter

Maximum Entropy Principle: Image Reconstruction

In Encyclopedia of Optimization (Vol. 3, pp. 245–249).

By: S. Fang n & H. Tsao*

Source: NC State University Libraries
Added: August 28, 2021

2001 chapter

Minimum entropy principle: Image reconstruction

In Encyclopedia of optimization / [editors, C.A. Floudas and P.M. Pardalos]. Dordrecht: London: Kluwer Academic, c2001. Dordrecht: London: Kluwer Academic.

By: S. Fang & H. Tsao

Source: NC State University Libraries
Added: August 6, 2018

2001 report

On Fuzzy Sets, Habitual Domains, Variational Inequalities, and Optimization

[R.J. Reynolds Lecture Notes, Engineering Publications]. Raleigh, NC: NC State University.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

2001 chapter

Optimal Planning and Sequencing of Parallel Machining Operations

In Handbook of Computational Intelligence in Design and Manufacturing (pp. 8–1-8–13). Boca Raton, FL: CRC Press.

By: S. Fang, Y. Lee & N. Chiu

Source: NC State University Libraries
Added: August 28, 2021

2001 journal article

Optimization of fuzzy relation equations with max-product composition

FUZZY SETS AND SYSTEMS, 118(3), 509–517.

By: J. Loetamonphong n & S. Fang n

author keywords: fuzzy relation equations; max-product composition; branch-and-bound method; integer programming
TL;DR: This paper studies an optimization problem with a linear objective function subject to a system of fuzzy relation equations using max-product composition and captures some special characteristics of its feasible domain and the optimal solutions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2001 article

Solving general capacity problem by relaxed cutting plane approach

ANNALS OF OPERATIONS RESEARCH, Vol. 103, pp. 193–211.

By: S. Wu*, S. Fang n & C. Lin*

author keywords: capacity problem; infinite linear programming; cutting plane method; duality theory
TL;DR: A relaxed cutting plane algorithm is proposed and a convergence proof together with some analysis of the results produced by the algorithm are given. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2001 journal article

Solving nonlinear optimization problems with fuzzy relation equation constraints

FUZZY SETS AND SYSTEMS, 119(1), 1–20.

By: J. Lu n & S. Fang n

author keywords: fuzzy relation equations; genetic algorithms; nonlinear optimization
TL;DR: An optimization model with a nonlinear objective function subject to a system of fuzzy relation equations is presented and a genetic algorithm is proposed designed to be domain specific by taking advantage of the structure of the solution set of fuzzy relationship equations. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2001 article

Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme

Fang, S. C., Lin, C. J., & Wu, S. Y. (2001, April 1). JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, Vol. 129, pp. 89–104.

By: S. Fang n, C. Lin* & S. Wu*

author keywords: semi-infinite programming; quadratic programming; relaxation; interior-point method
TL;DR: A flexible convergence proof is provided to cover different settings of a relaxation scheme and the implementation issues are addressed with some numerical experiments to illustrate the computational behavior of each different combination. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2001 journal article

Untitled - Foreword

Annals of Operations Research, 105(2001), 13–14.

By: C. Scott & S. Fang

Source: NC State University Libraries
Added: August 6, 2018

2000 conference paper

A Bi-Objective Fuzzy c-Mean Cluster Analysis Approach to Fuzzy System Identification

Proceedings of the 8th Bellman Continuum, 165–169.

By: S. Fang, H. Nuttle & T. Hung

Event: 8th Bellman Continuum International Workshop at Hsinchu, Taiwan

Source: NC State University Libraries
Added: August 28, 2021

2000 conference paper

A Genetic Algorithm to Solve Nonbipartite Matching Problems, with D

Proceedings of the 2nd Asia Pacific Conference on Genetic Algorithms and Applications, 194–203.

By: S. Fang & D. Wang

Event: 2nd Asia Pacific Conference on Genetic Algorithms and Applications

Source: NC State University Libraries
Added: August 28, 2021

2000 conference paper

A New Heuristic for Global Optimization

In I. Birbil (Ed.), Proceedings of the 8th Bellman Continuum (pp. 352–357).

By: S. Birbil & S. Fang

Ed(s): I. Birbil

Event: 8th Bellman Continuum International Workshop at Hsinchu, Taiwan

Source: NC State University Libraries
Added: August 28, 2021

2000 journal article

Fuzzy rule quantification and its applications in manufacturing systems

Journal of the Chinese Institute of Industrial Engineers, 17(5), 505–516.

By: D. Wang*, S. Fang n & H. Nuttle n

TL;DR: A rule-based inference engine that describes decision factors by membership functions of corresponding fuzzy sets and decision-making rules by fuzzy logic operations can be easily embedded into other quantitative computation methods for solving complicated problems. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

2000 journal article

Neurocomputing with time delay analysis for solving convex quadratic programming problems

IEEE Transactions on Neural Networks, 11(1), 230–240.

By: Y. Chen* & S. Fang n

author keywords: artificial neural network; convex programming; Hopfield network; linear and quadratic programming; time-delay dynamic system
TL;DR: This paper presents a neural-network computational scheme with time-delay consideration for solving convex quadratic programming problems, and a delay margin is explicitly determined for the stability of the neural dynamics, under which the states of the network does not oscillate. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018

2000 chapter

Optimal planning of parallel machining operation

In Handbook of computational intelligence in design and manufacturing. CRC Press.

By: S. Fang, N. Chiu & Y. Lee

Source: NC State University Libraries
Added: August 6, 2018

2000 conference paper

Sequencing Parallel Machining Operations by Tabu Search

Proceedings of the 8th Bellman Continuum, 175–179.

By: S. Fang, N. Chiu & Y. Lee

Event: 8th Bellman Continuum International Workshop at Hsinchu,Taiwan

Source: NC State University Libraries
Added: August 28, 2021

2000 journal article

Simulation Modeling of the textile supply chain - Part 1: The textile-plant models

JOURNAL OF THE TEXTILE INSTITUTE, 91(1), 35–50.

By: H. Nuttle n, R. King n, N. Hunter n, . Wilson n & S. Fang n

TL;DR: Stochastic computer models that simulate operations in the spinning, knitting, weaving, dyeing and finishing, and cut/sew sectors of the textile industry and ongoing efforts in technology transfer and in using ‘fuzzy’ mathematics to model the vagueness and uncertainty inherent in the supply- chain decision-making environment are described. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2000 journal article

Simulation Modeling of the textile supply chain - Part II: Results and research directions

JOURNAL OF THE TEXTILE INSTITUTE, 91(1), 51–64.

By: H. Nuttle n, R. King n, S. Fang n, . Wilson n & N. Hunter n

TL;DR: The results obtained by exercising a set of computer-simulation models of the various components of the apparel-supply complex are summarized, with the main emphasis placed on whether or not the upstream operations of spinning, fabric production, and dyeing and finishing were capable of meeting Quick Response requirements for response time and service levels. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2000 book

Softcomputing for Industrial Engineering

In Journal of Chinese Institute of Industrial Engineers (Vol. 17).

Shu-Cherng Fang

Ed(s): S. Fang & C. Lee

Source: NC State University Libraries
Added: August 28, 2021

2000 conference paper

Solving Variational Inequalities over a Fuzzy Domain

Proceedings of the 8th Bellman Continuum, 55–59.

By: C. Hu & S. Fang

Event: 8th Bellman Continuum International Workshop at Hsinchu, Taiwan

Source: NC State University Libraries
Added: August 28, 2021

2000 journal article

Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 40(6-7), 721–733.

By: C. Hu* & S. Fang n

author keywords: fuzzy mathematical programming; systems of inequalities; cutting plane method
TL;DR: An efficient implementation based on the concepts of constraint surrogation and maximum entropy is included, and some computational results are also reported. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 conference paper

A clustering-based approach to fuzzy systems identification

Proceedings of the 8th International Fuzzy Systems Association World Congress, August 1999, (1999 Aug.). Piscataway, N.J.: IEEE.

By: S. Fang, T. Hung & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

1999 conference paper

A fuzzy expert system for a wave soldering process

Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999, (1999 Aug.). Piscataway, N.J.: IEEE.

By: S. Fang, S. Chen, P. Wu, M. Huang & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

1999 conference paper

A new fuzzy due-date bargainer with soft computing

Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999, (1999 Aug.). Piscataway, N.J.: IEEE.

By: S. Fang, D. Wang, S. Chen & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

1999 journal article

A relaxed cutting plane algorithm for solving fuzzy inequality systems

Optimization, 45(1-4), 89–106.

By: C. Hu n & S. Fang n

TL;DR: It is shown that solving a system of infinitely many fuzzy inequalities with concavemembership functions can be reduced to a semi-infinite programming problem by using the tolerance approach. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

1999 conference paper

An easily implemented approach to fuzzy systems identification

In T. S. R. N. Dave (Ed.), 18th International Conference of the North American Fuzzy Information Processing Society--NAFIPS: June 10-12, 1999, New York, N.Y., U.S.A. New York, N.Y.; Piscataway, N.J.: IEEE.

By: S. Fang, T. Hung & H. Nuttle

Ed(s): T. R. N. Dave

Source: NC State University Libraries
Added: August 6, 2018

1999 journal article

An efficient solution procedure for fuzzy relation equations with max-product composition

IEEE TRANSACTIONS ON FUZZY SYSTEMS, 7(4), 441–445.

By: J. Loetamonphong n & S. Fang*

author keywords: fuzzy relation equations; max-product composition; minimal solutions
TL;DR: A system of fuzzy relation equations with max-product composition is studied and an efficient solution procedure to characterize the whole solution set by finding the maximum solution as well as the complete set of minimal solutions is presented. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 conference paper

Curved search based neural network learning using fuzzy control

Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999, (1999 Aug.). Piscataway, N.J.: IEEE.

By: S. Fang, P. Wu & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

1999 conference paper

Fuzzy rule quantification and its application in fuzzy due-date bargaining

Proceedings of the 8th International Fuzzy Systems Association World Congress. August 1999, (1999 Aug.). Piscataway, N.J.: IEEE.

By: S. Fang, D. Wang & H. Nuttle

Source: NC State University Libraries
Added: August 6, 2018

1999 journal article

Linear programming with fuzzy coefficients in constraints

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 37(10), 63–76.

By: S. Fang n, C. Hu*, H. Wang* & S. Wu*

author keywords: fuzzy mathematical programming; linear semi-infinite programming
TL;DR: It is shown that such problems with fuzzy coefficients in constraints can be reduced to a linear semi-infinite programming problem and the relations between optimal solutions and extreme points of the linear Semi-Infinite program are established. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 journal article

Sequencing parallel machining operations by genetic algorithms

COMPUTERS & INDUSTRIAL ENGINEERING, 36(2), 259–280.

By: N. Chiu n, S. Fang n & Y. Lee n

author keywords: parallel machines; genetic algorithms; mixed integer programming
TL;DR: A genetic-based algorithm for finding an optimal parallel operation sequence on parallel machines is proposed and two new genetic operators for solving order-based genetic algorithms and computational experiments are included. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 journal article

Soft computing for multicustomer due-date bargaining

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 29(4), 566–575.

By: D. Wang n, S. Fang n & H. Nuttle n

author keywords: due date assignment; fuzzy optimization; genetic algorithms; JIT; MRP-II; production planning; soft computing
TL;DR: To extend the due-date bargainer to accommodate bargaining with several customers at the same time, this work proposes a method to distribute the total penalty using marginal penalties for the individual bargainers. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 journal article

Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 38(3-4), 23–33.

By: S. Wu* & S. Fang n

author keywords: convex semi-infinite programming; cutting plane method; duality theory
TL;DR: This paper presents a relaxed scheme to generate a new cut that exhibits the capability of generating an approximate solution to any level of accuracy in a finite number of iterations. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 journal article

Solving fuzzy inequalities with piecewise linear membership functions

IEEE TRANSACTIONS ON FUZZY SYSTEMS, 7(2), 230–235.

By: C. Hu* & S. Fang*

author keywords: fuzzy mathematical programming; nonlinear programming; systems of fuzzy inequalities
TL;DR: It is shown that a system of fuzzy inequalities with piecewise linear membership functions can be converted to a one-constraint nonlinear programming problem by employing the concepts of surrogate constraints and maximum entropy. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1999 journal article

Solving fuzzy relation equations with a linear objective function

FUZZY SETS AND SYSTEMS, 103(1), 107–113.

By: S. Fang n & G. Li n

author keywords: fuzzy relation equations; branch-and-bound method; integer programming
TL;DR: This paper first characterize the feasible domain and then converts the problem to an equivalent problem involving 0–1 integer programming with a branch-and-bound solution technique, and presents the solution procedure. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 journal article

A fuzzy due-date bargainer for the make-to-order manufacturing systems

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 28(3), 492–497.

By: D. Wang*, S. Fang* & T. Hodgson*

author keywords: branch-and-bound; due-date assignment; fuzzy optimization; just-in-time (JIT); MRP-II; production planning
TL;DR: A combined due-date assignment and production planning methodology for the make-to-order manufacturing systems is developed using manufacturing resource planning data from a furniture manufacturing company, and experimental results indicate its potential as a useful tool for real applications. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 journal article

A global-filtering algorithm for linear programming problems with stochastic elements

MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 48(3), 287–316.

By: S. Guan & S. Fang*

author keywords: linear programming; stochastic programming; Kalman filter; infeasible-interior-point method
TL;DR: An interior-point based global filtering algorithm is proposed to solve linear programming problems with the right-hand-side and cost vectors being stochastic and shown to be globally convergent to an optimal solution of the underlying “true value” system. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

1998 journal article

An unconstrained convex programming approach to linear semi-infinite programming

SIAM JOURNAL ON OPTIMIZATION, 8(2), 443–456.

By: C. Lin, S. Fang* & S. Wu

author keywords: semi-infinite programming; linear programming; convex programming; entropy optimization
TL;DR: An unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed and primal and dual convergence results are established under some basic assumptions. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 conference paper

Multi-customer due-date bargaining with soft computing

Proceedings of the Fourth Joint Conference of Information Sciences. 1998, 2(1998), 84–87.

By: S. Fang, M. Donovan, H. Nuttle & J. Wilson

Source: NC State University Libraries
Added: August 6, 2018

1998 report

Multicustomer Due-Date Bargainer

[Software]. Raleigh, NC: North Carolina State University.

By: H. Nuttle, S. Fang, D. Wang & M. Donovan

Source: NC State University Libraries
Added: March 22, 2021

1998 conference paper

Operation scheduling of mill/turn machining centers with genetic algorithms

Proceedings of the Fourth Joint Conference of Information Sciences. 1998, 2(1998), 437–440.

By: S. Fang, N. Chiu & Y. Lee

Source: NC State University Libraries
Added: August 6, 2018

1998 journal article

Optimal cutter selection and machining plane determination for process planning and NC machining of complex surfaces

JOURNAL OF MANUFACTURING SYSTEMS, 17(5), 371–388.

By: Y. Chen n, Y. Lee n & S. Fang n

author keywords: cutter selection; process planning; computer aided manufacturing; NC machining; dynamic programming; integer programming
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 journal article

Quantitative management techniques and application in Taiwan

International Journal of Operations and Quantitative Management, 4(3).

By: S. Fang & C. Kao

Source: NC State University Libraries
Added: August 6, 2018

1998 journal article

Relaxed cutting plane method for solving linear semi-infinite programming problems

Journal of Optimization Theory and Applications, 99(3), 759–779.

By: S. Wu*, S. Fang n & C. Lin*

TL;DR: This paper generalizes the Gustafson and Kortanek scheme to relax the requirement for a global optimizer of a nonlinear and nonconvex program, and introduces an explicit algorithm which allows the unnecessary constraints to be dropped in each iteration to reduce the size of computed programs. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

1998 journal article

Solving convex programming problems with equality constraints by neural networks

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 36(7), 41–68.

By: Y. Chen & S. Fang n

author keywords: convex programming; penalty function; artificial neural networks; Hopfield networks
TL;DR: It is shown that under proper conditions, an optimal solution of the underlying convex programming problems is an equilibrium point of the neural dynamics, and vise versa. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 journal article

Solving fuzzy inequalities with concave membership functions

FUZZY SETS AND SYSTEMS, 99(2), 233–240.

By: C. Hu n & S. Fang n

author keywords: fuzzy mathematical programming; fuzzy membership functions; systems of fuzzy inequalities
TL;DR: It is shown that a system of fuzzy inequalities with concave membership functions can be converted to a regular convex programming problem and a “method of centres” with “entropic regularization” techniques is proposed for solving such a problem. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science; OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1998 personal communication

Solving interval-valued fuzzy relation equations

Li, G. Z., & Fang, S. C. (1998, May).

By: G. Li n & S. Fang n

author keywords: composite interval-valued fuzzy relation equations; fuzzy relation equations; max-min composition
TL;DR: This paper converts the composite interval-valued fuzzy relation equations into a fuzzy relation inequality system and proposes an efficient computational procedure to generate the whole solution set. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 journal article

A fuzzy expert system model for RF receiver module testing

International Journal of Systems Science, 28(8), 791–798.

By: J. Lu n, P. Brinkley* & S. Fang n

TL;DR: An expert system for PCS-1900 radio frequency module test failure diagnostics that incorporates fuzzy logic that gives a degree of failure for each mode, indicating the possibility of that mode being faulty. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

1997 conference paper

A fuzzy-control-based quick response reorder scheme for retailing of seasonal apparel

Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing, 2, 300–303. Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory.

By: S. Fang, T. Chen, H. Nuttle & R. King

Source: NC State University Libraries
Added: August 6, 2018

1997 journal article

A genetics-based approach for aggregated production planning in a fuzzy environment

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 27(5), 636–645.

By: D. Wang* & S. Fang n

TL;DR: A genetics-based inexact approach is proposed to imitate the human decision procedure for production planning, which finds a family of inexact solutions within an acceptable level by adopting a mutation operator to move along a weighted gradient direction. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 journal article

A global-filtering algorithm for linear programming problems with stochastic elements

IEEE Transactions on Systems, Man, and Cybernetics. Part A, Systems and Humans, 27(5), 636–645.

By: D. Wang & S. Fang

Source: NC State University Libraries
Added: August 6, 2018

1997 journal article

A maximum entropy optimization approach to tandem queues with generalized blocking

PERFORMANCE EVALUATION, 30(4), 217–241.

By: S. Mishra & S. Fang n

author keywords: queueing networks; open tandem queue; principle of maximum entropy; nonlinear programming; kanban blocking; general blocking; mean queue length distribution
TL;DR: This work decomposes the tandem queue into a group of two-node subsystems and applies the principle of maximum entropy to evaluate different parameters such as the blocking probabilities, starvation probabilities, etc., of each subsystem, and proposes a step-by-step algorithm along with its convergence properties. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 conference paper

A neural network approach to solving convex programming problems

Joint Conference of Information Sciences: Semiotics, fuzzy logic, soft computing, computer vision, neural computing, genetic algorithm, pattern recognition, evolutionary computing, 2, 215–218. Durham, NC: Duke University Machine Intelligence & Fuzzy Logic Laboratory.

By: S. Fang & Y. Chen

Source: NC State University Libraries
Added: August 6, 2018

1997 book

Entropy optimization and mathematical programming

Boston: Kluwer Academic Publishers.

By: S. Fang, J. Rajasekera & H. Tsao

Source: NC State University Libraries
Added: August 6, 2018

1997 book

Fuzzy Mathematics and Optimization

Beijing, China: Science Press.

By: D. Wang & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1997 journal article

Linear programming with stochastic elements: An on-line approach

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 33(9), 61–82.

By: S. Guan n & S. Fang n

author keywords: linear programming; infeasible-interior-point method; stochastic programming; Kalman filter
TL;DR: It is proved that the proposed on-line approach to linear programming problems with both the cost and right-hand-side vectors being stochastic is globally convergent to a “true value solution” in the mode of quadratic mean. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 book

Mo hu shu hsueh yu mo hu yiu hua=Fuzzy mathematics and optimization

Beijing, China: Ko hsueh chu pan she.

By: S. Fang & D. Wang

Source: NC State University Libraries
Added: August 6, 2018

1997 journal article

On the entropic regularization method for solving min-max problems with applications

MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 46(1), 119–130.

By: X. Li* & S. Fang n

author keywords: min-max problem; linear and nonlinear programming; entropy optimization principles
TL;DR: Withp being sufficiently large, minimizing the smooth functionFp(x) overX provides a very accurate solution to the min-max problem and the same procedure can be applied to solve systems of inequalities, linear programming problems, and constrained min- max problems. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 journal article

Perturbing the dual feasible region for solving convex quadratic programs

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 94(1), 73–85.

By: S. Fang n & H. Tsao*

author keywords: convex quadratic programming; duality theory; perturbation methods
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1997 journal article

The point-to-point connection problem - analysis and algorithms

DISCRETE APPLIED MATHEMATICS, 78(1-3), 207–226.

By: M. Natu n & S. Fang n

author keywords: algorithms; point-to-point connection problem; dynamic programming; computational complexity
TL;DR: This paper examines the structure of the problem with two source-destination pairs and provides an efficient implementation of a Dijkstra-like algorithm and conjecture that the same approach can be generalized for p source-Destination pairs with complexity O (n 3p + 2 ) where p is fixed. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

1996 journal article

A dual perturbation view of linear programming

Mathematical Methods of Operations Research, 44(1), 1–9.

By: S. Fang n & H. Tsao*

TL;DR: This paper investigates a new perturbation scheme which obtains a dual optimal solution by perturbing the dual feasible domain under different norms and shows that it generalizes the primal entropic perturbations approach to linear programming. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

A relaxed primal-dual path-following algorithm for linear programming

Annals of Operations Research, 62(1), 173–196.

By: T. Hwang*, C. Lin*, W. Lin* & S. Fang n

author keywords: linear programming; primal-dual method; interior path-following algorithm; relaxation method
TL;DR: This paper provides an easily satisfied relaxation condition for the primaldual interior path-following algorithm to solve linear programming problems and shows that the relaxed algorithm preserves the property of polynomial-time convergence. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm

Computers & Mathematics with Applications, 31(8), 95–106.

By: D. Wang & S. Fang n

author keywords: production planning; earliness/tardiness schedule; genetic algorithm; semi-infinite programming
TL;DR: A specially designed genetic algorithm with mutation along the negative gradient direction is developed, a combination of the steepest descent method with the stochastic sampling algorithm. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints

Journal of Computational and Applied Mathematics, 72(1), 127–139.

By: S. Fang n & H. Tsao*

author keywords: linearly-constrained entropy optimization; infinite constraint set; cutting-plane method; duality
TL;DR: A cutting-plane type algorithm for solving entropy optimization problems with a finite number of variables but an infinite number of linear constraints that shows its potential for solving large-scale problems. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

Just-in-Time Production Planning with Semi-Infinite Programming and Genetic Algorithms

Journal of Control and Decision, 11, 446–451.

By: S. Fang & D. Wang

Source: NC State University Libraries
Added: August 28, 2021

1996 journal article

On the entropic perturbation and exponential penalty methods for linear programming

Journal of Optimization Theory and Applications, 89(2), 461–466.

By: S. Fang n & H. Tsao*

author keywords: linear programming; penalty function method; barrier function method; path-following method
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

Parametric linear semi-infinite programming

Applied Mathematics Letters, 9(3), 89–96.

By: C. Lin*, S. Fang n & S. Wu*

author keywords: semi-infinite programming; linear programming; convex programming
TL;DR: It is shown that the solution of a linear semi-infinite programming problem can be obtained by solving a sequence of optimization problems with a single constraint. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

Solving Linear Programs With Inequality Constraints Via Perturbation of Feasible Region

Optimization, 37(3), 213–223.

By: S. Fang* & H. Tsao*

TL;DR: An e-optimality theory that specifies the perturbation parameter in terms of required accuracy level e and other program parameters is studied and converts the optimal solution of a perturbed program to aDual feasible solution, which in turn converges to a dual optimal solution, of the given linear program. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1996 journal article

Solving min-max problems and linear semi-infinite programs

Computers & Mathematics with Applications, 32(6), 87–93.

By: S. Fang n & S. Wu*

author keywords: min-max problem; linear semi-infinite programming; convex programming; entropy optimization
TL;DR: It is shown that an entropic regularization procedure can provide a smooth approximation F p ( x) that uniformly converges to F ( x ) over X, as p tends to infinity. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

A New Approach to Tolerance Allocation in Design Cost Analysis

Engineering Optimization, 24(4), 283–291.

By: J. Rajasekera* & S. Fang*

author keywords: TOLERANCE ALLOCATION; COMPUTER AIDED DESIGN; DESIGN FOR MANUFACTURABILITY; CONVEX OPTIMIZATION
TL;DR: This paper focuses on the tolerance allocation stage, and an O(n log2n) algorithm is developed for optimally allocating the total design tolerance among the n constituent components of a product. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

A primal-dual infeasible-interior-point algorithm for linear semi-infinite programming

Computers & Mathematics with Applications, 29(8), 7–18.

By: R. Sheu*, S. Wu* & S. Fang n

author keywords: SEMIINFINITE LINEAR PROGRAMMING; PRIMAL-DUAL METHOD; INFEASIBLE-INTERIOR-POINT METHOD
TL;DR: An algorithm for solving linear semi-infinite programming problems by using the recently developed primal-dual infeasible-interior-point method for linear programming enjoys the advantages of having “multiple inexactness” and “warm start” for computational efficiency. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions

Zeitschrift Für Operations Research, 42(3), 325–343.

By: H. Tsao* & S. Fang n

TL;DR: An unconstrained dual approach and an efficient algorithm for solving Karmarkar-type linear programming problems and a globally convergent curved-search algorithm with a quadratic rate of convergence are proposed. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Decision Surface Modeling of Apparel Retail Operations using Neural Network Technology

International Journal of Operations and Quantitative Management, 1, 33–47.

By: P. Wu, S. Fang, R. King & H. Nuttle

Source: NC State University Libraries
Added: August 28, 2021

1995 journal article

Entropy Optimization Models with Convex Constraints

Information and Computation, 116(2), 304–311.

By: S. Fang n & J. Rajasekera n

TL;DR: This approach generalizes the previous results of linearly, quadratically, and entropically constrained cross-entropy optimization problems and provides a platform for using general purpose optimizers to generate ? (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Guided Neural Network Learning Using a Fuzzy Controller, with Applications to Textile Spinning

International Transactions in Operational Research, 2(3), 259–272.

By: P. Wu n, S. Fang n, H. Nuttle n, J. Wilson n & R. King n

Sources: Crossref, NC State University Libraries
Added: February 24, 2020

1995 journal article

Implementation of an inexact approach to solving linear semi-infinite programming problems

Journal of Computational and Applied Mathematics, 61(1), 87–103.

By: C. Lin*, E. Yang*, S. Fang n & S. Wu*

author keywords: SEMIINFINITE PROGRAMMING; LINEAR PROGRAMMING; ENTROPY OPTIMIZATION
TL;DR: An extended version of the inexact approach proposed by Fang and Wu (1994) for solving linear semi-infinite programming problems is implemented and results confirm that the inexacts approach is indeed more efficient and more robust than the exact approach. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Linear programming with inequality constraints via entropic perturbation

International Journal of Mathematics and Mathematical Sciences, 19(1), 177–184.

By: H. Tsao* & S. Fang n

TL;DR: A dual convex programming approach to solving linear programs with inequality con- straints through entropic perturbation is derived and an e- optimal solution can be obtained effortlessly from the optimal solution of the dual program. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems

Transportation Science, 29(4), 353–365.

By: S. Fang n & H. Tsao

TL;DR: This paper focuses on a class of linearly-constrained entropy maximization problem with quadratic cost, study its Lagrangian dual, and provides a globally convergent algorithm with a quadratics rate of convergence. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

On the point-to-point connection problem

Information Processing Letters, 53(6), 333–336.

By: M. Natu n & S. Fang n

author keywords: ALGORITHMS; POINT-TO-POINT CONNECTION PROBLEM; DYNAMIC PROGRAMMING; COMPUTATIONAL COMPLEXITY
TL;DR: A Dijkstra-like algorithm for solving the point-to-point connection problem on a finite directed network is presented and it is shown that the time complexity of the algorithm is O ( n 4 ). (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Solving stochastic programming problems via Kalman filter and affine scaling

European Journal of Operational Research, 83(3), 503–513.

By: S. Puthenpura*, L. Sinha*, S. Fang n & R. Saigal*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1995 journal article

Unconstrained convex programming approach to linear programming

Journal of Optimization Theory and Applications, 86(3), 745–752.

By: Z. Xu* & S. Fang n

author keywords: CONVEX PROGRAMS; LINEAR PROGRAMS; PERTURBATIONS; DUALITY
TL;DR: A necessary and sufficient condition for the existence of a dual optimal solution to the perturbed problem is presented and a sharp upper bound of error estimation in this approximation scheme is provided. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 chapter

A Dual Affine Scaling Based Algorithm for Solving Linear Semi-Infinite Programming Problems

In D. Z. Du & J. Sun (Eds.), Advances in Optimization and Approximation (pp. 217–234).

By: C. Lin*, S. Fang n & S. Wu*

Ed(s): D. Du & J. Sun

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 journal article

A Relaxed Interior Path Following Primal – Dual Algorithm for Convex Quadratic Programming

Mathematics Today, (Special Issue XII-A), 115–144.

By: T. Huang, C. Lin, W. Lin & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1994 journal article

A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem

European Journal of Operational Research, 79(2), 369–378.

By: S. Fang n & H. Tsao*

author keywords: ENTROPY OPTIMIZATION; DUALITY; UNCONSTRAINED OPTIMIZATION; CURVED-SEARCH ALGORITHM
TL;DR: A curved-search algorithm for solving the cross-entropy minimization problem with linear equality constrains converges globally to a dual optimal solution with a quadratic rate of convergence. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 journal article

An inexact approach to solving linear semi-infinite programming problems

Optimization, 28(3-4), 291–299.

By: S. Fang n & S. Wu*

TL;DR: An “inexact solution” approach to deal with linear semi-infinite programming problems with finitely many variables and infinitely many constraints over a compact metric space is proposed. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 conference paper

Decision Surface Modeling of Textile Retail Operations using Neural Network

Proceedings of the Annual Fuzzy Theory and Technology International Conference, 312–315.

By: H. Nuttle, P. Wu, R. King, J. Wilson & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1994 journal article

Entropic Path-Following for Linear Semi-Infinite Programming

Mathematics Today, (Special Issue XII-A), 1–16.

By: S. Fang & S. Wu

Source: NC State University Libraries
Added: August 28, 2021

1994 conference paper

Modeling Textile, Apparel, Retail Operations and Interactions

In S. Kawasbata & M. Niwa (Eds.), Proceedings of the 23rd Textile Research Symposium at Mt. Fuji.

By: G. Berkstresser, S. Fang, A. Hunter, H. Nuttle, R. King & J. Wilson

Ed(s): S. Kawasbata & M. Niwa

Event: 23rd Textile Research Symposium at Mt. Fuji at Kyoto University, Kyoto, Japan

Source: NC State University Libraries
Added: August 28, 2021

1994 conference paper

Modeling the Actions and Interactions of the Textile-Apparel-Retail Pipeline

In L. Burke & J. Jackman (Eds.), 3rd Industrial Engineering Research Conference Proceedings (pp. 142–147).

By: R. King, A. Hunter, H. Nuttle, J. Wilson & S. Fang

Ed(s): L. Burke & J. Jackman

Event: 3rd Industrial Engineering Research Conference at Institute of Industrial Engineers, Atlanta, GA

Source: NC State University Libraries
Added: August 28, 2021

1994 book review

Numerical linear algebra and optimization–volume 1, by Philip E. Gill. Walter Murray, and Margaret H. Wright, Addison-Wesley, Redwood City, CA, 1991, 448 pp. Price: $46.25

[Review of Numerical linear algebra and optimization, by P. E. Gill, W. Murray, & M. H. Wright]. Networks, 24(2), 128–129.

By: S. Fang n & S. Puthenpura*

UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 journal article

On solving convex quadratic semi-infinite programming probelms

Optimization, 31(2), 107–125.

By: S. Fang n, C. Lin* & S. Wu*

TL;DR: An entropic path-following algorithum is introduced with a convergence proof for convex quadratic semi-infinite programming problems with finitely many variables and infinitely many constraints over a compact metric space. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 journal article

On the generalized path-following methods for linear programming

Optimization, 30(3), 235–249.

By: R. Sheu* & S. Fang n

TL;DR: A generic path-following algorithm is proposed and sufficient conditions for convergence and polynomality proofs are derived. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1994 journal article

The Complexity of Finding K Disjoint Paths in a Network

Journal of the Chinese Institute of Industrial Engineers, 11, 125–128.

By: S. Fang & M. Natu

Source: NC State University Libraries
Added: August 28, 2021

1993 journal article

A Bayesian Interpretation of the Linearly-Constrained Cross-Entropy Minimization Problem

Engineering Optimization, 22(1), 65–75.

By: H. Tsao*, S. Fang n & D. Lee*

author keywords: BAYESIAN ESTIMATION; LINEARLY-CONSTRAINED MINIMUM CROSS-ENTROPY; DUALITY
TL;DR: An equivalence relationship between these two approaches is established by identifying certain statistical experiments “embedded” in the LCMXE framework and it is shown that, while new information may come in stages, the identical final posterior can be obtained by applying theLCMXE method either stagewise or collectively. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1993 journal article

An unconstrained convex programming approach to solving convex quadratic programming problems

Optimization, 27(3), 235–243.

By: S. Fang n & H. Tsao*

TL;DR: An unconstrained convex programming approach to solving convex quadratic programming problems in standard form and related duality theory is established by using two simple inequalities. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1993 book

Linear Optimization and Extensions: Theory and Algorithms

Englewood Cliffs, New Jersey: Prentice Hall.

By: S. Puthenpura & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1993 journal article

Linear Programming

Mathmedia, 17(1), 28–37.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1993 journal article

Linear programming with entropic perturbation

Zeitschrift Für Operations Research, 37(2), 171–186.

By: S. Fang n & H. Tsao*

TL;DR: An unconstrained convex programming approach to solving standard form linear programs through an entropic perturbation is derived and is proven to be globally convergent with a quadratic rate of convergence. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1993 conference paper

Some New Applications of Operations Research at NCSU

Proceedings of Sino-American International Technology Transfer Symposium, 259–260.

By: S. Fang

Event: Sino-American International Technology Transfer Symposium

Source: NC State University Libraries
Added: August 28, 2021

1992 journal article

An unconstrained convex programming view of linear programming

Zeitschrift Für Operations Research, 36(2), 149–161.

By: S. Fang n

TL;DR: It is shown that, at least in theory, a pair of primal and dual “ɛ-optimal solutions” to a general linear program in Karmarkar's standard form can be obtained by solving an unconstrained convex program. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1992 journal article

Deriving an unconstrained convex program for linear programming

Journal of Optimization Theory and Applications, 75(3), 603–612.

By: J. Rajasekera* & S. Fang n

author keywords: LINEAR PROGRAMMING; CONVEX PROGRAMMING; GEOMETRIC PROGRAMMING; DUALITY THEORY
TL;DR: It is shown that Fang's derivation of an unconstrained convex dual program can be greatly simplified by using only one simple geometric inequality. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1992 journal article

Insights into the interior-point methods

Zeitschrift Für Operations Research, 36(3), 227–257.

By: R. Sheu n & S. Fang n

TL;DR: The derivation of new interior-point algorithms is illustrated by replacing the logarithmic barrier function with an entropic barrier function, and the results have been generalized and discussed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1992 book

Introduction to Optical Fiber Communications

(2nd ed.). R.O.C., Taiwan: National Translation and Compiler Bureau of Taiwan.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1992 journal article

Minimum cross-entropy analysis with entropy-type constraints

Journal of Computational and Applied Mathematics, 39(2), 165–178.

By: S. Fang n, E. Peterson n & J. Rajasekera*

author keywords: ENTROPY OPTIMIZATION; INFORMATION THEORY; GEOMETRIC PROGRAMMING; PROBABILITY INFERENCE
TL;DR: A simple geometric inequality is used to derive its dual problem and to show the “strong duality theorem”, and it is found this geometric dual is a computationally attractive canonical program that is always consistent. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1992 journal article

On the optimal entropy analysis

European Journal of Operational Research, 59(2), 324–329.

By: H. Tsao*, S. Fang n & D. Lee*

author keywords: ENTROPY OPTIMIZATION; INFORMATION THEORY; GEOMETRIC PROGRAMMING; PROBABILITY INFERENCE
TL;DR: Jensen's inequality is used to derive a dual approach to solving linearly constrained entropy optimization problems with a countably infinite number of states and extends a Geometric Programming approach to the same problem with only a finite number ofStates. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1992 journal article

On the relationship of interior-point methods

International Journal of Mathematics and Mathematical Sciences, 16(3), 565–572.

By: R. Sheu* & S. Fang n

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1991 journal article

A new variant of the primal affine scaling algorithm for linear programs

Optimization, 22(5), 681–715.

By: G. Jan* & S. Fang n

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1991 conference paper

Entropy Optimization Methods and Bayesian Estimation Procedure

Proceedings of Advances in Mathematics, Computations, and Reactor Physics, 17(2), 3.1–3.11.

By: H. Tsao, D. Lee & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1991 journal article

On the convex programming approach to linear programming

Operations Research Letters, 10(6), 309–312.

By: J. Rajasekera* & S. Fang n

author keywords: LINEAR PROGRAMMING; ENTROPY; CONVEX PROGRAMMING; GEOMETRIC PROGRAMMING; DUALITY THEORY
TL;DR: It is shown that Fang's results can be obtained directly using a simple geometric inequality and provides a better @e-optimal solution generation scheme in a simpler way. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1991 conference paper

Promising New Interior-Point Methods for Large Scale Linear Programming

Proceedings of Advances in Mathematics, Computations, and Reactor Physics, 17(2), 2.1–2.12.

By: E. Peterson & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1990 report

A Bayesian Interpretation of the Linearly Constrained Cross-Entropy Minimization Problem

(AT&T Bell Laboratories Technical Memorandum No. 51173-901204-01).

By: H. Tao, D. Lee & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1990 conference paper

A New Method to Test Electric Shorts on PCB

IIE Proceedings of Annual Conference, 65–68.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1990 journal article

An Efficient Method for the PCB Shorts-Testing

Chinese Journal of Operations Research, 9(2), 75–80.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1990 journal article

Detecting electrical shorts on printed circuit boards

International Journal of Production Research, 28(6), 1031–1037.

By: S. Fang n

TL;DR: A new method that requires only O(k[log2 N]) tests to achieve the same resolution using the same device is presented. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1990 report

Jensen’s Inequality for Optimal Entropy Analysis

(AT&T Bell Laboratories Technical Memorandum No. 51173-900820-01TM).

By: S. Fang, H. Tsao & D. Lee

Source: NC State University Libraries
Added: August 28, 2021

1990 conference paper

Minimum Cost Tolerance Allocation with Exponential Cost Function

IIE Proceedings of Annual Conference, 476–480.

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1990 conference paper

New Advances in Telecommunications Network Planning

Proceedings of CAAPCON, 595–598.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1990 report

Optimal Control for Stochastic Linear Programming Systems, 7 Claims

[US Patent Application].

By: S. Puthenpura, S. Fang, R. Saigal & L. Sinha

Source: NC State University Libraries
Added: August 28, 2021

1990 chapter

Planning an Integrated Communication Network for Automated Manufacturing Systems

In H. R. Parsaei, T. L. Ward, & W. Karwowski (Eds.), Justification Methods for Computer Integrated Manufacturing (pp. 62–84).

By: S. Fang

Ed(s): H. Parsaei, T. Ward & W. Karwowski

Source: NC State University Libraries
Added: August 28, 2021

1990 journal article

Quadratically constrained information theoretic analysis

International Journal of Systems Science, 21(3), 587–591.

By: S. Fang n & J. Rajasekera*

TL;DR: It is shown that the dual problem obtained by Zhang and Brockett is actually a geometric dual, and the quadratically constrained MDI estimation can be enriched by the theory of generalized geometric programming. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1990 report

Solving Stochastic Programming Problems via Kalman filter and Affine Scaling

(AT&T Bell Laboratories Technical Memorandum No. 51173-900808-01).

By: S. Fang, S. Puthenpura, R. Saigal & L. Sinha

Source: NC State University Libraries
Added: August 28, 2021

1989 journal article

Quadratic Programming with A Single Quadratic Constraint

Journal of Chinese Institute of Industrial Engineers, 6(1), 37–42.

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1989 journal article

Quadratically constrained minimum cross-entropy analysis

Mathematical Programming, 44(1-3), 85–96.

By: S. Fang n & J. Rajasekera*

TL;DR: This paper separate the probability constraint from general quadratic constraints and use two simple geometric inequalities to derive its dual problem and directly prove the “strong duality theorem” and derive a “dual-to-primal” conversion formula. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1989 conference paper

Telecommunication Network Facility Capacity Planning

Proceedings of ACSSUS 13th Annual Conference, 40–59.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1988 conference paper

A Computer Aided Manufacturing System for Fiber Optics Shops

Proceedings of the Modern Engineering & Technologies Seminar, II, 327–333.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1988 journal article

Controlled dual perturbations for posynomial programs

European Journal of Operational Research, 35(1), 111–117.

By: S. Fang*, E. Peterson n & J. Rajasekera*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1988 conference paper

Designing an Integrated Telecommunication Network for Factory Automation

Proceedings of the Modern Engineering & Technologies Seminar, II, 303–325.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1988 conference paper

Multifacility Transportation-Location Problem with Rectilinear Distances

IIE Proceedings of Annual Conference, 170–173.

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1987 journal article

A perturbation approach to the main duality theorem of quadratic geometric programming

Zeitschrift Für Operations Research, 31(3), A103–A118.

By: S. Fang* & J. Rajasekera

TL;DR: The main duality theorem is proved by using a dual perturbation approach and two simple geometric inequalities to establish a numerically precise dual based solution procedure for quadratic geometric programs. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1987 book

AT&T Factory Data Network Planning Book

Berkeley Heights, New Jersey: AT&T Corporate Headquarters.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

AT&T Factory Data Network Planning Book

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

AT&T Factory Data Networking Planning Baseline Architecture Document

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 conference paper

An EOQ Discount Pricing Model for Multiple Items

In A. Mital (Ed.), Proceedings of the 9th International Conference on Production Research (pp. 1737–1743).

By: S. Fang & J. Rajasekera

Ed(s): A. Mital

Source: NC State University Libraries
Added: August 28, 2021

1987 report

Intrafactory Data Network Planning – Part I: MAP Economics

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

Intrafactory Data Network Planning – Part II: Target Architecture

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

Intrafactory Data Network Planning – Part III: Target Implementation

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

Intrafactory Data Network Planning – Part IV: Fiber Distribution Plan

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

Intrafactory Data Network Planning – Part V: Transition Plan

[AT&T Corporate Headquarters Technical Memorandum].

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 report

On the Quadratically Constrained Information Theoretic Analysis

(Technical Report No. CC8743). AT&T Engineering Research Center.

By: J. Rajasekera & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1987 journal article

Optimal repair decisions for integrated circuits manufacturing

International Journal of Systems Science, 18(4), 743–747.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1987 report

Quadratic Programming with a Single Quadratic Constraint

(Technical Report No. CC8682). AT&T Engineering Research Center.

By: J. Rajasekera & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1986 report

A Perturbation Approach to the Main Duality Theorem of Quadratic Geometric Programs

(AT&T Bell Laboratories Technical Memorandum No. 54142-860718-01).

By: J. Rajasekera & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1986 journal article

Comments on "An iterative method for generalized complementarity problems"

IEEE Transactions on Automatic Control, 31(11), 1083–1084.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1986 journal article

Controlled dual perturbations for l p -programming

Zeitschrift Für Operations Research, 30(1), A29–A42.

By: S. Fang* & J. Rajasekera*

TL;DR: This paper introduces a mechanism to construct a suitably perturbed dual program with a differentiable concave objective function over linear constraints and shows a way of constructing a linear program based on this dual solution. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1986 journal article

Controlled perturbations for quadratically constrained quadratic programs

Mathematical Programming, 36(3), 276–289.

By: S. Fang* & J. Rajasekera*

TL;DR: A perturbation theory is established to display that a well-controlled perturbations on the dual program can overcome the nondifferentiability issue and generate an ε-optimal dual solution for an arbitrarily small number ε. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1986 report

Dynamic Facility Network Planning – A Linear Programming Loader with Arbitrary Incremental Demands and Rearrangement Capabilities

(AT&T Bell Laboratories Technical Memorandum No. 54112-860610-01).

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1986 report

Dynamic Facility Network Planning – A Solution Architecture with Block Cholesky Factorization

(AT&T Bell Laboratories Technical Memorandum No. 54112-860305-01).

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1986 report

Dynamic Facility Network Planning – Design Architecture

(AT&T Bell Laboratories Technical Memorandum No. 54112-860226-01).

By: L. Slutsman & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1985 report

A Dual Perturbation Method for Geometric Programming

(AT&T Bell Laboratories Technical Memorandum No. 54112-850815-0).

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1985 report

A Perturbation Method for Quadratically Constrained Quadratic Programming

(AT&T Bell Laboratories Technical Memorandum No. 54112-850715-01).

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1985 journal article

A fixed-point representation of the generalized complementarity problem

Journal of Optimization Theory and Applications, 45(3), 375–381.

By: S. Fang* & E. Peterson n

UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1985 report

An Introduction to Multimode LITES

(Technical Report No. CC8305). AT&T Engineering Research Center.

By: M. Murr & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1985 journal article

An economic equilibrium model on a multicommodity network

International Journal of Systems Science, 16(4), 479–490.

By: S. Fang* & E. Peterson n

UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1985 report

Controlled Dual Perturbations for lp Programming

(AT&T Bell Laboratories Technical Memorandum No. 54112-851115-01).

By: S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1985 report

Dynamic Facility Network Planning – Modeling

(AT&T Bell Laboratories Technical Memorandum No. 54112–850915–01).

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1985 conference paper

Finding a Simple Sequential Algorithm for Transportation Problems

IIE Proceedings of Annual Conference, 533–537.

By: S. Fang & M. Murr

Source: NC State University Libraries
Added: August 28, 2021

1985 report

Multiple Link Outage Analysis, AT&T Bell Laboratories

(AT&T Bell Laboratories Internal Memorandum No. 54112-850703-01).

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1985 journal article

Optimal assortment with concave cost functions

International Journal of Systems Science, 16(10), 1305–1311.

By: S. Fang*

TL;DR: Sufficient conditions for the existence of an optimal segmented policy are investigated and a dynamic programming algorithm for an optimal assortment is included. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1984 report

A Fiber Selection Algorithm for Submarine Lightguide Systems

(Technical Report No. CC8165). AT&T Engineering Research Center.

By: M. Murr & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1984 journal article

A linearization method for generalized complementarity problems

IEEE Transactions on Automatic Control, 29(10), 930–933.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1984 journal article

Routeing in a Network with Multi-Class Links

Journal of the Operational Research Society, 35(7), 637–640.

By: S. Fang*

TL;DR: By using the new model, the original routeing problem is no more than a shortest-path problem and the model can be implemented to current electronic switching machines. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1984 report

Statistical Analysis of Splice Losses of Lightguide Fiber at Atlanta Works

(Technical Report No. CC8426). AT&T Engineering Research Center.

By: M. Murr, S. Fang & J. Rajasekera

Source: NC State University Libraries
Added: August 28, 2021

1983 journal article

A Sequential Algorithm for an Inventory Selection Problem

IMA Journal of Applied Mathematics, 31(2), 161–168.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1983 conference paper

A Span Engineering Algorithm for Lightguide Cable Manufacturing

Proceedings of Annual Conference of the Western Electric Applied Math Seminar, 1–12.

By: S. Fang & M. Murr

Source: NC State University Libraries
Added: August 28, 2021

1983 report

A Span Engineering Algorithm for Lightguide Cable Manufacturing

(Technical Report No. CC7957). AT&T Engineering Research Center.

By: M. Murr & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1983 report

A Span Engineering Algorithm for Loop Fibers

(Technical Report No. CC8056). AT&T Engineering Research Center.

By: S. Fang & M. Murr

Source: NC State University Libraries
Added: August 28, 2021

1983 journal article

General network equilibrium analysis

International Journal of Systems Science, 14(11), 1249–1257.

By: S. Fang* & E. Peterson n

UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1982 journal article

A Note on Q-Matrices

Bulletin of the Institute of Mathematics Academia Sinica, 10(3), 239–243.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1982 journal article

A model for locating repair stations in a sequential manufacturing process

Applied Mathematical Modelling, 6(5), 363–368.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1982 report

Fiber Selection Problem in the Lightguide Cable Ribboning Process

(Technical Report No. CC7778). AT&T Engineering Research Center.

By: M. Murr & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1982 journal article

Fixed Point Models for the Equilibrium Problems on Transportation Networks

Tamkang Journal of Mathematics, 13(2), 181–191.

By: S. Fang

Source: NC State University Libraries
Added: July 31, 2021

1982 journal article

Generalized variational inequalities

Journal of Optimization Theory and Applications, 38(3), 363–383.

By: S. Fang* & E. Peterson n

UN Sustainable Development Goal Categories
10. Reduced Inequalities (Web of Science; OpenAlex)
Sources: Crossref, NC State University Libraries
Added: June 13, 2021

1982 conference paper

Optimal Scheduling of the Coil Slitting Problem

IIE Proceedings of Annual Conference, 476–480.

By: C. Lamendola & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1982 journal article

Solving Linear Constrained Separable Convex Programs via Generalized Geometric Programming Duality

Chinese Journal of Mathematics, 10(2), 103–112.

By: S. Fang

Source: NC State University Libraries
Added: July 31, 2021

1982 journal article

Traffic Equilibria on Multiclass-User Transportation Networks Analyzed via Variational Inequalities

Tamkang Journal of Mathematics, 13(1), 1–9.

By: S. Fang

Source: NC State University Libraries
Added: July 31, 2021

1982 report

User’s Guide of ERC Slitting Package

(Technical Report No. CC3083-02). AT&T Engineering Research Center.

By: C. Lamendola & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1981 report

Routing in a Network with Multi-Class Links

(Technical Report No. CC7479). AT&T Engineering Research Center.

By: S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1981 report

The Most Frequently Used Decreasing Algorithm for the 1.5-Dimensional Coil Slitting Problem

(Technical Report No. CC7455). AT&T Engineering Research Center.

By: C. Lamendola & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1981 report

The Most Frequently Used Decreasing Algorithm for the 2-Dimensional Coil Slitting Problem

(Technical Report No. CC7575). AT&T Engineering Research Center.

By: C. Lamendola & S. Fang

Source: NC State University Libraries
Added: August 28, 2021

1980 journal article

An iterative method for generalized complementarity problems

IEEE Transactions on Automatic Control, 25(6), 1225–1227.

By: S. Fang*

Sources: Crossref, NC State University Libraries
Added: June 13, 2021

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.