Skip to main content
Log in

Duality for Robust Linear Infinite Programming Problems Revisited

  • Original Article
  • Published:
Vietnam Journal of Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we consider the robust linear infinite programming problem (RLIPc) defined by

$$ \begin{array}{@{}rcl@{}} (\text{RLIP}_{c})\quad &&\inf \langle c,x\rangle \\ \text{subject to } &&x\in X,~\langle x^{\ast},x \rangle \le r,~\forall (x^{\ast},r)\in\mathcal{U}_{t},~ \forall t\in T, \end{array} $$

where X is a locally convex Hausdorff topological vector space, T is an arbitrary index set, cX, and \(\mathcal {U}_{t}\subset X^{\ast }\times \mathbb {R}\), tT are uncertainty sets. We propose an approach to duality for the robust linear problems with convex constraints (RPc) and establish corresponding robust strong duality and also, stable robust strong duality, i.e., robust strong duality holds “uniformly” with all cX. With the different choices/ways of setting/arranging data from (RLIPc), one gets back to the model (RPc) and the (stable) robust strong duality for (RPc) applies. By such a way, nine versions of dual problems for (RLIPc) are proposed. Necessary and sufficient conditions for stable robust strong duality of these pairs of primal-dual problems are given, for which some cover several known results in the literature while the others, due to the best knowledge of the authors, are new. Moreover, as by-products, we obtained from the robust strong duality for variants pairs of primal-dual problems, several robust Farkas-type results for linear infinite systems with uncertainty. Lastly, as extensions/applications, we extend/apply the results obtained to robust linear problems with sub-affine constraints, and to linear infinite problems (i.e., (RLIPc) with the absence of uncertainty). It is worth noticing even for these cases, we are able to derive new results on (robust/stable robust) duality for the mentioned classes of problems and new robust Farkas-type results for sub-linear systems, and also for linear infinite systems in the absence of uncertainty.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. In [3] this notion is named as star S-usc

  2. The model of Problem (RLPc) was considered in [12] where some characterizations of its solutions were proposed.

  3. \(\mathcal {N}_{8}\), \(\mathcal {N}_{9}\) are also convex.

References

  1. Bolintinéanu, S.: Vector variational principles towards asymptotically well behaved vector convex functions. In: Nguyen, V. H., Strodiot, J.-J., Tossings, P (eds.) Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 481, pp. 55–68. Springer, Berlin (2000)

  2. Bolintinéanu, S.: Vector variational principles; ε-efficiency and scalar stationarity. J. Convex Anal. 8, 71–85 (2001)

    MathSciNet  MATH  Google Scholar 

  3. Boţ, R.I.: Conjugate Duality in Convex Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 637. Springer, Berlin (2010)

    Book  Google Scholar 

  4. Boţ, R.I., Jeyakumar, V., Li, G.Y.: Robust duality in parametric convex optimization. Set-valued Var. Anal. 21, 177–189 (2013)

    Article  MathSciNet  Google Scholar 

  5. Chen, J., Li, J., Li, X., Lv, Y., Yao, J.-C.: Radius of robust feasibility of system of convex inequalities with uncertain data. J. Optim. Theory Appl. (to appear)

  6. Chuong, T.D., Jeyakumar, V.: An exact formula for radius of robust feasibility of uncertain linear programs. J. Optim. Theory Appl. 173, 203–226 (2017)

    Article  MathSciNet  Google Scholar 

  7. Chen, J., Köbis, E., Yao, J.-C.: Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints. J. Optim. Theory Appl. 181, 411–436 (2019)

    Article  MathSciNet  Google Scholar 

  8. Cho, H., Kim, K.-K., Lee, K.: Computing lower bounds on basket option prices by discretizing semi-infinite linear programming. Optim. Lett. 10, 1629–1644 (2016)

    Article  MathSciNet  Google Scholar 

  9. Daum, S., Werner, R.: A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing. Optimization 60, 1379–1398 (2011)

    Article  MathSciNet  Google Scholar 

  10. Dinh, N., Jeyakumar, V.: Farkas’ lemma: three decades of generalizations for mathematical optimization. TOP 22, 1–22 (2014)

    Article  MathSciNet  Google Scholar 

  11. Dinh, N., Goberna, M.A., López, M.A., Volle, M.: A unifying approach to robust convex infinite optimization duality. J. Optim. Theory Appl. 174, 650–685 (2017)

    Article  MathSciNet  Google Scholar 

  12. Dinh, N., Goberna, M.A., López, M.A., Mo, T.H.: Robust optimization revisited via robust vector Farkas lemmas. Optimization 66, 939–963 (2017)

    Article  MathSciNet  Google Scholar 

  13. Dinh, N., Long, D.H.: Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality. Acta Math. Vietnam. https://doi.org/10.1007/s40306-019-00349-y (2019)

  14. Dinh, N., Goberna, M.A., Volle, M.: Primal-dual optimization conditions for the robust sum of functions with applications. Appl. Math. Optim. 80, 643–664 (2019)

    Article  MathSciNet  Google Scholar 

  15. Dinh, N., Goberna, M.A., Volle, M.: Duality for the robust sum of functions. Set-valued Var. Anal. https://doi.org/10.1007/s11228-019-00515-2 (2019)

  16. Dinh, N., Mo, T.H., Vallet, G., Volle, M.: A unified approach to robust Farkas-type results with applications to robust optimization problems. SIAM J. Optim. 27, 1075–1101 (2017)

    Article  MathSciNet  Google Scholar 

  17. Dinh, N., Nghia, T.T.A., Vallet, G.: A closedness condition and its applications to DC programs with convex constraints. Optimization 59, 541–560 (2010)

    Article  MathSciNet  Google Scholar 

  18. Fang, D., Li, C., Yao, J.-C.: Stable Lagrange dualities for robust conical programming. J. Nonlinear and Convex Anal. 16, 2141–2158 (2015)

    MathSciNet  MATH  Google Scholar 

  19. Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)

    MATH  Google Scholar 

  20. Goberna, M.A., Jeyakumar, V., Li, G., López, M.A.: Robust linear semi-infinite programming duality under uncertainty. Math. Program. Ser. B 139, 185–203 (2013)

    Article  MathSciNet  Google Scholar 

  21. Goberna, M.A., Jeyakumar, V., Li, G., Vicente-Pérez, J.: Robust solutions of multi-objective linear semi-infinite programs under constraint data uncertainty. SIAM J. Optim. 24, 1402–1419 (2014)

    Article  MathSciNet  Google Scholar 

  22. Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384–3407 (2010)

    Article  MathSciNet  Google Scholar 

  23. Jeyakumar, V., Li, G.Y.: Robust Farkas’ lemma for uncertain linear systems with applications. Positivity 15, 331–342 (2011)

    Article  MathSciNet  Google Scholar 

  24. Li, G.Y., Jeyakumar, V., Lee, G.M.: Robust conjugate duality for convex optimization under uncertainty with application to data classification. Nonlinear Anal. 74, 2327–2341 (2011)

    Article  MathSciNet  Google Scholar 

  25. Li, G., Ng, K.F.: On extension of Fenchel duality and its application. SIAM J. Optim. 19, 1489–1509 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is partly supported by the project “Generalized scalar and vector Farkas-type results with applications to optimization theory”, Vietnam National University-Ho Chi Minh city, Vietnam.

Part of the work of the first author was realized when he visited Center for General Education, China Medical University, Taiwan. He expresses his sincere thanks to the hospitality he received.

The authors are grateful to the anonymous referee for his/her careful reading, valuable comments and suggestions that help to improve the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Dinh.

Additional information

Dedicated to Professor Marco Antonio López’s 70th birthday.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A: Proof of Proposition 6

  1. (i)

    From the proof of Theorem 2 for the case i = 1, we can see that the problem (RLIPc) can be transformed to (RPc) with \(Z=\mathbb {R}\), \(S=\mathbb {R}_{+}\), \(\mathcal {U}={\mathcal{V}}\), Gv(⋅) = v1(⋅) − v2 for all \(v\in {\mathcal{V}}\), and in such a case, \({\mathcal{M}}_{0}=\mathcal {N}_{1}\). Observe that the functions v↦〈v1, x〉− v2, xX, are concave (actually, they are affine). Together with the fact that \({\mathcal{V}}\) is convex and \(Z=\mathbb {R}\), the collection (vGv(x))xX is uniformly \(\mathbb {R}_{+}\)-concave. So, in the light of Proposition 2(i), \({\mathcal{M}}_{0}\) is convex, and so is \(\mathcal {N}_{1}\).

  2. (ii)

    By the same argument as above, to prove \(\mathcal {N}_{3}\) is convex, it is sufficient to show that the collection (uGu(x))xX is uniformly \(\mathbb {R}_{+}^{(T)}\)-concave with \(\mathcal {U}={\mathcal{U}}\), \(Z=\mathbb {R}^{T}\) and \(G_{u}(\cdot )=(\langle {u^{1}_{t}},\cdot \rangle - {u^{2}_{t}})_{t\in T}\) for all \(u\in {\mathcal{U}}\) (the setting in the proof of Theorem 2 for the case i = 3). Now, take arbitrarily \(\lambda ,\mu \in \mathbb {R}^{(T)}_{+}\) and \(u,w\in {\mathcal{U}}\). Let \(\bar \lambda \in \mathbb {R}^{(T)}_{+}\) and \(\bar u\in {\mathcal{U}}\) such that \(\bar \lambda _{t}=\lambda _{t}+\mu _{t}\), \({\bar {u}^{2}_{t}}=\min \limits \{{u^{2}_{t}}, {w^{2}_{t}}\}\) and

    $$ {\bar{u}_{t}^{1}}=\left\{\begin{array}{ll} \frac{1}{\bar \lambda_{t}}(\lambda_{t} {u^{1}_{t}}+\mu_{t} {w^{1}_{t}})&\quad \text{ if } \lambda_{t}+\mu_{t}\ne 0,\\ {u^{1}_{t}}&\quad\text{ otherwise} \end{array}\right. $$

    (\(\bar u \in {\mathcal{U}}\) as \(\{x^{\ast }\in X^{\ast }: (x^{\ast }, r)\in \mathcal {U}_{t}\}\) is convex for all tT). Then, it is easy to check that

    $$ \lambda_{t}(\langle {u^{1}_{t}},x\rangle -{u^{2}_{t}}) + \mu_{t}(\langle {w^{1}_{t}},x\rangle - {w^{2}_{t}}) \le \bar \lambda_{t} (\langle {\bar{u}^{1}_{t}},x\rangle - {\bar{u}^{2}_{t}})\quad\forall t\in T,~\forall x\in X, $$

    and consequently,

    $$ \sum\limits_{t\in T}{\lambda^{1}_{t}}(\langle {u^{1}_{t}},x\rangle - {u^{2}_{t}}) + \sum\limits_{t\in T}{\lambda^{2}_{t}}(\langle {w^{1}_{t}},x\rangle - {w^{2}_{t}})\le \sum\limits_{t\in T}\bar \lambda_{t} (\langle {\bar{u}^{1}_{t}},x\rangle - {\bar{u}^{1}_{t}})\quad \forall x\in X, $$

    which means \(\lambda G_{u}(x)+\mu G_{w}(x)\le \bar \lambda G_{\bar u}(x)\) for all xX, yielding the uniform \(\mathbb {R}_{+}^{(T)}\)-concavity of the collection (uGu(x))xX. The conclusion now follows from Proposition 2(i).

  3. (iii)

    Recall that \(\mathcal {N}_{4}\) is a specific form of \({\mathcal{M}}_{0}\) with \(Z=\mathbb {R}\), \(S=\mathbb {R}_{+}\), \(\mathcal {U}=T\), and \(G_{t}(\cdot )= \sup _{v\in \mathcal {U}_{t}} [\langle v^{1}, \cdot \rangle - v^{2}]\) for all tT (the setting in the proof of Theorem 2 for the case i = 4). Now, for each tT and xX, as \(\mathcal {U}_{t}=\mathcal {U}^{1}_{t}\times \mathcal {U}^{2}_{t}\) (with \(\mathcal {U}^{1}_{t}\subset X^{\ast }\) and \(\mathcal {U}^{2}_{t} \subset \mathbb {R}\)), it holds

    $$ G_{t}(x)=\sup\limits_{x^{\ast}\in \mathcal{U}^{1}_{t}} \langle x^{\ast},x\rangle - \inf\limits_{r\in \mathcal{U}^{2}_{t}}r = \sup\limits_{x^{\ast}\in \mathcal{U}^{1}_{t}} \langle x^{\ast},x\rangle - \inf \mathcal{U}^{2}_{t}. $$

    So, for all xX, because T is convex, \(t\mapsto \sup _{x^{\ast }\in \mathcal {U}^{1}_{t}} \langle x^{\ast }, x\rangle \) is affine, and \(t \mapsto \inf \mathcal {U}^{2}_{t}\) is convex, the function tGt(x) is concave. This accounts for the uniform \(\mathbb {R}^{(T)}_{+}\)-concavity of the collection (tGt(x))xX. The conclusion again follows from Proposition 2(i).

  4. (iv)

    Consider the ways of transforming (RLIPc) to (RPc) in the proofs of Theorem 3 for the case i = 6, 7. Note that, in these ways, the uncertain set \(\mathcal {U}\) is always a singleton. So, the corresponding qualifying sets (i.e, \(\mathcal {N}_{6}\) and \(\mathcal {N}_{7}\)) are always convex (see Remark 3).

Appendix B: Proof of Proposition 7

Recall that \(\mathcal {N}_{i}\), i = 1, 2,…, 7, are specific forms of \({\mathcal{M}}_{0}\) following the corresponding ways transforming of (RLIPc) to (RPc) considered in the proofs of Theorems 2 and 3. So, to prove that \(\mathcal {N}_{i}\) is closed, we make use of Proposition 2(ii), which provides some sufficient condition for the closedness of the robust moment cone \({\mathcal{M}}_{0}\).

  1. (i)

    For i = 1, let us consider the way of transforming (RLIPc) to (RPc) by setting \(Z=\mathbb {R}\), \(S=\mathbb {R}_{+}\), \(\mathcal {U}={\mathcal{V}}\), and Gv(⋅) = 〈v1,⋅〉− v2 for all \(v \in {\mathcal{V}}\). For all xX, it is easy to see that the function vGv(x) = 〈v1, x〉− v2 is continuous, and hence, it is \(\mathbb {R}^{+}\)-usc (see Remark 1(iii)). Moreover, \(\text {gph} {\mathcal{U}}\) is compact, \(\mathbb {R}\) is normed space, and (16) ensures the fulfilling of condition (C0) in Proposition 2. The closedness of \(\mathcal {N}_{1}\) follows from Proposition 2(ii).

  2. (ii)

    For i = 4, consider the way of transforming with the setting \(Z=\mathbb {R}\), \(S=\mathbb {R}_{+}\), \(\mathcal {U}=T\), and \(G_{t}(\cdot )= \sup _{v\in \mathcal {U}_{t}} [\langle v^{1}, \cdot \rangle - v^{2}]\) for all tT. One has that \(\mathcal {U}=T\) is a compact set, that \(t\mapsto G_{t}(x)= \sup _{v\in \mathcal {U}_{t}} [\langle v^{1}, x\rangle -v^{2}]\) is usc and hence, it is \(\mathbb {R}^{+}\)-usc, and that Slater-type condition (C0) holds (as (17) holds). The conclusion now follows from Proposition 2(ii).

  3. (iii)

    Consider the way of transforming which corresponds to i = 5, i.e., we consider \(Z=\mathbb {R}\), \(S=\mathbb {R}_{+}\), \(\mathcal {U}={\mathcal{U}}\), and \(G_{u}(\cdot )= \sup _{t\in T}[\langle {u^{1}_{t}}, \cdot \rangle - {u^{2}_{t}}]\) for all \(u\in {\mathcal{U}}\). As \({\mathcal{U}}={\prod }_{t\in T} \mathcal {U}_{t}\), the assumption that \(\mathcal {U}_{t}\) is compact for all tT which entails the compactness of \({\mathcal{U}}\). The other assumptions ensure the fulfillment of conditions in Proposition 2(ii) and the conclusion follows from this very proposition.

  4. (iv)

    For i = 7, using the same argument as above in transforming (RLIPc) to (RPc) in the proof of Theorem 3. As by this way, the uncertainty set is a singleton, and hence, \(\mathcal {N}_{7}\) is convex (see Remark 3). Now from Proposition 2(ii), Slater-type condition ensures the closedness of the robust moment cone \(\mathcal {N}_{7}\), as desired.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dinh, N., Long, D.H. & Yao, JC. Duality for Robust Linear Infinite Programming Problems Revisited. Vietnam J. Math. 48, 589–613 (2020). https://doi.org/10.1007/s10013-020-00383-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10013-020-00383-6

Keywords

Mathematics Subject Classification (2010)

Navigation